Pagini recente » Cod sursa (job #2679538) | Cod sursa (job #2405875) | Cod sursa (job #1875687) | Cod sursa (job #1636813) | Cod sursa (job #1512650)
#include <fstream>
#include <vector>
#include <bitset>
#define N 100001
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
bitset<N>viz;
vector<int>H[N],Q[N],U;
vector<int> P[N];
int post[N],nr=1;
void dfs(int x)
{
viz[x]=1;
for(vector<int>::iterator it=H[x].begin();it!=H[x].end();it++)
{
if(viz[*it]==0) dfs(*it);
}
post[nr]=x;nr++;
}
void dfst(int x,int nr)
{
viz[x]=1;
for(vector<int>::iterator it=Q[x].begin();it!=Q[x].end();it++)
{
if(viz[*it]==0) dfst(*it,nr);
}
P[nr].push_back(x);
}
int main()
{
int n,m,x,y,i;
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>x>>y;
H[x].push_back(y);
Q[y].push_back(x);
}
for(i=1;i<=n;i++)
{
if(viz[i]==0) dfs(i);
}
viz.reset();
nr=0;
for(i=n;i>=1;i--)
{
if(viz[post[i]]==0)
{
nr++;
dfst(post[i],nr);
}
}
fout<<nr<<"\n";
for(i=1;i<=nr;i++)
{
for(vector<int>::iterator it=P[i].begin();it!=P[i].end();it++) fout<<*it<<" ";
fout<<"\n";
}
}