Pagini recente » Cod sursa (job #524128) | Atasamentele paginii Clasament absenta | Istoria paginii runda/rar41 | Cod sursa (job #2037782) | Cod sursa (job #2037721)
#include <bits/stdc++.h>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
const int N = 100010;
int n,m,x,y;
vector<int> v[N];
bitset<N> viz;
void dfs(int);
int main()
{
f>>n>>m;
for(;m; m--)
{
f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i=1; i<=n; i++)
if(!viz[i])
{
m++;
dfs(i);
}
g<<m;
return 0;
}
void dfs(int nod)
{
viz[nod]=1;
for(auto vec:v[nod])
if(!viz[vec])
dfs(vec);
}