Cod sursa(job #3370472)

Utilizator matei__bBenchea Matei matei__b Data 26 octombrie 2026 13:40:48
Problema Componente tare conexe Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.35 kb
// https://www.infoarena.ro/problema/ctc

#include <bits/stdc++.h>
using namespace std;

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

const int NMAX=1e5+8;

int n,m;
vector<int> g[NMAX],gt[NMAX];
bool viz[NMAX];
vector<int> stk;
vector<int> curr;

void dfs1(int nod) {
    viz[nod]=1;
    for(const auto &vec:g[nod]) {
        if(!viz[vec]) {
            dfs1(vec);
        }
    }
    stk.push_back(nod);
}

void dfs2(int nod) {
    viz[nod]=1;
    curr.push_back(nod);
    for(const auto &vec:gt[nod]) {
        if(!viz[vec]) {
            dfs2(vec);
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    fin.tie(nullptr);
    fout.tie(nullptr);

    fin >> n >> m;
    for(int i=1; i<=m; i++) {
        int x,y;
        fin >> x >> y;
        g[x].push_back(y);
        gt[y].push_back(x);
    }

    for(int i=1; i<=n; i++) {
        if(!viz[i]) {
            dfs1(i);
        }
    }
    for(int i=1; i<=n; i++) {
        viz[i]=0;
    }

    reverse(stk.begin(),stk.end());
    vector<vector<int> > ans;

    for(const auto &nod:stk) {
        if(viz[nod]) {
            continue;
        }
        curr.clear();
        dfs2(nod);
        ans.push_back(curr);
    }

    fout << (int)ans.size() << "\n";
    for(const auto &v:ans) {
        for(const auto &it:v) {
            fout << it << " ";
        }
        fout << "\n";
    }

    return 0;
}