Mai intai trebuie sa te autentifici.
Cod sursa(job #3041512)
| Utilizator | Data | 31 martie 2023 16:39:36 | |
|---|---|---|---|
| Problema | Componente tare conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 1.35 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <stack>
///#include <tryhardmode>
///#include <GODMODE::ON>
using namespace std;
#define cin fin
#define cout fout
ifstream fin ("ctc.in");
ofstream fout ("ctc.out");
const int NMAX=1e5+5;
vector<int>v[NMAX];
vector<int>comp[NMAX];
vector<int>rev[NMAX];
int color[NMAX];
stack<int>stiva;
bool viz[NMAX];
int kon;
void dfs(int p)
{
viz[p]=true;
for(auto i:v[p])
{
if(!viz[i])
dfs(i);
}
stiva.push(p);
}
void dfsc(int p)
{
viz[p]=true;
color[p]=kon;
comp[kon].push_back(p);
for(auto i:rev[p])
{
if(!viz[i])
dfsc(i);
}
}
int main()
{
int n,m,i,j,x,y;
cin>>n>>m;
for(i=1;i<=m;i++)
{
int x,y;
cin>>x>>y;
v[x].push_back(y);
rev[y].push_back(x);
}
for(i=1;i<=n;i++)
if(!viz[i])
dfs(i);
for(i=1;i<=n;i++)
viz[i]=false;
while(!stiva.empty())
{
int p=stiva.top();
if(!viz[p])
{
kon++;
dfsc(p);
}
stiva.pop();
}
cout<<kon<<"\n";
for(i=1;i<=kon;i++)
{
for(auto j:comp[i])
cout<<j<<" ";
cout<<"\n";
}
return 0;
}
