Cod sursa(job #3315390)
| Utilizator | Data | 14 octombrie 2025 08:25:06 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
#include<vector>
#include<bitset>
using namespace std;
ifstream cin("dfs.in");
ofstream cout("dfs.out");
vector<int> a[100001];
bitset<100001> b;
void A(int i)
{
b[i]=1;
for(int j:a[i])
if(!b[j])
A(j);
}
int main()
{
int c=0,m,n;
for(cin>>n>>m;m--;) {
int i,j;
cin>>i>>j,a[i].push_back(j),a[j].push_back(i);
}
for(int i=1;i<=n;++i)
if(!b[i])
A(i),++c;
return cout<<c,0;
}
