Cod sursa(job #2373406)
Utilizator | Guta Razvan Alexandru RazvanGuta | Data | 7 martie 2019 13:22:31 |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.74 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int v[10001],i,n,m,cod,x,y,j;
vector <int> G[10001];
void dfs(int nod)
{
v[nod]=1;
for(int i=0;i<G[nod].size();i++)
{
if(v[G[nod][i]]==0)
{
v[G[nod][i]]=1;
dfs(G[nod][i]);
}
}
}
int main ()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>cod>>x>>y;
if(cod==1)
{
G[x].push_back(y);
G[y].push_back(x);
}
else
{
dfs(x);
if(v[y])
g<<"DA"<<'\n';
else
g<<"NU"<<'\n';
for(j=1;j<=n;j++)
v[j]=0;
}
}
return 0;
}