Pagini recente » Cod sursa (job #91259) | Cod sursa (job #2392864) | Cod sursa (job #3205715) | Cod sursa (job #553902) | Cod sursa (job #2963520)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
typedef pair<int,int> pii;
vector<vector<int>> sol;
vector<int> v;
int n,m;
vector<int> muchii[100005],st;
pii G[200005];
bool use[100005];
void dfs1(int nod)
{
use[nod]=1;
for(int i:muchii[nod])
if(!use[i])
dfs1(i);
st.push_back(nod);
}
void dfs2(int nod)
{
use[nod]=1;
v.push_back(nod);
for(int i:muchii[nod])
if(!use[i])
dfs2(i);
}
int main()
{
ios_base::sync_with_stdio(false);
fin.tie(0);
fin>>n>>m;
for(int i=1;i<=m;i++)
{
int a,b;
fin>>a>>b;
G[i]={a,b};
muchii[a].push_back(b);
}
for(int i=1;i<=n;i++)
if(!use[i])
dfs1(i);
reverse(st.begin(),st.end());
for(int i=1;i<=n;i++)
{
muchii[i].clear();
use[i]=0;
}
for(int i=1;i<=m;i++)
{
int a,b;
a=G[i].second;
b=G[i].first;
muchii[a].push_back(b);
}
for(int i:st)
if(!use[i])
{
v.clear();
dfs2(i);
sort(v.begin(),v.end());
sol.push_back(v);
}
fout<<sol.size()<<'\n';
for(auto i:sol)
{
for(int j:i)
fout<<j<<' ';
fout<<'\n';
}
return 0;
}