Cod sursa(job #2801158)

Utilizator hhhhhhhAndrei Boaca hhhhhhh Data 15 noiembrie 2021 10:22:18
Problema Componente tare conexe Scor 60
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.37 kb
#include <bits/stdc++.h>
//#pragma GCC optimize("O3")
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
int n,m;
vector<int> muchii[100005],st,edge[100005],comp;
vector<vector<int>> sol;
bool use[100005];
void dfs1(int nod)
{
    use[nod]=1;
    for(int i=0;i<muchii[nod].size();i++)
        if(!use[muchii[nod][i]])
            dfs1(muchii[nod][i]);
    st.push_back(nod);
}
void dfs(int nod)
{
    use[nod]=1;
    comp.push_back(nod);
    for(int i=0;i<edge[nod].size();i++)
        if(!use[edge[nod][i]])
            dfs(edge[nod][i]);
}
int main()
{
    ios_base::sync_with_stdio(false);
    fin.tie(0);
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int a,b;
        fin>>a>>b;
        muchii[a].push_back(b);
    }
    for(int i=1;i<=n;i++)
        if(!use[i])
            dfs1(i);
    reverse(st.begin(),st.end());
    for(int i=1;i<=n;i++)
    {
        use[i]=0;
        for(int j=0;j<muchii[i].size();j++)
            edge[muchii[i][j]].push_back(i);
    }
    for(int i=0;i<st.size();i++)
        if(!use[st[i]])
        {
            comp.clear();
            dfs(st[i]);
            sol.push_back(comp);
        }
    fout<<sol.size()<<'\n';
    for(int i=0;i<sol.size();i++)
    {
        for(int j=0;j<sol[i].size();j++)
            fout<<sol[i][j]<<' ';
        fout<<'\n';
    }
    return 0;
}