Pagini recente » Cod sursa (job #407698) | Cod sursa (job #827101) | Cod sursa (job #2945122) | Cod sursa (job #154026) | Cod sursa (job #1588438)
#include <vector>
#include <fstream>
#include <iostream>
#define nmax 100005
using namespace std;
void read_data (int &n, int &m, vector <int> v[nmax]){
ifstream fin ("dfs.in");
fin >> n >> m;
for (int i = 1; i <= m; i++){
int x, y;
fin >> x >> y;
v[x].push_back (y);
v[y].push_back (x);
}
}
void dfs (int current, vector <int> v[nmax], bool seen[nmax]){
seen[current] = true;
for (auto vecin : v[current])
if (!seen[vecin])
dfs (vecin, v, seen);
}
void print_answer (vector <int> v[nmax], bool seen[nmax], int n){
ofstream fout ("dfs.out");
int components = 0;
for (int i = 1; i <= n; i++)
if (!seen[i])
dfs (i, v, seen), components ++;
fout << components;
}
int main(){
vector <int> v[nmax];
bool seen[nmax];
for (auto &x : seen) x = false;
int n, m;
read_data (n, m, v);
print_answer (v, seen, n);
return 0;
}