Cod sursa(job #3374951)

Utilizator ambicepsmareBugeac Alexandru ambicepsmare Data 9 noiembrie 2026 20:07:43
Problema Componente tare conexe Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 2.14 kb

#include <iostream>
#include <fstream>
#include <vector>
#include <stack>

using namespace std;

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

const int NMAX = 100001;

int n, m;

vector<int> graf[NMAX];
vector<int> grafT[NMAX];

bool viz[NMAX];
int poz[NMAX];

vector<int> ordine;
vector<vector<int> > componente;

void dfs1(int start)
{
    stack<int> st;

    viz[start] = true;
    st.push(start);

    while (!st.empty())
    {
        int nod = st.top();

        if (poz[nod] < (int)graf[nod].size())
        {
            int vecin = graf[nod][poz[nod]];
            poz[nod]++;

            if (!viz[vecin])
            {
                viz[vecin] = true;
                st.push(vecin);
            }
        }
        else
        {
            ordine.push_back(nod);
            st.pop();
        }
    }
}

void dfs2(int start)
{
    stack<int> st;
    vector<int> comp;

    viz[start] = true;
    st.push(start);

    while (!st.empty())
    {
        int nod = st.top();
        st.pop();

        comp.push_back(nod);

        for (int i = 0; i < (int)grafT[nod].size(); i++)
        {
            int vecin = grafT[nod][i];

            if (!viz[vecin])
            {
                viz[vecin] = true;
                st.push(vecin);
            }
        }
    }

    componente.push_back(comp);
}

int main()
{
    fin >> n >> m;

    for (int i = 1; i <= m; i++)
    {
        int x, y;
        fin >> x >> y;

        graf[x].push_back(y);
        grafT[y].push_back(x);
    }

    for (int i = 1; i <= n; i++)
    {
        if (!viz[i])
            dfs1(i);
    }

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

    for (int i = (int)ordine.size() - 1; i >= 0; i--)
    {
        int nod = ordine[i];

        if (!viz[nod])
            dfs2(nod);
    }

    fout << componente.size() << '\n';

    for (int i = 0; i < (int)componente.size(); i++)
    {
        for (int j = 0; j < (int)componente[i].size(); j++)
        {
            fout << componente[i][j] << " ";
        }

        fout << '\n';
    }

    return 0;
}