Cod sursa(job #2979259)

Utilizator AlbuDariusAlbu Darius AlbuDarius Data 14 februarie 2023 21:04:18
Problema Componente tare conexe Scor 60
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.35 kb
#include <fstream>

using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
int n, m, a[2][200005], start[100005], a1[2][200005], start1[100005], nr, p[100005], mi[100005], viz[100005], sol[100005], lg;
void df1(int nod);
void df2(int nod);
void plusminus();
int main()
{
    int i, x, y;
    fin >> n >> m;
    for (i = 1; i <= m; i++) {
        fin >> x >> y;
        a[0][i] = y;
        a[1][i] = start[x];
        start[x] = i;
        a1[0][i] = x;
        a1[1][i] = start1[y];
        start1[y] = i;
    }
    plusminus();
    fout << nr << "\n";
    for (i = 1; i <= lg; i++)
        if (sol[i] > 0)
            fout << sol[i] << " ";
        else
            fout << "\n";
    return 0;
}
void df1(int nod)
{
    int x;
    p[nod] = nr;
    x = start[nod];
    while (x) {
        if (p[a[0][x]] != nr)
            df1(a[0][x]);
        x = a[1][x];
    }
}
void df2(int nod)
{
    int x;
    mi[nod] = nr;
    if (p[nod] == nr) {
        sol[++lg] = nod;
        viz[nod] = 1;
    }
    x = start1[nod];
    while (x) {
        if (mi[a1[0][x]] != nr)
            df2(a1[0][x]);
        x = a1[1][x];
    }
}
void plusminus()
{
    int i;
    for (i = 1; i <= n; i++)
        if (viz[i] == 0) {
            nr++;
            df1(i);
            df2(i);
            sol[++lg] = -1;
        }
}