Pagini recente » Cod sursa (job #2505961) | Cod sursa (job #3195396) | Cod sursa (job #401053) | Cod sursa (job #1904120) | Cod sursa (job #2796152)
#include <fstream>
#include <vector>
#include <unordered_map>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
unordered_map<int,bool> viz;
vector<vector<int>> mat(100005);
void dfs( int n)
{
viz[n]=true;
for(int a : mat[n])
if(!viz[a])
dfs(a);
}
int n,m;
int main() {
f >> n >> m ;
(n + 1);
for (int i = 0; i < m; ++i) {
int a, b;
f >> a >> b;
mat[a].push_back(b);
mat[b].push_back(a);
}
int nr= 0 ;
for(int i=1 ; i <= n ; ++i)
if(!viz[i])
{
dfs(i);
nr++;
}
g<<nr;
return 0;
}