Cod sursa(job #2668333)

Utilizator bogdan.gusuleacGusuleac Bogdan bogdan.gusuleac Data 4 noiembrie 2020 19:45:40
Problema Componente tare conexe Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.44 kb
#include <iostream>
#include <fstream>
#include<stack>
#include<vector>

using namespace std;

ifstream f("ctc.in");
ofstream g("ctc.out");

#define VALMAX 100009

vector<int> conexe[VALMAX];
vector<int> m[VALMAX]; ///adiacenta
vector<int> t[VALMAX]; ///transpusa

int nr; ///numar componnente conexe
int viz[VALMAX];
stack<int>s;

void dfs(int n)///cod matrice
{
    viz[n] = 1;
    for(int i=0; i<m[n].size(); i++)
    {
        if(viz[m[n][i]]==0)
            dfs(m[n][i]);
    }
    s.push(n);
}


void dfs_transpus(int n)///cod transpusa
{
    conexe[nr].push_back(n);

    viz[n] = 2;
    for(int i=0; i<t[n].size(); i++)
    {
        if(viz[t[n][i]] == 1)
            dfs_transpus(t[n][i]);
    }
}

int main()
{
    int edges,nodes,x,y;
    f>>nodes>>edges;
    for(int i = 1; i <= edges; i++)
    {
        f>>x>>y;
        ///transpusa
        t[y].push_back(x);
        ///matricea normala
        m[x].push_back(y);
    }



    for(int i = 1; i <= nodes; i++)
    {
        if(viz[i]==0)
            dfs(i);
    }



    while(s.empty()==0)
    {
        int n=s.top();

        if(viz[n]==1)
        {
            nr++;
            dfs_transpus(n);
        }
        s.pop();
    }

    g<<nr<<"\n";


    for(int i = 1; i <= nr; i++)
    {
        for(int j=0; j<conexe[i].size(); j++)
        {
            g<<conexe[i][j]<<" ";
        }

        g<<"\n";
    }
}