Cod sursa(job #3372633)

Utilizator G_DenisaGroza Denisa-Georgiana G_Denisa Data 4 noiembrie 2026 15:53:55
Problema Componente tare conexe Scor 24
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.42 kb
#include <iostream>
#include <vector>
#include <fstream>

//Algoritmul lui Kosaraju
//complexitate: O(m+n)
using namespace std;

vector<vector<int> > G, GT;

int n , m , contor;

vector<bool> V;
vector<int> S;
vector<int> current_component;

void dfs(int k)
{
    V[k] = true;
    for(auto x : G[k])
        if(!V[x])
            dfs(x);
    S.push_back(k);
}

void dfsGT(int k)
{
    V[k] = true;
    current_component.push_back(k);
    for(auto x: GT[k])
        if(! V[x])
            dfsGT(x);

}

int main()
{
    ifstream f ("ctc.in");
    f >> n >> m;
    G = GT = vector<vector<int>>(n + 1);
    for(int i = 1 ; i <= m ; i++)
    {
        int a , b;
        f >> a >> b;
        G[a].push_back(b);
        GT[b].push_back(a);
    }
    f.close();

    V = vector<bool> (n + 1, false);
    for(int i = 1 ; i <= n ; i ++)
        if(! V[i])
            dfs(i);

    vector<vector<int>> ctc_list;
    V = vector<bool> (n + 1, false);
    for(vector<int>::reverse_iterator it = S.rbegin() ; it != S.rend() ; it ++)
        if(!V[*it]) {
            contor ++;
            dfsGT(*it);
            ctc_list.push_back(current_component);
        }

    ofstream g("ctc.out");
    g << contor << "\n";
    for(const auto& comp : ctc_list)
    {
        for(int node : comp)
        {
            g << node << " ";
        }
        g << endl;
    }
    g.close();

    return 0;
}