Cod sursa(job #3374181)

Utilizator nic150Musat Nicoleta nic150 Data 8 noiembrie 2026 20:01:34
Problema Componente biconexe Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.97 kb
//Complexitate O(n+m)
#include <bits/stdc++.h>
using namespace std;

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

const int NMAX = 100005;

vector<int> g[NMAX];
vector<int> componente[NMAX];

int disc[NMAX], low[NMAX];
int folosit[NMAX];

int timerDFS = 0, nrCTC = 0;

stack<pair<int, int>> st;

void dfs(int nod, int tata) {
    disc[nod] = low[nod] = ++timerDFS;

    for (int vecin : g[nod]) {
        if (vecin == tata)
            continue;

        if (disc[vecin] == 0) {
            st.push({nod, vecin});

            dfs(vecin, nod);

            low[nod] = min(low[nod], low[vecin]);

            if (low[vecin] >= disc[nod]) {
                nrCTC++;

                while (true) {
                    int x = st.top().first;
                    int y = st.top().second;
                    st.pop();

                    if (folosit[x] != nrCTC) {
                        folosit[x] = nrCTC;
                        componente[nrCTC].push_back(x);
                    }

                    if (folosit[y] != nrCTC) {
                        folosit[y] = nrCTC;
                        componente[nrCTC].push_back(y);
                    }

                    if (x == nod && y == vecin)
                        break;
                }
            }
        }
        else if (disc[vecin] < disc[nod]) {
            st.push({nod, vecin});

            low[nod] = min(low[nod], disc[vecin]);
        }
    }
}

int main() {
    int n, m;
    fin >> n >> m;

    for (int i = 0; i < m; i++) {
        int x, y;
        fin >> x >> y;

        g[x].push_back(y);
        g[y].push_back(x);
    }

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

    fout << nrCTC << '\n';

    for (int i = 1; i <= nrCTC; i++) {
        for (int nod : componente[i]) {
            fout << nod << " ";
        }
        fout << '\n';
    }

    return 0;
}