Pagini recente » Cod sursa (job #995439) | Cod sursa (job #406620) | Cod sursa (job #463119) | Borderou de evaluare (job #2555276) | Cod sursa (job #803427)
Cod sursa(job #803427)
#include <fstream>
#include <vector>
using namespace std;
ifstream in("ctc.in");
ofstream out("ctc.out");
const int N=100005;
vector <int> graf[N], trans[N];
int nr,n,m,t[N],viz[N];
bool use[N];
void dfsgraf(int x)
{
use[x]=true;
for(vector<int> :: iterator it=graf[x].begin();it!=graf[x].end();it++)
if(!use[*it])
dfsgraf(*it);
t[++nr]=x;
}
void dfstrans(int x,int num)
{
viz[x]=num;
for(vector<int> :: iterator it=trans[x].begin();it!=trans[x].end();it++)
if(!viz[*it])
dfstrans(*it,num);
}
int main()
{
int x,y;
int num=0;
in>>n>>m;
while(m--)
{
in>>x>>y;
graf[x].push_back(y);
trans[y].push_back(x);
}
for(int i=1;i<=n;i++)
if(!use[i])
dfsgraf(i);
for(int i=nr;i>=0;i--)
if(!viz[t[i]])
dfstrans(t[i],++num);
out<<--num<<"\n";
for(int k=1;k<=num;k++)
{
for(int i=1;i<=n;i++)
if(viz[i]==k)
out<<i<<" ";
out<<"\n";
}
return 0;
}