Pagini recente » Cod sursa (job #322596) | Cod sursa (job #1246311) | Cod sursa (job #1527) | Cod sursa (job #1131485) | Cod sursa (job #1645292)
#include <fstream>
#include <vector>
using namespace std;
class InputReader
{
public:
InputReader() {}
InputReader(const char* file_name)
{
input_file = fopen(file_name,"r");
cursor = 0;
fread(buff,SIZE,1,input_file);
}
inline InputReader &operator >>(int& n)
{
n = 0;
while (buff[cursor] < '0' || buff[cursor] > '9')
advance();
while (buff[cursor] >= '0' && buff[cursor] <= '9') {
n = n * 10 + buff[cursor] - '0';
advance();
}
return *this;
}
private:
static const int SIZE = 1<<17;
int cursor;
FILE *input_file;
char buff[SIZE];
inline void advance() {
cursor++;
if (cursor == SIZE) {
cursor = 0;
fread(buff,SIZE,1,input_file);
}
}
};
int n,m;
vector<int> G[100001], TG[100001];
vector< vector<int> > Comp;
bool seen[100001];
int ST[100001];
void dfs1(int node)
{
seen[node] = 1;
for (int i = 0; i < G[node].size(); i++)
if (!seen[G[node][i]])
dfs1(G[node][i]);
ST[++ST[0]] = node;
}
void dfs2(int node)
{
seen[node] = 1;
Comp.back().push_back(node);
for (int i = 0; i < TG[node].size(); i++)
if (!seen[TG[node][i]])
dfs2(TG[node][i]);
}
void Kosaraju()
{
for (int i = 1; i <= n; i++)
if (!seen[i]) dfs1(i);
fill(seen+1,seen+n+1,0);
for (int j = n; j >= 1; j--) {
if (!seen[ST[j]]) {
Comp.push_back(vector<int>());
dfs2(ST[j]);
}
}
}
int main()
{
InputReader fin = InputReader("ctc.in");
ofstream fout("ctc.out");
int x,y;
fin >> n >> m;
for (int i = 1; i <= m; i++)
{
fin >> x >> y;
G[x].push_back(y);
TG[y].push_back(x);
}
Kosaraju();
fout << Comp.size() << "\n";
for (int i = 0; i < Comp.size(); i++) {
for (int j = 0; j < Comp[i].size(); j++)
fout << Comp[i][j] << " ";
fout << "\n";
}
}