Cod sursa(job #2668552)

Utilizator iulia_caciucunescuIulia Caciucunescu iulia_caciucunescu Data 5 noiembrie 2020 00:24:48
Problema Componente tare conexe Scor 30
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.98 kb
#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
#include <map>
using namespace std;

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

stack<int> parcurg;
int nrCtc;
map<int, vector<int> > rez;

void dfs_parcurg(int rad, vector<vector<int> > adiacenta, vector<int> &viz)
{
	viz[rad] = 1;
	// Zona 1
	for(int nod : adiacenta[rad])
	{
	    // Zona 2
		if(viz[nod] == 0)
        {
            dfs_parcurg(nod, adiacenta, viz);
        }
        // Zona 3
	}
	// Zona 4
	parcurg.push(rad);
}

void dfs_t(int rad, vector<vector<int> > adiacenta_t, vector<int> &viz)
{
    viz[rad] = 2;
    rez[nrCtc].push_back(rad);

    for(int nod : adiacenta_t[rad])
    {
        if(viz[nod] == 1)
            dfs_t(nod, adiacenta_t, viz);
    }
}

void dfs(int n, vector<vector<int> > adiacenta, vector<vector<int> > adiacenta_t)
{
	vector<int> viz(n+1, 0);
	for(int i=1; i<=n; i++)
		if(viz[i] == 0)
        {
            dfs_parcurg(i, adiacenta, viz);
        }
    while(!parcurg.empty())
    {
        int nod = parcurg.top();
        //cout<<nod<<" ";
        if(viz[nod] == 1)
        {
            nrCtc++;
            dfs_t(nod, adiacenta_t, viz);
        }
        parcurg.pop();
    }
}

void print()
{
    out<<nrCtc;
    for(int i=0; i<rez.size(); i++)
    {
        for(int j=0; j<rez[i].size(); j++)
            out<<rez[i][j]<<" ";
        out<<endl;
    }
}

int main()
{
    int n,m;
    in>>n>>m;

    vector<vector<int> > d(n+1, vector<int> (n+1, 0));
    vector<vector<int> > matrice(n+1, vector<int> (n+1, 0));
    vector<vector<int> > adiacenta (n+1);
    vector<vector<int> > adiacenta_t (n+1);
    vector<int> vcon (n+1, 0);
    vector<int> viz (n+1, 0);

    for(int i=1; i<=m; i++)
    {
        int x,y;
        in>>x>>y;
        matrice[x][y] = 1;
        adiacenta[x].push_back(y);
        adiacenta_t[y].push_back(x);
    }

    dfs(n, adiacenta, adiacenta_t);
    print();
    return 0;
}