Pagini recente » Cod sursa (job #1326781) | Cod sursa (job #1918093) | Cod sursa (job #2466212) | Cod sursa (job #3256025) | Cod sursa (job #2159488)
#include <bits/stdc++.h>
using namespace std;
#define _ ios_base::sync_with_stdio(false);cout.precision(30);cout.tie(0);cin.tie(0);
#define ll long long
#define ld long double
#define rep(i, a, b) for(__typeof(b)i=(a)-((a)>(b));i!=(b)-((a)>(b));i+=1-2*((a)>(b)))
#define whilet() ll t;cin>>t;while(t--)
#define all(c) (c).begin(), (c).end()
ifstream fi("ctc.in");
ofstream fo("ctc.out");
int n,m,x,y,idx[100001],idxc=1,in[100001],low[100001];
vector<int> g[100001];
vector<vector<int>> scc;
stack<int> s;
void tarjan(int v) {
idx[v] = low[v] = idxc++;
s.push(v);
in[v] = 1;
for (auto u:g[v]) {
if (idx[u] == 0){
tarjan(u);
low[v] = min(low[v], low[u]);
} else if (in[u]) {
low[v] = min(low[v], idx[u]);
}
}
vector<int> comp;
if (low[v] == idx[v]) {
int u;
do {
u = s.top();
in[u] = false;
s.pop();
comp.push_back(u);
} while(u != v);
scc.push_back(comp);
}
}
int main() {
fi >> n >> m;
rep(i,0,m) {
fi >> x >> y;
g[x].push_back(y);
}
rep(i,1,n+1) {
if (!idx[i]) tarjan(i);
}
fo << scc.size() << endl;
for (auto x:scc) {
for (auto y:x) fo << y << ' ';
fo << endl;
}
return 0;
}