Cod sursa(job #1680539)
| Utilizator | Data | 8 aprilie 2016 20:46:02 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
const int NMax = 100005;
int TT[NMax];
int N,M;
int Father(int x)
{
while(x!=TT[x])
x = TT[x];
return x;
}
void Unite(int x, int y)
{
TT[x] = y;
}
int main()
{
fin>>N>>M;
for(int i = 1; i<=N; i++)
TT[i] = i;
while(M--)
{
int op,x,y;
fin>>op>>x>>y;
if(op==1)
Unite(Father(x),Father(y));
if(op==2)
if(Father(x)==Father(y))
fout<<"DA\n";
else
fout<<"NU\n";
}
return 0;
}
