VK Cup 2015

对于区间操作
用一个并查集来维护每个点往右连续为同一祖先的最右点

#include <iostream>#include <algorithm>#include <sstream>#include <string>#include <queue>#include <cstdio>#include <map>#include <set>#include <utility>#include <stack>#include <cstring>#include <cmath>#include <vector>#include <ctime>#include <bitset>using namespace std;#define pb push_back#define sd(n) scanf("%d",&n)#define sdd(n,m) scanf("%d%d",&n,&m)#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)#define sld(n) scanf("%lld",&n)#define sldd(n,m) scanf("%lld%lld",&n,&m)#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)#define sf(n) scanf("%lf",&n)#define sff(n,m) scanf("%lf%lf",&n,&m)#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)#define ss(str) scanf("%s",str)#define ans() printf("%d",ans)#define ansn() printf("%d\n",ans)#define anss() printf("%d ",ans)#define lans() printf("%lld",ans)#define lanss() printf("%lld ",ans)#define lansn() printf("%lld\n",ans)#define fansn() printf("%.10f\n",ans)#define r0(i,n) for(int i=0;i<(n);++i)#define r1(i,e) for(int i=1;i<=e;++i)#define rn(i,e) for(int i=e;i>=1;--i)#define rsz(i,v) for(int i=0;i<(int)v.size();++i)#define szz(x) ((int)x.size())#define mst(abc,bca) memset(abc,bca,sizeof abc)#define lowbit(a) (a&(-a))#define all(a) a.begin(),a.end()#define pii pair<int,int>#define pli pair<ll,int>#define pll pair<ll,ll>#define mp make_pair#define lrt rt<<1#define rrt rt<<1|1#define X first#define Y second#define PI (acos(-1.0))#define sqr(a) ((a)*(a))typedef long long ll;typedef unsigned long long ull;const ll mod = 1000000000+7;const double eps=1e-9;const int inf=0x3f3f3f3f;const ll infl = 10000000000000000;const int maxn=  200000+10;const int maxm = 100+10;//Pretests passedint in(int &ret){    char c;    int sgn ;    if(c=getchar(),c==EOF)return -1;    while(c!='-'&&(c<'0'||c>'9'))c=getchar();    sgn = (c=='-')?-1:1;    ret = (c=='-')?0:(c-'0');    while(c=getchar(),c>='0'&&c<='9')ret = ret*10+(c-'0');    ret *=sgn;    return 1;}int fa[maxn];//int le[maxn];int ri[maxn];int faf(int x){    return fa[x] ==x ? x: fa[x] = faf(fa[x]);}int far(int x){    return ri[x] == x ? x:ri[x] = far(ri[x]);}void un(int a,int b){    int f1 = faf(a), f2 = faf(b);    if(f1!=f2)fa[f2]=f1;}int main(){#ifdef LOCAL    freopen("input.txt","r",stdin);//    freopen("output.txt","w",stdout);#endif // LOCAL    int n,q;    sdd(n,q);    r1(i,n)fa[i]  = ri[i] = i;    r1(i,q)    {        int op,l,r;        sddd(op,l,r);        if(op==1)        {            if(l>r)swap(l,r);            un(l,r);            if(l==r-1)ri[l] = r;        }        else if(op&1)        {            int a = faf(l) , b = faf(r);            puts(a==b?"YES":"NO");        }        else        {            int now = l;            while(now<=r)            {                now = far(now);                un(r,now);                now++;                if(now<=r)ri[now-1] = now;            }        }    }    return 0;}