Cod sursa(job #3036589)
Utilizator | Data | 24 martie 2023 17:00:51 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int v[100002],n,m,t,x,y,i,j,z;
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
{
v[i]=i;
}
for(i=1;i<=m;i++)
{
fin>>t>>x>>y;
if(t==1)
{
z=v[y];
for(j=1;j<=n;j++)
{
if(v[j]==z) v[j]=v[x];
}
}
if(t==2)
{
if(v[x]==v[y]) fout<<"DA\n";
else fout<<"NU\n";
}
}
fin.close();
fout.close();
return 0;
}