Pagini recente » Cod sursa (job #3191298) | Cod sursa (job #3125740) | Cod sursa (job #1130985) | Cod sursa (job #2078987) | Cod sursa (job #1935043)
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <fstream>
#include <queue>
#include <bitset>
#define pb push_back
#define mp make_pair
#define dim 100009
using namespace std;
ofstream out("dfs.out");
int n,m;
bitset<dim> uz;
int sol;
vector < int > G[dim];
typedef vector < int >::iterator IT;
void read();
void dfs(int source);
int main()
{
read();
for(int i = 1 ; i<=n; ++i)
if(!uz[i])
{
++sol;
dfs(i);
}
out << sol << '\n';
return 0;
}
void read()
{
ifstream in("dfs.in");
in >> n >> m;
for(int x,y; m; --m)
{
in >> x >> y;
G[x].pb(y);
G[y].pb(x);
}
}
void dfs(int source)
{
uz[source] = 1;
for(IT i = G[source].begin(); i!=G[source].end(); ++i)
if(!uz[*i])
{
dfs(*i);
}
}