Cod sursa(job #2477789)

Utilizator 1chiriacOctavian Neculau 1chiriac Data 21 octombrie 2019 09:40:54
Problema Componente tare conexe Scor 30
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.07 kb
#include <cstdio>
#include <vector>
using namespace std;
vector <int> graf[100003];
vector <int> grafinv[100003];
vector <int> tarec[100003];
int n,m,cnt,atins[100003];
char vizitat[100003];
void dfs1 (int nod)
{
	vizitat[nod]='+';
	for(int i=0;i<(int)graf[nod].size();++i)
		if(vizitat[graf[nod][i]]!='+')
			dfs1(graf[nod][i]);
}
void dfs2 (int nod)
{
	if(vizitat[nod]=='+')
		tarec[cnt].push_back(nod),atins[nod]=1;
	for(int i=0;i<(int)grafinv[nod].size();++i)
		if(vizitat[grafinv[nod][i]]=='+' && atins[grafinv[nod][i]]==0)
			dfs2(grafinv[nod][i]);
}
void ctc ()
{
	for(int i=1;i<=n;++i)
		if(atins[i]==0)
		{
			dfs1(i);
			dfs2(i);
			cnt++;
			for(int ii=1;ii<=n;++ii)
				vizitat[ii]='1';
		}
}
int main ()
{
	int nr1,nr2;
	freopen("ctc.in","r",stdin);
	freopen("ctc.out","w",stdout);
	scanf("%d%d", &n, &m);
	for(int i=1;i<=m;++i)
	{
		scanf("%d%d", &nr1, &nr2);
		graf[nr1].push_back(nr2);grafinv[nr2].push_back(nr1);
	}
	ctc();
	printf("%d\n", cnt);
	for(int i=0;i<cnt;++i)
	{
		for(int ii=0;ii<(int)tarec[i].size();++ii)
			printf("%d ", tarec[i][ii]);
		printf("\n");
	}
	return 0;
}