CF2014H求调

#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#include <set>
using namespace std;
#define ll long long
#define ull unsigned long long
#define int ll
#define pii pair<int,int>
int read()
{
    ll now = 0, nev = 1;
    char c = getchar();
    while (c < '0' || c > '9')
    {
        if (c == '-')
            nev = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9')
    {
        now = (now << 1) + (now << 3) + (c & 15);
        c = getchar();
    }
    return now * nev;
}
const int MAXN = 1e6 + 10;
const int mod = 998244353;
int n,m;
int a[MAXN];
int id[MAXN],t;
int bl[MAXN],br[MAXN];
void build()
{
	t=sqrt(n);
	if(t*t!=n)
		t++;
	for(int i=1;i<=t;i++)
		bl[i]=(i-1)*t+1,br[i]=i*t;
	br[t]=n;
	for(int i=1;i<=t;i++)
	{
		for(int j=bl[i];j<=br[i];j++)
			id[j]=i;
	}
}
struct question
{
	int l,r,id;
}q[MAXN];
bool cmp(question a,question b)
{
	if(id[a.l]!=id[b.l])
		return a.l<b.l;
	if(id[a.l]&1)
		return a.r>b.r;
	return a.r<b.r;
}
map<int,int>mp;
int now=0;//记录出现次数为奇数的数字个数 
void add(int x)
{
	mp[x]++;
	if(mp[x]&1)
		now++;
	else
		now--;	
}
void del(int x)
{
	mp[x]--;
	if(mp[x]&1)
		now++;
	else
		now--;	
}
int l,r;
void work(int ql,int qr)
{
	while(l<ql) del(a[l++]);
	while(l>ql) add(a[--l]);
	while(r<qr) add(a[++r]);
	while(r>qr) del(a[r--]);
}
bool ans[MAXN];
void solve()
{
	mp.clear();
	now=0;
	n=read(),m=read();
	for(int i=1;i<=n;i++)
		a[i]=read(),ans[i]=0;
	build();
	for(int i=1;i<=m;i++)
		q[i].l=read(),q[i].r=read(),q[i].id=i;
	sort(q+1,q+m+1,cmp);
	l=1,r=0;
	for(int i=1;i<=m;i++)
	{
		int ql=q[i].l,qr=q[i].r;
		work(ql,qr);
		if(now==0)
			ans[q[i].id]=1;
		else
			ans[q[i].id]=0;
	}
	for(int i=1;i<=m;i++)
	{
		if(ans[i])
			printf("Yes\n");
		else
			printf("No\n");
	}
}
signed main()
{
	int t=read();
	while(t--)
		solve();
	return 0;
}