Gym - 100923H Por Costel and the Match （并查集）

Por Costel and the Match

 

Oberyn Martell and Gregor Clegane are dueling in a trial by combat. The fight is extremely important, as the life of Tyrion Lannister is on the line. Oberyn and Gregor are measuring their skill in combat the only way the two best fighters in Westeros can, a match of Starcraft. The one who supervises the match in none other than Por Costel the pig.

Oberyn and Gregor are both playing the Terrans, and they confront each other in the middle of the map, each with an army of Marines. Unfortunately, pigs cannot distinguish colors that well, that is why Por Costel can't figure out which marine belongs to which player. All he sees is  marines in the middle of the map and, from time to time, two marines shooting each other. Moreover, it might be the case that Por Costel's imagination will play tricks on him and he will sometimes think two marines are shooting each other even though they are not.

People are starting to question whether Por Costel is the right person for this important job. It is our mission to remove those doubts. You will be given Por Costel's  observations. An observation consists in the fact that Por Costel sees that marine  and marine  are shooting each other. We know that marines in the same team (Oberyn's or Gregor's) can never shoot each other. Your task is to give a verdict for each observation, saying if it is right or not.

An observation of Por Costel's is considered correct if, considering this observation true and considering all the correct observations up to this point true, there is a way to split the marines in "Oberyn's team" and "Gregor's team" such that no two marines from the same team have ever shot each other. Otherwise, the observation is considered incorrect.

"Elia Martell!!! You rushed her! You cheesed her! You killed her SCVs!"

Input

The input file meciul.in will contain, on its first line, the number of tests  (). A test has the following structure: the first line contains integers () and  () and the next  lines each contain a pair of integers  and  () describing an observation of Por Costel's.

Output

The output file meciul.out will contain one line for each of Por Costel's observations, on each test. The line will contain "YES" if the observation is correct and "NO" otherwise. It is not necessary to leave extra spacing between the outputs of different test cases.

Example

Input

1
3 3
1 2
2 3
1 3

Output

YES
YES
NO

 

题目链接：http://codeforces.com/gym/100923/problem/H

题目大意：一共有n个小兵，属于两个阵营，同一个阵营的人不能互相射击，现在看到有m对小兵在互射，判断这m对小兵能否互射，能就YES，不能就NO

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<queue>
using namespace std;
#define ll long long
const int N=500005;
int f[N];
int find(int x)
{
    if(x==f[x]) return x;
    return f[x]=find(f[x]);
}
void join(int x,int y)
{
    int fx=find(x),fy=find(y);
    f[fy]=fx;
}
void myin()
{
    freopen("meciul.in","r",stdin);
    freopen("meciul.out","w",stdout);
}
int main()
{
    myin();
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n,m,x,y;
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n<<1;i++) f[i]=i;
        for(int i=0;i<m;i++)
        {
            scanf("%d%d",&x,&y);
            if(find(x)==find(y))
                printf("NO\n");
            else
            {
                join(x,y+n);
                join(x+n,y);
                printf("YES\n");
            }
        }
    }
    return 0;
}