Cod sursa(job #2871435)

Utilizator Biencutza04Leoveanu Bianca Biencutza04 Data 14 martie 2022 18:45:42
Problema Componente tare conexe Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.99 kb
#include <bits/stdc++.h>
#define N 100005
using namespace std;
ifstream f("ctc.in"); ofstream g("ctc.out");
vector<int>G[N],GT[N],ctc[N];
int n,m,timp,nr,F[N],Use[N];
void dfs(int x)
{   Use[x]=1;
    for(unsigned int j,i=0;i<G[x].size();i++)
    {   j=G[x][i];
        if(!Use[j]) dfs(j);
    }
    F[++timp]=x;
}
void dfst(int x)
{   Use[x]=1;
    ctc[nr].push_back(x);
    for(unsigned j,i=0;i<GT[x].size();i++)
    {   j=GT[x][i];
        if(!Use[j]) dfst(j);
    }
}
int main()
{   f>>n>>m;
    for(int x,y,i=1;i<=m;i++)
    {   f>>x>>y;
        G[x].push_back(y);
        GT[y].push_back(x);
    }
    for(int i=1;i<=n;i++)
        if(!Use[i]) dfs(i);
    for(int i=1;i<=n;i++) Use[i]=0;
    for(int i=n;i;i--)
        if(!Use[i]) {nr++; dfst(F[i]);}
    g<<nr<<'\n';
    for(int i=1;i<=nr;i++)
    {   sort(ctc[i].begin(),ctc[i].end());
        for(unsigned int j=0;j<ctc[i].size();j++) g<<ctc[i][j]<<' ';
        g<<'\n';

    }
    g.close(); f.close(); return 0;
}