Pagini recente » Cod sursa (job #2647813) | Cod sursa (job #717459) | Cod sursa (job #1206986) | Cod sursa (job #1331652) | Cod sursa (job #1098059)
#include <fstream>
#include <iostream>
#include <vector>
#include <bitset>
#include <string.h>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <time.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <deque>
using namespace std;
const char infile[] = "ctc.in";
const char outfile[] = "ctc.out";
ifstream fin(infile);
ofstream fout(outfile);
const int MAXN = 100005;
const int oo = 0x3f3f3f3f;
typedef vector<int> Graph[MAXN];
typedef vector<int> :: iterator It;
const inline int min(const int &a, const int &b) { if( a > b ) return b; return a; }
const inline int max(const int &a, const int &b) { if( a < b ) return b; return a; }
const inline void Get_min(int &a, const int b) { if( a > b ) a = b; }
const inline void Get_max(int &a, const int b) { if( a < b ) a = b; }
Graph G, Gt;
int N, M;
bitset <MAXN> Used;
vector <int> tsort, act;
vector < vector <int> > ctc;
void DFs(const int &Node) {
Used[Node] = true;
for(It it = G[Node].begin(), fin = G[Node].end(); it != fin ; ++ it)
if(!Used[*it])
DFs(*it);
tsort.push_back(Node);
}
void DFs2(const int &Node) {
Used[Node] = true;
act.push_back(Node);
for(It it = Gt[Node].begin(), fin = Gt[Node].end(); it != fin ; ++ it)
if(!Used[*it])
DFs2(*it);
}
int main() {
fin >> N >> M;
for(int i = 1 ; i <= M ; ++ i) {
int x, y;
fin >> x >> y;
G[x].push_back(y);
Gt[y].push_back(x);
}
for(int i = 1 ; i <= N ; ++ i)
if(!Used[i])
DFs(i);
Used.reset();
for(vector <int> :: reverse_iterator it = tsort.rbegin(), fin = tsort.rend(); it != fin ; ++ it)
if(!Used[*it]) {
act.clear();
DFs2(*it);
ctc.push_back(act);
}
fout << ctc.size() << '\n';
for(int i = 0 ; i < ctc.size() ; ++ i) {
for(int j = 0 ; j < ctc[i].size() ; ++ j)
fout << ctc[i][j] << ' ';
fout << '\n';
}
fin.close();
fout.close();
return 0;
}