Pagini recente » Cod sursa (job #1733086) | Cod sursa (job #2393828) | Cod sursa (job #1725595) | Cod sursa (job #534186) | Cod sursa (job #2361607)
#include <iostream>
#include <fstream>
#include <vector>
#define nmax 100003
using namespace std;
ifstream f("ctc.in");
ofstream g("ctc.out");
int n,m, s[nmax], nr, t=2;
vector <int> v[nmax], vt[nmax], sol[nmax];
void citire()
{
int i,x,y;
f>>n>>m;
for(i=1; i<=m; i++)
{
f>>x>>y;
v[x].push_back(y);
vt[y].push_back(x);
}
}
void adanc(int nod)
{
int i, next;
s[nod]=1;
for(i=0; i<v[nod].size(); i++)
{
next=v[nod][i];
if(!s[next])
{
adanc(next);
}
}
}
void adanct(int nod)
{
int i, next;
if(s[nod]==0)
s[nod]=1;
else
if(s[nod]==1)
s[nod]=t;
for(i=0; i<vt[nod].size(); i++)
{
next=vt[nod][i];
if(s[next]==1)
{
adanct(next);
}
}
}
int main()
{
citire();
int i,j, ok;
for(i=1; i<=n; i++)
{
if(!s[i])
{
ok=0;
nr++;
adanc(i);
adanct(i);
for(j=1; j<=n; j++)
{
if(s[j]==t)
{sol[nr].push_back(j); ok=1;}
else
if(s[j]==1)
s[j]=0;
}
if(ok)
t++;
}
}
g<<nr<<"\n";
for(i=1; i<=nr; i++)
{
for(j=0; j<sol[i].size(); j++)
g<<sol[i][j]<<' ';
g<<"\n";
}
f.close();
g.close();
return 0;
}