D. Restructuring Company

http://codeforces.com/problemset/problem/566/D 

题意： 三种操作，1,x,y:x与y连接；2,x,y:x~y连接；3,x,y:询问x与y是否连接；

思路：并查集；区间连接要优化，将区间[l,r]的每一个的下一个枚举修改为r，下次就可以直接跳到r；

#include<algorithm>

#include<set>

#include<vector>

#include<queue>

#include<cmath>

#include<cstring>

#include<iostream>

#include<algorithm>

#include<set>

#include<vector>

#include<queue>

#include<cmath>

#include<cstring>

#include<sstream>

#include<cstdio>

#include<ctime>

#include<map>

#include<stack>

#include<string>

using namespace std;



#define sfi(i) scanf("%d",&i)

#define pri(i) printf("%d\n",i)

#define sff(i) scanf("%lf",&i)

#define ll long long

#define mem(x,y) memset(x,y,sizeof(x))

#define INF 0x3f3f3f3f

#define eps 1e-6

#define PI acos(-1)

#define lowbit(x) ((x)&(-x))

#define zero(x) (((x)>0?(x):-(x))<eps)

#define fl() printf("flag\n")

ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}

const int maxn=2e5+9;

const int mod=10000;



template <class T>
inline void sc(T &ret)
{

    char c;
    ret = 0;
    while ((c = getchar()) < '0' || c > '9');
    while (c >= '0' && c <= '9')
    {
        ret = ret * 10 + (c - '0'), c = getchar();
    }
}

int p[maxn],nex[maxn];
int Find(int x)
{
    return p[x]==x?x:p[x]=Find(p[x]);
}
void join(int x,int y)
{
    int jx=Find(x);
    int jy=Find(y);
    if(jx!=jy) p[jy]=jx;
}
int main()
{
    //ios::sync_with_stdio(false);
    int n,q;
    scanf("%d%d",&n,&q);
    for(int i=1;i<=n;i++) p[i]=i,nex[i]=i+1;
    while(q--)
    {
        int op,x,y;
        scanf("%d%d%d",&op,&x,&y);
        if(op==1)
        {
            join(x,y);
        }
        if(op==2)
        {
            int jy=Find(y);//减少下面再次查找的时间
            for(int i=x;i<=y;)
            {
                join(i,jy);
                int tmp=i;
                i=nex[i];
                nex[tmp]=nex[y];//合并区间
            }
        }
        if(op==3)
        {
            int jx=Find(x);
            int jy=Find(y);
            if(jx==jy) puts("YES");
            else puts("NO");
        }
    }
    return 0;
}