Pagini recente » Cod sursa (job #1760161) | Borderou de evaluare (job #2100067) | Cod sursa (job #3200686) | Cod sursa (job #3133358) | Cod sursa (job #2928891)
#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
using namespace std;
ifstream f("ctc.in");
ofstream g("ctc.out");
vector<vector<int>> sol, lista, listatrans;
vector<int> viz;
stack<int> st;
int n, m, nrctc;
void dfs(int k)
{
viz[k]=1;
for(auto i: lista[k])
if(viz[i]==0)
dfs(i);
st.push(k);
}
void dfstrans(int k)
{
viz[k]=2;
for(auto i: listatrans[k])
if(viz[i]==1)
dfstrans(i);
sol[nrctc].push_back(k);
}
int main()
{
f>>n>>m;
sol.resize(n+1);
viz.resize(n+1,0);
lista.resize(n+1);
listatrans.resize(n+1);
for(int i=1; i<=m ; i++)
{
int x, y;
f>>x>>y;
lista[x].push_back(y);
listatrans[y].push_back(x);
}
for(int i=1; i<=n; i++)
{
if(viz[i]==0)
dfs(i);
}
while(st.size()>0)
{
if(viz[st.top()]==1)
{
nrctc++;
dfstrans(st.top());
}
st.pop();
}
g<<nrctc<<'\n';
for(int i=1; i<=nrctc; i++)
{
for(auto j: sol[i])
g<<j<<" ";
g<<'\n';
}
return 0;
}