Cod sursa(job #3374891)

Utilizator GabrielaTudoracheTudorache Gabriela GabrielaTudorache Data 9 noiembrie 2026 18:00:56
Problema Componente biconexe Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.65 kb
#include<fstream>
#include<vector>
#include<stack>
#include<algorithm>
using namespace std;

vector<vector<int>> vecini;
vector<int> tin;  
vector<int> low;   
int timp = 0;

stack<int> stiva;                  
vector<vector<int>> componente;    

void scoateComponenta(int fiu, int nod) {
    vector<int> comp;
    while (true) {
        int x = stiva.top();
        stiva.pop();
        comp.push_back(x);
        if (x == fiu) {
            break;
        }
    }
    comp.push_back(nod);
    componente.push_back(comp);
}

void dfs(int nod, int tata) {
    timp++;
    tin[nod] = timp;
    low[nod] = timp;
    stiva.push(nod);

    for (int vecin : vecini[nod]) {
        if (vecin == tata) {
            continue;
        }
        if (tin[vecin] == 0) {
            dfs(vecin, nod);
            low[nod] = min(low[nod], low[vecin]);
            if (low[vecin] >= tin[nod]) {
                scoateComponenta(vecin, nod);
            }
        } else {
            low[nod] = min(low[nod], tin[vecin]);
        }
    }
}

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

    int n, m;
    fin >> n >> m;

    vecini.resize(n + 1);
    tin.assign(n + 1, 0);
    low.assign(n + 1, 0);

    for (int i = 0; i < m; i++) {
        int x, y;
        fin >> x >> y;
        vecini[x].push_back(y);
        vecini[y].push_back(x);
    }

    for (int v = 1; v <= n; v++) {
        if (tin[v] == 0) {
            dfs(v, 0);
            stiva.pop();  
        }
    }

    fout << componente.size() << "\n";
    for (vector<int> comp : componente) {
        for (int x : comp) {
            fout << x << " ";
        }
        fout << "\n";
    }
    return 0;
}