Pagini recente » Cod sursa (job #1755204) | Cod sursa (job #1337195) | Cod sursa (job #2895548) | Cod sursa (job #1138279) | Cod sursa (job #2186559)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("ctc.in");
ofstream g("ctc.out");
vector <int> a[100100];
vector <int> b[100100];
int viz1[100100],viz[100100];
void DF(int nod)
{
int i;
viz[nod]=1;
for(i=0;i<a[nod].size();i++)
if(viz[a[nod][i]]==0)DF(a[nod][i]);
}
void DF1(int nod)
{
int i;
viz1[nod]=1;
for(i=0;i<b[nod].size();i++)
if(viz1[b[nod][i]]==0)DF1(b[nod][i]);
}
int n,m,nr,i,j,x,y,use[100100];
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
a[x].push_back(y);
b[y].push_back(x);
}
for(i=1;i<=n;i++)
{
if(use[i]==0)
{
nr++;
for(j=1;j<=n;j++){viz[j]=0;viz1[j]=0;}
DF(i);DF1(i);
for(j=1;j<=n;j++)
if(viz[j]==viz1[j]){use[j]=1;}
}
}
g<<nr<<'\n';
for(i=1;i<=n;i++)use[i]=0;
for(i=1;i<=n;i++)
{
if(use[i]==0)
{
for(j=1;j<=n;j++){viz[j]=0;viz1[j]=0;}
DF(i);DF1(i);
for(j=1;j<=n;j++)
if(viz[j]==viz1[j]){g<<j<<" ";use[j]=1;}
g<<'\n';
}
}
return 0;
}