Pagini recente » Cod sursa (job #257787) | Cod sursa (job #724985) | Cod sursa (job #1307663) | Cod sursa (job #720592) | Cod sursa (job #2444718)
#include<fstream>
#include<vector>
#include<stack>
#define N 100005
using namespace std;
ifstream f("ctc.in");
ofstream g("ctc.out");
vector<int>G[N],GT[N],CTC[N];
stack<int>S;
int n,m,nr,viz[N];
void dfs(int a)
{
viz[a]=1;
for(int i=0;i<G[a].size();i++)
{
int b=G[a][i];
if(!viz[b])
dfs(b);
}
S.push(a);
}
void dfs1(int a)
{
viz[a]=2;
CTC[nr].push_back(a);
for(int i=0;i<GT[a].size();i++)
{
int b=GT[a][i];
if(viz[b]==1)
dfs1(b);
}
}
int main()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
int x,y;
f>>x>>y;
G[x].push_back(y);
GT[y].push_back(x);
}
for(int i=1;i<=n;i++)
if(!viz[i])
dfs(i);
while(!S.empty())
{
int a=S.top();
if(viz[a]==1)
{
nr++;
dfs1(a);
}
S.pop();
}
g<<nr<<"\n";
for(int i=1;i<=nr;i++)
{
for(int j=0;j<CTC[i].size();j++)
g<<CTC[i][j]<<" ";
g<<"\n";
}
}