Pagini recente » Cod sursa (job #413453) | Cod sursa (job #489735) | Cod sursa (job #413763) | Cod sursa (job #489765) | Cod sursa (job #2641401)
#include <fstream>
#include <vector>
using namespace std;
int N, M, nrc;
vector<vector<int>> G, GT, CTC;
vector<bool>viz;
vector<int>Post;
ifstream f("ctc.in");
ofstream g("ctc.out");
void citire()
{
int x, y;
f >> N >> M;
G = vector<vector<int>>(N + 1);
GT = vector<vector<int>>(N + 1);
CTC = vector<vector<int>>(N + 1);
viz = vector<bool>(N + 1, 0);
Post = vector<int>(N + 1);
for(int i = 1; i <= M; i++)
{
f >> x >> y;
G[x].push_back(y);
GT[y].push_back(x);
}
}
void DFS(int vf)
{
viz[vf] = 1;
for(auto &x:G[vf])
if(viz[x] == 0)
DFS(x);
Post.push_back(vf);
}
void DFST(int vf)
{
viz[vf] = 0;
CTC[nrc].push_back(vf); ///nodul vf se adauga la CTC curenta
for(auto &x:GT[vf])
if(viz[x] == 1)
DFST(x);
}
void componente() ///Al Kosaraju Sharir
{
for(int i = 1; i <= N; i++)
if(!viz[i])
DFS(i);
//
///for(vector<int>::reverse_iterator it=Post.rbegin();it!=Post.rend();++it)
for(auto it = Post.rbegin(); it != Post.rend(); ++it)
if(viz[*it] == 1)
{
nrc++;
DFST(*it);
}
}
void afis()
{
g << nrc << '\n';
for(int i = 1; i <= nrc; i++)
{
for(auto &x : CTC[i])///for(int &x : CTC[i])
g << x << ' ';
g << '\n';
}
}
int main()
{
citire();
componente();
afis();
return 0;
}