Cod sursa(job #2512929)

Utilizator deiubejanAndrei Bejan deiubejan Data 21 decembrie 2019 22:12:46
Problema Componente tare conexe Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.34 kb
#include <bits/stdc++.h>
using namespace std;

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

/*
*/
#define cin fin
#define cout fout


const int NMAX=1e5+10;
const int MMAX=2e5+10;

int n, m, x, y, k, kscc;
vector<int>rel[NMAX];
deque<int>Stack;
int instack[NMAX];
int ids[NMAX];
int low[NMAX];
vector<int>sccs[NMAX];


void read()
{
    cin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        cin>>x>>y;
        rel[x].push_back(y);
    }
}


void scc(int nod)
{
    Stack.push_back(nod);
    instack[nod]=1;
    ids[nod]=low[nod]=++k;
    for(auto el:rel[nod])
    {
        if(!ids[el])
            scc(el);
        if(instack[el])
            ids[nod]=min(ids[nod], ids[el]);
    }
    if(ids[nod]==low[nod])
    {
        kscc++;
        while(!Stack.empty())
        {
            int aux=Stack.back();
            Stack.pop_back();
            instack[aux]=0;
            sccs[kscc].push_back(aux);
            low[aux]=ids[nod];
            if(aux==nod)
                break;
        }
    }
}

void solve()
{
    for(int i=1; i<=n; i++)
        if(!ids[i])
            scc(i);
    cout<<kscc<<"\n";
    for(int i=1; i<=kscc; i++)
    {
        for(auto el:sccs[i])
            cout<<el<<" ";
        cout<<"\n";
    }
}


int main()
{
    read();
    solve();

    return 0;
}