Pagini recente » Cod sursa (job #1813537) | Cod sursa (job #827322) | Cod sursa (job #2352572) | Istoria paginii runda/wellcodesimulareclasa9-9martie | Cod sursa (job #1068008)
#include <fstream>
#include <vector>
#include <bitset>
#include <string.h>
#define Nmax 100099
using namespace std;
ifstream f("ctc.in");
ofstream g("ctc.out");
int N,M,sol,Plus[Nmax],Minus[Nmax];
vector < int > Graph[Nmax],GT[Nmax],Comp[Nmax];
inline void ReadInput()
{
f>>N>>M;
for(int i=1;i<=M;++i)
{
int x,y;
f>>x>>y;
Graph[x].push_back(y);
GT[y].push_back(x);
}
}
void DFS_PLUS(int nod)
{
Plus[nod]=1;
vector < int > :: iterator it;
for(it=Graph[nod].begin();it!=Graph[nod].end();++it)
if(!Plus[*it])DFS_PLUS(*it);
}
void DFS_MINUS(int nod)
{
Minus[nod]=1;
vector < int > :: iterator it;
for(it=GT[nod].begin();it!=GT[nod].end();++it)
if(!Minus[*it])DFS_MINUS(*it);
if(Plus[nod])Comp[sol].push_back(nod);
}
int main()
{
ReadInput();
for(int i=1;i<=N;++i)
if(!Plus[i])
{
++sol;
DFS_PLUS(i);
for(int j=1;j<=N;++j)Minus[j]=0;
DFS_MINUS(i);
for(int j=1;j<=N;++j)if(!Minus[j])Plus[j]=0;
}
g<<sol<<'\n';
f.close();g.close();
return 0;
}