Pagini recente » Istoria paginii runda/porc_again/clasament | Istoria paginii runda/simulare_oji_11_12_1 | Cod sursa (job #1703431) | Cod sursa (job #899979) | Cod sursa (job #2474096)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("ctc.in");
ofstream g("ctc.out");
vector <int> a[100001], ta[100001], ctc[100001];
int n,m,s1[100001],s2[100001],nrc;
void citire()
{
int i,j,k;
f>>n>>m;
for(k=0;k<m;k++)
{
f>>i>>j;
a[i].push_back(j);
ta[j].push_back(i);
}
}
void dfs1(int x)
{
int i;
s1[x]=nrc;
for(i=0;i<a[x].size();i++)
{
if(s1[a[x][i]]==0)
dfs1(a[x][i]);
}
}
void dfs2(int x)
{
int i;
s2[x]=nrc;
for(i=0;i<ta[x].size();i++)
{
if(s2[ta[x][i]]==0)
dfs2(ta[x][i]);
}
}
int main()
{
int i,j;
citire();
for(i=1;i<=n;i++)
{
if(s1[i]==0)
{
nrc++;
dfs1(i);
dfs2(i);
for(j=1;j<=n;j++)
if(s1[j]==nrc && s2[j]==nrc)
ctc[nrc].push_back(j);
else
{
s1[j]=0;
s2[j]=0;
}
}
}
g<<nrc<<endl;
for(i=1;i<=nrc;i++)
{
for(j=0;j<ctc[i].size();j++)
{
g<<ctc[i][j]<<" ";
}
g<<endl;
}
return 0;
}