Cod sursa(job #2080381)
Utilizator | Data | 2 decembrie 2017 21:16:48 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include<fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
long long ap[100001],n,m,x,y,k,v,ok,sum,q1,nr,i,j;
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>q1>>x>>y;
if(q1==1)
{
for(j=1;j<=n;j++)
if(ap[j]==y)
ap[j]=x;
ap[y]=ap[x]=x;
}
else
{
if(ap[x]==ap[y])
g<<"DA"<<'\n';
else
g<<"NU"<<'\n';
}
}
return 0;
}