CodeForce 566D Restructuring Company

题目描述

Even the most successful company can go through a crisis period when you have to make a hard decision — to restructure, discard and merge departments, fire employees and do other unpleasant stuff. Let's consider the following model of a company.

There are n people working for the Large Software Company. Each person belongs to some department. Initially, each person works on his own project in his own department (thus, each company initially consists of n departments, one person in each).

However, harsh times have come to the company and the management had to hire a crisis manager who would rebuild the working process in order to boost efficiency. Let's use team(person) to represent a team where person person works. A crisis manager can make decisions of two types:

1. Merge departments team(x) and team(y) into one large department containing all the employees of team(x) and team(y), where x and y (1 ≤ x, y ≤ n) — are numbers of two of some company employees. If team(x) matches team(y), then nothing happens.
2. Merge departments team(x), team(x + 1), ..., team(y), where x and y (1 ≤ x ≤ y ≤ n) — the numbers of some two employees of the company.

At that the crisis manager can sometimes wonder whether employees x and y (1 ≤ x, y ≤ n) work at the same department.

Help the crisis manager and answer all of his queries.

Input

The first line of the input contains two integers n and q (1 ≤ n ≤ 200 000, 1 ≤ q ≤ 500 000) — the number of the employees of the company and the number of queries the crisis manager has.

Next q lines contain the queries of the crisis manager. Each query looks like type x y, where . If type = 1 or type = 2, then the query represents the decision of a crisis manager about merging departments of the first and second types respectively. If type = 3, then your task is to determine whether employees x and y work at the same department. Note that x can be equal to y in the query of any type.

Output

For each question of type 3 print "YES" or "NO" (without the quotes), depending on whether the corresponding people work in the same department.

Examples

Input

8 6
3 2 5
1 2 5
3 2 5
2 4 7
2 1 2
3 1 7

Output

NO
YES
YES

思路：并查集，区间合并。将区间段合并的操作十分耗时，想办法记录每一次合并后的合并区间段，再有合并操作的时候可以跳过之前已经合并的部分，节省很多时间。用输入输出流会超时

 

#include <iostream>
#include <cstdio>
#include <cstdlib>

using namespace std;

int n,q;
int tree[200020];
int area[200020];   //area[i]指向下一个与i不在同一集合的人

int findRoot(int x){
    if(tree[x]==x)return x;
    else return tree[x]=findRoot(tree[x]);
}

int main()
{
    scanf("%d%d",&n,&q);     ///用cin会超时
    for(int i=1;i<=n;i++){
        tree[i]=i;
        area[i]=i+1;
    }
    int type,a,b;
    while(q--){
        scanf("%d%d%d",&type,&a,&b);
        if(type == 1){
            int ra=findRoot(a);
            int rb=findRoot(b);
            if(ra!=rb){
                tree[rb]=ra;
            }
        }
        else if(type == 2){
            int ra=findRoot(a);
            int tmp;
            for(int i=a+1;i<=b;i=tmp){    ///i=area[i];错！下数第六行有对a[i]进行修改的操作
                int rbi=findRoot(i);
                if(ra!=rbi){
                    tree[rbi]=ra;
                }
                tmp=area[i];
                area[i]=area[b];
            }
        }
        else{
            int ra=findRoot(a);
            int rb=findRoot(b);
            if(ra==rb){
                printf("YES\n");
            }
            else {
                printf("NO\n");
            }
        }
    }
    return 0;
}