Cod sursa(job #1971413)

Utilizator GinguIonutGinguIonut GinguIonut Data 20 aprilie 2017 13:34:28
Problema Componente tare conexe Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.45 kb
#include <fstream>
#include <vector>
#include <string.h>

#define INF 2000000000
#define nMax 100001
#define confMax (1 << 18)
#define pb push_back
#define mkp make_pair

using namespace std;

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

int n, m, nrctc, ind;
int lev[nMax], low[nMax], viz[nMax];
vector<int> G[nMax], ctc[nMax], stck;

void tarjan(int node)
{
    stck.pb(node);
    lev[node]=low[node]=++ind;
    viz[node]=1;

    for(vector<int>::iterator it=G[node].begin(); it!=G[node].end(); it++)
    {
        int fiu=*it;
        if(lev[fiu]==0)
        {
            tarjan(fiu);
            low[node]=min(low[node], low[fiu]);
        }
        else
            if(viz[fiu])
                low[node]=min(low[node], low[fiu]);
    }

    if(low[node]==lev[node])
    {
        nrctc++;
        int nodeAux;
        do
        {
            nodeAux=stck.back();
            stck.pop_back();
            ctc[nrctc].pb(nodeAux);
            viz[nodeAux]=0;
        }
        while(nodeAux!=node);
    }
}

int main()
{
    int a, b;
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        fin>>a>>b;
        G[a].pb(b);
    }

    for(int i=1; i<=n; i++)
        if(lev[i]==0)
            tarjan(i);
    fout<<nrctc<<'\n';
    for(int i=1; i<=nrctc; i++)
    {
        for(vector<int>::iterator it=ctc[i].begin(); it!=ctc[i].end(); it++)
            fout<<*it<<" ";
        fout<<'\n';
    }
}