Cod sursa(job #2433834)

Utilizator smoc_georgemarianSmoc George-Marian smoc_georgemarian Data 29 iunie 2019 13:19:39
Problema Componente tare conexe Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.19 kb
#include <bits/stdc++.h>
#define NMAX 100009
#define MMAX 200009
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
int n,m,nrc;
bool uz[NMAX];
stack <int> h;
vector <int>g[NMAX];
vector <int>gt[NMAX];
vector <int> sol[NMAX];
int nrs;
void citire();
void dfs(int k);
void dfs1(int k);
int main()
{citire();
 for(int i=1;i<=n;i++)
    if(!uz[i])
       nrc++, dfs(i);
 memset(uz,0,sizeof(uz));
 while(!h.empty())
        {
        int el=h.top();h.pop();
        if(!uz[el])
            {
             nrs++;dfs1(el);
            }
        }
  fout<<nrs<<'\n';
  for(int i=1;i<=nrs;i++)
          {
          for(int j=0;j<sol[i].size();j++)
                fout<<sol[i][j]<<" ";
         fout<<'\n';

         }
   return 0;
}
void citire()
{int i,x,y;
  fin>>n>>m;
  for(i=1;i<=m;i++)
    {
     fin>>x>>y;
     g[x].push_back(y);
     gt[y].push_back(x);

    }
}
void dfs(int k)
{
 uz[k]=nrc;h.push(k);
 int i;
 for(i=0;i<g[k].size();i++)
    if(!uz[g[k][i]])
     dfs(g[k][i]);

}
void dfs1(int k)
{
 int i;
 uz[k]=nrs;
 sol[nrs].push_back(k);
 for(i=0;i<gt[k].size();i++)
      if(!uz[gt[k][i]])
       dfs1(gt[k][i]);
}