Pagini recente » Cod sursa (job #1929063) | Statistici pusherino TALENT (belicosus) | Istoria paginii runda/buzdugan_caut_maner/clasament | Cod sursa (job #436301) | Cod sursa (job #1830361)
#include <fstream>
#include <vector>
#include <stack>
using namespace std;
ifstream f("ctc.in");
ofstream g("ctc.out");
vector<int> ls[100005], lsi[100005], sol[100005];
int viz[100005], n, i, j, x, y, m, ns, nc, care[100005];
void df(int x) {
int i;
viz[x] = 1;
for (i = 0; i < ls[x].size(); i++) {
if (viz[ls[x][i]] == 0)
df(ls[x][i]);
}
care[++nc] = x;
}
void df1(int x) {
int i;
viz[x] = n;
for (i = 0; i < lsi[x].size(); i++) {
if (viz[lsi[x][i]] == 1)
df1(lsi[x][i]);
}
sol[ns].push_back(x);
}
int main() {
f >> n >> m;
while (m--) {
f >> x >> y;
ls[x].push_back(y);
lsi[y].push_back(x);
}
for (i = 1; i <= n; i++)
if (viz[i] == 0)
df(i);
for (i = n; i >= 1; i--)
if (viz[care[i]] != n) {
ns++;
df1(care[i]);
}
g << ns << '\n';
for (i = 1; i <= ns;i++) {
for (j = 0; j < sol[i].size(); j++)
g << sol[i][j] << ' ';
g << '\n';
}
return 0;
}