Pagini recente » Cod sursa (job #1453689) | Cod sursa (job #1269214) | Cod sursa (job #463120) | Cod sursa (job #2928934) | Cod sursa (job #2664690)
#include <bits/stdc++.h>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector <int> V[100005];
int n,m;
bitset <100005> viz;
void DFS(int x)
{
viz[x]=true;
for(int i=0; i<V[x].size(); i++)
if(!viz[V[x][i]])
DFS(V[x][i]);
}
int main()
{
f>>n>>m;
if(m>200000)
m=200000;
while(m--)
{
int x,y;
f>>x>>y;
V[x].push_back(y);
V[y].push_back(x);
}
int cnt=0;
for(int i=1; i<=n; i++)
if(!viz[i])
DFS(i),cnt++;
g<<cnt;
return 0;
}