Cod sursa(job #3232934)
Utilizator | Data | 2 iunie 2024 06:55:21 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
ifstream F("dfs.in");
ofstream G("dfs.out");
int i,n,m,v[100001],j,z,r;
int main()
{
for(F>>n>>j,i=1;i<=n;v[i]=i,++i);
for(;F>>i>>j;) {
if(i!=v[i])
z=v[v[i]],v[i]=i=z;
if(j!=v[j])
z=v[v[j]],v[j]=j=z;
if(i!=j)
++r,v[i]=j;
}
return G<<n-r,0;
}