Pagini recente » Monitorul de evaluare | Cod sursa (job #1872207) | Cod sursa (job #667353) | Cod sursa (job #243077) | Cod sursa (job #1233167)
/// Craciun Catalin
/// DFS
#include <iostream>
#include <cstring>
#include <fstream>
#include <vector>
#define NMax 1000001
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
long n, m;
vector<long> A[NMax];
bool V[NMax];
int comp = 0;
void dfs(long x)
{
V[x]=true;
for (int i=0;i<A[x].size();i++)
if (!V[A[x][i]])
dfs(A[x][i]);
}
int main() {
f>>n>>m;
for (long i=1;i<=m;i++) {
int x, y;
f>>x>>y;
A[x].push_back(y);
A[y].push_back(x);
}
for (int i=1;i<=n;i++)
{
if (!V[i])
{
comp++;
dfs(i);
}
}
g<<comp<<'\n';
f.close(); g.close();
return 0;
}