Cod sursa(job #2117175)

Utilizator UWantMyNameGheorghe Vlad Camil UWantMyName Data 28 ianuarie 2018 17:21:59
Problema Componente tare conexe Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 1.35 kb
#include <bits/stdc++.h>
#define in "ctc.in"
#define out "ctc.out"
#define Nmax 100003
using namespace std;
ifstream fin(in);
ofstream fout(out);

int n,m;
int viz[Nmax];
vector <int> L[Nmax];
vector <int> T[Nmax];
int st[Nmax],top;
int ctc[Nmax],nrcon;

void Read()
{
    int i,x,y;

    fin >> n >> m;
    for (i = 1; i <= m; i++)
    {
        fin >> x >> y;
        L[x].push_back(y);
        T[y].push_back(x);
    }
}

void DFSt(int k)
{
    viz[k] = 1;
    ctc[k] = nrcon;
    for (auto i : T[k])
        if (viz[i] == 0 && ctc[i] == 0) DFSt(i);
}

void DFS_tf(int k)
{
    viz[k] = 1;
    for (auto i : L[k])
        if (viz[i] == 0) DFS_tf(i);
    top++;
    st[top] = k;
}

void CTC()
{
    int i,k;

    for (i = 1; i <= n; i++)
        if (viz[i] == 0) DFS_tf(i);

    for (i = 1; i <= n; i++)
        viz[i] = 0;

    while (top > 0)
    {
        k = st[top--];

        if (ctc[k] == 0)
        {
            nrcon++;
            DFSt(k);
        }
    }
}

void Afis()
{
    int i;

    fout << nrcon << "\n";
    sort(ctc+1,ctc+nrcon+1);

    for (i = 1; i < n; i++)
        if (ctc[i] == ctc[i+1]) fout << i << " ";
        else fout << i << "\n";
    fout << n << "\n";
}

int main()
{
    Read();
    CTC();
    Afis();

    fin.close();
    fout.close();
    return 0;
}