Pagini recente » Cod sursa (job #2881926) | Cod sursa (job #2789464)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("ctc.in");
ofstream out("ctc.out");
const int N=100005;
vector<int>suc[N];
vector<int>pred[N];
vector<int>strt;
bool viz1[N], viz2[N];
int k;
vector<int> ctc[N];
void dfs_sortaret(int x)
{
viz1[x]=1;
for(auto y: suc[x])
{
if(!viz1[y])
dfs_sortaret(y);
}
strt.push_back(x);
}
void dfs_ctc(int x)
{
ctc[k].push_back(x);
viz2[x]=1;
for(auto y: pred[x])
{
if(!viz2[y])
{
dfs_ctc(y);
}
}
}
int main()
{
int n, m;
int x, y;
in>>n>>m;
for(int i=1; i<=m; i++)
{
in>>x>>y;
suc[x].push_back(y);
pred[y].push_back(x);
}
for(int i=1; i<=n; i++)
{
if(!viz1[i])
{
dfs_sortaret(i);
}
}
for(auto i: strt)
{
if(!viz2[i])
{
k++;
dfs_ctc(i);
}
}
out<<k<<'\n';
for(int i=1; i<=k; i++)
{
for(auto j:ctc[i])
out<<j<<' ';
out<<'\n';
}
return 0;
}