Cod sursa(job #3137827)
Utilizator | Data | 15 iunie 2023 09:20:36 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream F("dfs.in");
ofstream G("dfs.out");
vector<int> v[100001];
bitset<100001> c;
int n,i,j,k;
void A(int i)
{
c[i]=1;
for(int j:v[i])
if(!c[j])
A(j);
}
int main()
{
for(F>>n>>i;F>>i>>j;v[i].push_back(j),v[j].push_back(i));
for(i=1;i<=n;!c[i]?A(i),++k:0,++i);
return G<<k,0;
}