Cod sursa(job #1305873)

Utilizator bence21Bako Bence bence21 Data 30 decembrie 2014 11:49:22
Problema Paduri de multimi disjuncte Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include<fstream>
using namespace std;
int main()
{
    ifstream f("disjoint.in");
    ofstream g("disjoint.out");
    unsigned int x,y,n,m,t[50000],i,j,c;
    f>>n>>m;
    for(i=1;i<=n;i++)
        t[i]=i;
    for(i=1;i<=m;i++)
    {
        f>>c>>x>>y;
        if(c==1)
        {
            if(t[x]<t[y])
            {
                int e=t[y];
                t[y]=t[x];
                for(j=y+1;j<=n;j++)
                    if(e==t[j])
                        t[j]=t[x];
            }
            else
            {
                int e=t[x];
                t[x]=t[y];
                for(j=x+1;j<=n;j++)
                    if(e==t[j])
                        t[j]=t[y];
            }
        }
        else{
            if(t[x]==t[y])
                g<<"DA\n";
            else g<<"NU\n";
        }
    }
    f.close();
    g.close();
    return 0;
}