Cod sursa(job #3372763)

Utilizator hugsfromluizaCroitoru Luiza hugsfromluiza Data 4 noiembrie 2026 21:55:23
Problema Componente biconexe Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.51 kb
#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
using namespace std;
ifstream fin("biconex.in");
ofstream fout("biconex.out");

int n, m;
vector<int> l[100005];
int adc[100005], best[100005];
int t;
stack<int> st;
vector<vector<int>> comp;

void dfs(int nod, int p) {
    adc[nod] = best[nod] = ++t;
    st.push(nod);
    for(auto& v : l[nod]) {
        if(v != p) {
            if(adc[v] != 0) {
                best[nod] = min(best[nod], adc[v]);
            }
            else {
                dfs(v, nod);
                best[nod] = min(best[nod], best[v]);
                if(best[v] >= adc[nod]) {
                    vector<int> c;
                    c.push_back(nod);
                    while(true) {
                        int k = st.top();
                        st.pop();
                        c.push_back(k);
                        if(k == v)
                            break;
                    }
                    comp.push_back(c);
                }
            }
        }
    }
}

int main() {
    fin >> n >> m;
    for(int i = 0; i < m; i++) {
        int a, b;
        fin >> a >> b;
        l[a].push_back(b);
        l[b].push_back(a);
    }
    
    for(int i = 1; i <= n; i++) {
        if(adc[i] == 0) {
            dfs(i, 0);
        }
    }
    
    fout << comp.size() << "\n";
    for(auto& c : comp) {
        for(auto& nod : c) {
            fout << nod << " ";
        }
        fout<<endl; 
    }
    return 0;
}