Cod sursa(job #3183672)
Utilizator | Data | 12 decembrie 2023 17:57:27 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.68 kb |
#include <iostream>
#include <vector>
#include<fstream>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int use[100001];
int nr=0;
vector<int> v[100001];
void dfs(int nod)
{
use[nod]=1;
for(int i=0; i<v[nod].size(); i++)
if(!use[v[nod][i]])
{
dfs(v[nod][i]);
nr++;
}
}
int main()
{
int N, M, X, Y;
fin>>N>>M;
for(int i=1; i<=M; i++)
{
fin>>X>>Y;
v[Y]. push_back(X);
v[X]. push_back(Y);
}
for(int i=1; i<=N; i++)
dfs(i);
fout<<N-nr;
fin.close();
fout.close();
return 0;
}