Pagini recente » Cod sursa (job #1380858) | Cod sursa (job #1251740) | Cod sursa (job #1374680) | Clasament Junior Challenge 2015 | Cod sursa (job #641600)
Cod sursa(job #641600)
#include<stdio.h>
#include<vector>
# define max 100005
using namespace std;
vector<int> graf[max],graftrans[max],tts[max];
int stiva[max],vf=0,conex;
bool viz[max];
void df1(int nod)
{ int i;
viz[nod]=1;
stiva[vf]=nod;
for(i=1;i<graf[nod].size;++i)
{
if (!viz[graf[nod][i]])
df1(graf[nod][i]);
}
vf++;
}
void df2(int nod)
{ viz[nod]=0;
tts[conex].push_back(nod);
for(i=0;i<graftrans[nod].size;++i)
if (viz[graftrans[nod][i]])
df2(graftrans[nod][i]);
}
int main()
{int n,m,x,y;;
freopen("ctc.in","r",stdin);
freopen("ctc.out","w",stdout);
scanf("%d%d",&n,&m);
for ( int i=0;i<m;++i)
{
scanf("%d%d",&x,&y);
graf(x).push_back(y);
graftrans(y).push_back(x);
}
for(int i=1;i<=n;++i)
if(!viz[i])
df1(i);
conex=0;
for (j=n-1;j>=0;j--)
{if (viz[stiva[j]])
df2(stiva[j]);
conex++;
}
for (int i=0;i<conex;++i)
{ for(j=0;j<ttc[conex].size;++j)
printf("%d",ttc[i][j]);
printf("\n");
}
return 0;
}