Cod sursa(job #2354533)

Utilizator Cozma_AnaCozma Ana Cozma_Ana Data 25 februarie 2019 12:52:26
Problema Componente tare conexe Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.25 kb
#include <fstream>
#include <vector>
#define NMAX 100002

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

int n, m;
vector<int> G[NMAX];
vector<int> GT[NMAX];
bool uz[NMAX];
int ctc[NMAX]; // componenta tare conexa din care face parte
int nr, nrc;
int postord[NMAX];
void citire();
void dfs(int x);
void afisare();
void dfst(int x);
int main()
{ int i;
    citire();
    // etapa 1
    for (i=1; i<=n; i++)
        if (!uz[i]) dfs(i);
    // etapa 2
    for (i=n; i>0; i--)
    {
        if (!ctc[postord[i]])
            {nrc++; dfst(postord[i]); }

    }
    afisare();
    return 0;
}
void citire()
{int i, x, y;
 fin>>n>>m;
 for (i=0; i<m; i++)
     {
      fin>>x>>y;
      G[x].push_back(y);
      GT[y].push_back(x);
     }
}
void dfs(int x)
{ int i;
    uz[x]=1;
    for (i=0; i<G[x].size(); i++)
        if (uz[G[x][i]]==0)
            dfs(G[x][i]);
nr++;
postord[nr]=x;
}

void dfst(int x)
{ int i;
    uz[x]=nrc;
    for (i=0; i<GT[x].size(); i++)
        if (ctc[GT[x][i]]==0)
            dfst(GT[x][i]);
}
void afisare()
{ int i, j;
    fout<<nrc<<'\n';
for (i=1; i<=nrc; i++)
   {for (j=1; j<=n; j++)
        if (ctc[j]==i) fout<<j<<' ';
        fout<<'\n';
   }
}