对每个区间维护一下这个区间每个数有没有,用bitset压一下,这个用莫队跑出来,然后就能判加减合不合法了
乘的话根号枚举一下就行了
#include<iostream>
#include<cstring>
#include<ctime>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<cstdlib>
#include<cstdio>
#include<map>
#include<bitset>
#include<set>
#include<stack>
#include<vector>
#include<queue>
using namespace std;
#define MAXN 100010
#define MAXM 1010
#define ll long long
#define eps 1e-8
#define MOD 1000000007
#define INF 1000000000
char xB[1<<15],*xS=xB,*xTT=xB;
#define getc() (xS==xTT&&(xTT=(xS=xB)+fread(xB,1,1<<15,stdin),xS==xTT)?0:*xS++)
#define isd(c) (c>='0'&&c<='9')
int read(){
char xchh;
int xaa;
while(xchh=getc(),!isd(xchh));(xaa=xchh-'0');
while(xchh=getc(),isd(xchh))xaa=xaa*10+xchh-'0';return xaa;
}
const int lim=100010;
struct que{
int l;
int r;
int bel;
int o;
int x;
int I;
friend bool operator <(que x,que y){
return x.bel!=y.bel?x.bel<y.bel:x.r<y.r;
}
};
int n,m;
int a[MAXN];
int c[MAXN];
que q[MAXN];
bitset<lim>f,g;
int ans[MAXN];
int main(){
int i,j;
n=read();
m=read();
for(i=1;i<=n;i++){
a[i]=read();
}
int N=(int)sqrt(n);
for(i=1;i<=m;i++){
q[i].o=read();
q[i].l=read();
q[i].r=read();
q[i].x=read();
q[i].bel=(q[i].l+1)/N;
q[i].I=i;
}
sort(q+1,q+m+1);
int L=1,R=0;
for(i=1;i<=m;i++){
while(R<q[i].r){
R++;
if(!c[a[R]]++){
f[a[R]]=1;
g[lim-a[R]]=1;
}
}
while(L>q[i].l){
L--;
if(!c[a[L]]++){
f[a[L]]=1;
g[lim-a[L]]=1;
}
}
while(R>q[i].r){
if(!--c[a[R]]){
f[a[R]]=0;
g[lim-a[R]]=0;
}
R--;
}
while(L<q[i].l){
if(!--c[a[L]]){
f[a[L]]=0;
g[lim-a[L]]=0;
}
L++;
}
if(q[i].o==1){
ans[q[i].I]=((f>>q[i].x)&f).any();
}
if(q[i].o==2){
ans[q[i].I]=((g>>(lim-q[i].x))&f).any();
}
if(q[i].o==3){
if(q[i].x==0&&f[0]){
ans[q[i].I]=1;
}
for(j=1;j*j<=q[i].x;j++){
if(!(q[i].x%j)){
if(f[j]&f[q[i].x/j]){
ans[q[i].I]=1;
break;
}
}
}
}
}
for(i=1;i<=m;i++){
printf(ans[i]?"yuno\n":"yumi\n");
}
return 0;
}
/*
5 5
1 1 2 3 4
2 1 1 2
1 1 2 2
3 1 1 1
3 5 5 16
1 2 3 4
*/