Pagini recente » Cod sursa (job #3165259) | Cod sursa (job #2102377) | Cod sursa (job #2967899) | Cod sursa (job #1389391) | Cod sursa (job #2272014)
#include <fstream>
#include <vector>
using namespace std;
ifstream in("ctc.in");
ofstream out("ctc.out");
vector <int> v[100001],v1[100001],afis[100001];
int viz[100001];
bool vazut[100001];
int lista[100001],cnt,nr[100001],cnt1;
void dfs(int nod,int cnt)
{
viz[nod]=cnt;
for(int i=0; i<v1[nod].size(); i++)
if(!viz[v1[nod][i]])
dfs(v1[nod][i],cnt);
}
void umple(int nod)
{
vazut[nod]=1;
for(int i=0; i<v[nod].size(); i++)
if(!vazut[v[nod][i]])
umple(v[nod][i]);
lista[++cnt1]=nod;
}
int main()
{
int n,m,i,x,y,j;
in>>n>>m;
for(i=1; i<=m; i++)
{
in>>x>>y;
nr[y]++;
v[x].push_back(y);
}
for(i=1; i<=n; i++)
if(!vazut[i])
umple(i);
for(i=1; i<=n; i++)
for(j=0; j<v[i].size(); j++)
v1[v[i][j]].push_back(i);
for(i=n; i>=1; i--)
if(!viz[lista[i]])
dfs(lista[i],++cnt);
out<<cnt<<'\n';
for(i=1; i<=n; i++)
afis[viz[i]].push_back(i);
for(i=1; i<=n; i++)
{
for(j=0; j<afis[i].size(); j++)
out<<afis[i][j]<<" ";
out<<'\n';
}
return 0;
}