Cod sursa(job #3374926)

Utilizator DartokeMoisi David Dartoke Data 9 noiembrie 2026 19:19:23
Problema Componente biconexe Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.4 kb
#include <fstream>
#include <vector>
#include <stack>
#include <algorithm>

using namespace std;

ifstream fin("biconex.in");
ofstream fout("biconex.out");

const int MAXN = 100005;
vector<int> adj[MAXN];
int dfn[MAXN], low[MAXN], timer;
stack<int> st;
vector<vector<int>> comps;

void dfs(int u, int p) {
    dfn[u] = low[u] = ++timer;
    st.push(u);

    for (int v : adj[u]) {
        if (v == p) continue;
        if (dfn[v]) {
            low[u] = min(low[u], dfn[v]);
        } else {
            dfs(v, u);
            low[u] = min(low[u], low[v]);

            if (low[v] >= dfn[u]) {
                vector<int> comp;
                int x;
                do {
                    x = st.top();
                    st.pop();
                    comp.push_back(x);
                } while (x != v);
                comp.push_back(u);
                comps.push_back(comp);
            }
        }
    }
}

int main() {
    int n, m;
    fin >> n >> m;
    for (int i = 0; i < m; ++i) {
        int u, v;
        fin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    for (int i = 1; i <= n; ++i) {
        if (!dfn[i]) dfs(i, 0);
    }

    fout << comps.size() << "\n";
    for (const auto& comp : comps) {
        for (int node : comp) {
            fout << node << " ";
        }
        fout << "\n";
    }

    return 0;
}