Cod sursa(job #3226595)

Utilizator AndreiBOTOBotocan Andrei AndreiBOTO Data 22 aprilie 2024 10:28:06
Problema Componente tare conexe Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.47 kb
#include <bits/stdc++.h>

#pragma optimize GCC ("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

///#include <tryhardmode>
///#include <GODMODE::ON>

using namespace std;

#define cin fin
#define cout fout

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

const int NMAX=1e5+5;

vector<int>comp[NMAX];
vector<int>rev[NMAX];
vector<int>v[NMAX];
stack<int>stiva;
int color[NMAX];
bool viz[NMAX];
int kon;

void dfs(int p)
{
    viz[p]=true;
    for(auto i:v[p])
    {
        if(!viz[i])
            dfs(i);
    }
    stiva.push(p);
}

void dfsc(int p)
{
    viz[p]=true;
    color[p]=kon;
    comp[kon].push_back(p);
    for(auto i:rev[p])
        if(!viz[i])
            dfsc(i);
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int n,m,i,j;
    cin>>n>>m;
    for(i=1;i<=m;i++)
    {
        int x,y;
        cin>>x>>y;
        v[x].push_back(y);
        rev[y].push_back(x);
    }
    for(i=1;i<=n;i++)
        if(!viz[i])
            dfs(i);
    for(i=1;i<=n;i++)
        viz[i]=false;
    while(!stiva.empty())
    {
        int p=stiva.top();
        stiva.pop();
        if(!viz[p])
        {
            kon++;
            dfsc(p);
        }
    }
    cout<<kon<<"\n";
    for(i=1;i<=kon;i++)
    {
        for(auto it:comp[i])
            cout<<it<<" ";
        cout<<"\n";
    }
    fin.close();
    fout.close();
    return 0;
}