Cod sursa(job #3373463)

Utilizator carinaa_leetAmarie Carina carinaa_leet Data 7 noiembrie 2026 09:57:33
Problema Componente tare conexe Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.61 kb
#include <fstream>
#include <vector>
#include <stack>
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");

int n, m;
vector<vector<int>> adj;
vector<vector<int>> ctc;
vector<vector<int>> adj2;
vector<bool> viz;
stack<int> st;
int nrc;

void DFSplus(int nod)
{
    viz[nod] = 1;
    for (int i : adj[nod])
    {
        if (!viz[i])
        {
            DFSplus(i);
        }
    }
    st.push(nod);
}

void DFSminus(int nod, int poz)
{
    viz[nod] = 0; // nod vizitat
    for (int i : adj2[nod])
    {
        if (viz[i])
        {
            ctc[poz].push_back(i);
            DFSminus(i, poz);
        }
    }
}

int main()
{
    fin >> n >> m;
    adj.resize(n + 5);
    adj2.resize(n + 5);
    viz.resize(n + 5, 0);
    ctc.resize(n + 5);

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

    for (int i = 1; i <= n; i++)
    {
        if (!viz[i])
        {
            DFSplus(i);
        }
    }
    // am vizitat toate nodurile; refolosim viz cu valori opuse
    int i = 0;
    while (!st.empty())
    {
        int elem = st.top();
        st.pop();
        if (viz[elem] == 1) // nod nevizitat
        {
            nrc++;
            ctc[i].push_back(elem);
            DFSminus(elem, i);
            i++;
        }
    }
    fout << nrc << "\n";
    ctc.resize(nrc);
    for (const auto &rand : ctc)
    {
        for (int val : rand)
        {
            fout << val << " ";
        }
        fout << "\n";
    }
    return 0;
}