Pagini recente » Cod sursa (job #1081896) | Cod sursa (job #1441739) | Cod sursa (job #1157298) | Cod sursa (job #999342) | Cod sursa (job #2123671)
#include <fstream>
#include <vector>
using namespace std;
vector <int> graf[100001];
vector <int> graf_t[100001];
vector <int> sol[200002];
int viz[100002],post[100002];
int nn=0,cnt=0;
void dfs(int nod)
{
viz[nod]=1;
for(int j=0;j<graf_t[nod].size();j++)
{
if(!viz[graf_t[nod][j]])
{
dfs(graf_t[nod][j]);
}
}
post[++nn]=nod;
}
void dfsr(int nod)
{
sol[cnt].push_back(nod);
viz[nod]=0;
for(int j=0;j<graf[nod].size();j++)
{
if(viz[graf[nod][j]])
{
dfsr(graf[nod][j]);
}
}
}
int main()
{
int n,m,a,b;
ifstream in("ctc.in");
ofstream out("ctc.out");
in>>n>>m;
for(int i=1;i<=m;i++)
{
in>>a>>b;
graf[a].push_back(b);
graf_t[b].push_back(a);
}
for(int i=1;i<=n;i++)
{
if(!viz[i])
{
dfs(i);
}
}
for(int i=n;i>=1;i--)
{
if(viz[post[i]])
{
cnt++;
dfsr(post[i]);
}
}
out<<cnt<<"\n";
for(int i=1;i<=nn;i++)
{
for(int j=0;j<sol[i].size();j++)
out<<sol[i][j]<<" ";
out<<"\n";
}
return 0;
}