Cod sursa(job #3334180)
| Utilizator | Data | 16 ianuarie 2026 18:37:41 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
vector<int> vecini[100005];
int viz[100005];
int n,m;
void dfs(int x)
{
viz[x]=1;
for(auto y: vecini[x])
{
if(!viz[y])
{
dfs(y);
}
}
}
int main ()
{
ifstream f("dfs.in");
ofstream g("dfs.out");
int x,y;
f>>n>>m;
for(int i=1; i<=m; i++)
{
f>>x>>y;
vecini[x].push_back(y);
vecini[y].push_back(x);
}
int rez=0;
for(int i=1; i<=n; i++)
{
if(!viz[i])
{
rez++;
dfs(i);
}
}
g<<rez;
return 0;
}