Cod sursa(job #3374851)

Utilizator vladl02Lungu Vladislav vladl02 Data 9 noiembrie 2026 15:14:08
Problema Componente tare conexe Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.49 kb
#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
#include <algorithm>

using namespace std;

ifstream file_in("ctc.in");
ofstream file_out("ctc.out");


vector<vector<int>> adj, adjT;
vector<bool> viz;
stack<int> stiva;
vector<vector<int>> ctc;

int n, m, k;


void DFS1(int s) {
    viz[s] = 1;

    for (int i : adj[s]) {
        if (!viz[i]) {
            DFS1(i);
        }
    }

    stiva.push(s);
}


void DFS2(int s, vector<int>& comp) {
    viz[s] = 1;

    for (int i : adjT[s]) {
        if (!viz[i]) {
            DFS2(i, comp);
        }
    }

    comp.push_back(s);
}

int main() {

    file_in >> n >> m;

    adj.resize(n + 1);
    adjT.resize(n + 1);
    viz.resize(n + 1);

    for (int i = 1; i <= m; i++) {
        int v1, v2;
        file_in >> v1 >> v2;

        adj[v1].push_back(v2);
        adjT[v2].push_back(v1);
    }

    // Kosaraju
    for (int i = 1; i <= n; i++) {
        if (!viz[i]) {
            DFS1(i);
        }
    }

    fill(viz.begin(), viz.end(), 0);

    while (!stiva.empty()) {
        int nod = stiva.top();
        stiva.pop();

        if (!viz[nod]) {
            vector<int> comp;
            DFS2(nod, comp);
            ctc.push_back(comp);
        }
    }

    file_out << ctc.size() << '\n';

    for (auto comp_el: ctc){
        for (auto el: comp_el){
            file_out << el << ' ';
        }
        file_out << '\n';
    }

    return 0;
}