Cod sursa(job #2781111)

Utilizator guzgandemunteIonescu Laura guzgandemunte Data 8 octombrie 2021 14:57:43
Problema Componente tare conexe Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.46 kb
#include <bits/stdc++.h>
#include <fstream>
#define VMAX 100000
#define EMAX 200000
using namespace std;

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

vector <int> adj[VMAX];
vector <int> aux[VMAX];
vector <int> toate[EMAX];

int V, E, x, y, lg_stiva, contor;
int stiva[VMAX];
bool vis[VMAX];

void DFS(int u)
{
    vis[u] = true;
    stiva[lg_stiva++] = u;
    for (int w = 0; w < adj[u].size(); ++w)
        if (!vis[adj[u][w]]) DFS(adj[u][w]);
}

void DFS_2(int u)
{
    vis[u] = true;
    toate[contor].push_back(u);
    for (int w = 0; w < aux[u].size(); ++w)
        if (!vis[aux[u][w]]) DFS_2(aux[u][w]);
}

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

    fin >> V >> E;

    for (int i = 0; i < E; i++)
    {
        fin >> x >> y;
        x--, y--;
        adj[x].push_back(y);
        aux[y].push_back(x);
    }

    for (int i = 0; i < V; i++)
        if (vis[i] == false) DFS(i);

    for (int i = 0; i < V; i++)
        vis[i] = false;

    for (int i = lg_stiva - 1; i >= 0; --i)
    {
        x = stiva[i];
        if (!vis[x])
        {
            DFS_2(x);
            contor++;
        }
    }

    fout << contor << endl;

    for (int i = 0; i < contor; ++i)
    {
        for (int j = 0; j < toate[i].size(); ++j)
            fout << toate[i][j] + 1 << " ";
        fout << endl;
    }

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