Cod sursa(job #2475957)
Utilizator | Data | 17 octombrie 2019 19:58:38 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 15 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
#define MaxN 100001
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
#define cin fin
#define cout fout
int n, m, k, x, y;
bitset <MaxN> viz;
int main()
{
cin >> n >> m;
k = n;
for(int i=1; i<=m; i++)
{
cin >> x >> y;
if(viz[x] == 0 || viz[y] == 0)
{
k--;
}
viz[x] = viz[y] = 1;
}
cout << k;
}