Pagini recente » Cod sursa (job #3199074) | Cod sursa (job #1696954) | Cod sursa (job #473722) | Cod sursa (job #2610222) | Cod sursa (job #1179526)
#include<fstream>
#include<vector>
#include<bitset>
#include<stack>
#define Next (++pos==100)?(fin.read(Buffer,100),pos = 0):0
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
int n,m,pos,str;
vector<int>vin[100005];
vector<int>pleaca[100005];
vector<int>componente[100005];
stack<int>S;
bitset<100005>viz;
char Buffer[100];
inline void Read(int &x)
{
while(Buffer[pos]<'0' || '9'<Buffer[pos])
Next;
x = 0;
while('0'<=Buffer[pos] && Buffer[pos]<='9')
{
x = x*10 +Buffer[pos]-'0';
Next;
}
}
inline void Citire()
{
int i,x,y;
fin.read(Buffer,100);
Read(n);Read(m);
for (i=1;i<=m;i++)
{
Read(x);Read(y);
pleaca[x].push_back(y);
vin[y].push_back(x);
}
}
inline void DFS(int x)
{
int i,len;
viz[x]=1;
len=pleaca[x].size();
for (i=0;i<len;i++)
if (!viz[pleaca[x][i]])
DFS(pleaca[x][i]);
S.push(x);
}
inline void DFS_t(int x)
{
int i,len;
viz[x]=1;
len=vin[x].size();
componente[str].push_back(x);
for (i=0;i<len;i++)
if (!viz[vin[x][i]])
DFS_t(vin[x][i]);
}
inline void Parcurgere()
{
int i;
for (i=1;i<=n;i++)
if (!viz[i])
DFS(i);
}
inline void Parcurgere_t()
{
int i;
for (i=1;i<=n;i++) viz[i]=0;
while (!S.empty())
{
if (viz[S.top()]==0)
{
str++;
DFS_t(S.top());
}
S.pop();
}
}
inline void Afisare()
{
int i,j,len;
fout<<str<<"\n";
for (i=1;i<=str;i++)
{
len=componente[i].size();
for (j=0;j<len;j++)
fout<<componente[i][j]<<" ";
fout<<"\n";
}
}
int main()
{
Citire();
Parcurgere();
Parcurgere_t();
Afisare();
return 0;
}