Pagini recente » Cod sursa (job #2351069) | Cod sursa (job #2404731) | Cod sursa (job #1287320) | Istoria paginii runda/simulare_oji_11_12_4 | Cod sursa (job #2325890)
#include <fstream>
#define NMAX 100009
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
int s[NMAX],vf=0,g[NMAX][NMAX],gt[NMAX][NMAX];
int n,m,i,nr;
int uz[NMAX];
int comp[NMAX][NMAX];
void citire();
void dfs(int k);void dfs1(int k);
int main()
{citire();
for(i=1;i<=n;i++)
if(!uz[i])
{
dfs(i);
}
/*while(vf)
{
x=s[vf--];
if(!uz[x])
dfs(x);
}
*/
int x;
for(i=1;i<NMAX;i++)
uz[i]=0;
///reintializat
while(vf)
{
x=s[vf--];
if(!uz[x])
{nr++;dfs1(x);}
}
fout<<nr;
return 0;
}
void citire()
{int i,x,y;
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>x>>y;
g[x][++g[x][0]]=y;
gt[y][++gt[y][0]]=x;
}
}
void dfs(int k)
{int i;
uz[k]=1;
for(i=1;i<=g[k][0];i++)
if(!uz[g[k][i]])
{
dfs(g[k][i]);
}
s[++vf]=k;
}
void dfs1(int k)
{int i;
uz[k]=1;comp[nr][++comp[nr][0]]=k;
for(i=1;i<=gt[k][0];i++)
if(!uz[gt[k][i]])
{
dfs1(gt[k][i]);
}
}