Pagini recente » Cod sursa (job #2011771) | Cod sursa (job #1346508) | Cod sursa (job #2237141) | Istoria paginii runda/pregatire_oji_2022 | Cod sursa (job #3030191)
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("ctc.in");
ofstream cout("ctc.out");
vector<int> A[100001],B[100001],Nrc[100001];
int n,m,s,nr;
int viz1[100001],viz2[100001],ctc[100001];
void DFS(int v)
{
viz1[v]=1;
for (vector<int>::iterator it=A[v].begin();it!=A[v].end();it++)
{
int nod=*it;
if (!viz1[nod])
{
DFS(nod);
}
}
}
void DFS_t(int v)
{
viz2[v]=1;
for (vector<int>::iterator it=B[v].begin();it!=B[v].end();it++)
{
int nod=*it;
if (!viz2[nod])
{
DFS_t(nod);
}
}
}
int main()
{
cin >> n >> m;
for (int i=1; i<=m; i++)
{
int x,y;
cin >> x >> y;
A[x].push_back(y);
B[y].push_back(x);
}
for (int i=1;i<=n;i++)
{
if (ctc[i]==0)
{
nr++;
for (int j=1;j<=n;j++)
{
viz1[j]=viz2[j]=0;
}
DFS(i);
DFS_t(i);
for (int j=1;j<=n;j++)
{
if (viz1[j] && viz2[j])
{
Nrc[nr].push_back(j);
ctc[j]=1;
}
}
}
}
cout << nr << '\n';
for (int i=1;i<=nr;i++)
{
for (vector<int>::iterator it=Nrc[i].begin();it!=Nrc[i].end();it++)
{
cout << *it << " ";
}
cout << '\n';
}
}