bzoj4810 [Ynoi2017]由乃的玉米田

 1 //It is made by wfj_2048~
 2 #include <algorithm>
 3 #include <iostream>
 4 #include <complex>
 5 #include <cstring>
 6 #include <cstdlib>
 7 #include <cstdio>
 8 #include <vector>
 9 #include <bitset>
10 #include <cmath>
11 #include <queue>
12 #include <stack>
13 #include <map>
14 #include <set>
15 #define inf (1<<30)
16 #define N (1000010)
17 #define il inline
18 #define RG register
19 #define ll long long
20 #define File(s) freopen(s".in","r",stdin),freopen(s".out","w",stdout)
21 
22 using namespace std;
23 
24 struct node{ int i,opt,l,r,x; }q[N];
25 
26 int cnt[N],bl[N],ans[N],a[N],b[N],n,m,mc,block;
27 
28 bitset <100010> f,g,h;
29 
30 il int gi(){
31     RG int x=0,q=1; RG char ch=getchar();
32     while ((ch<‘0‘ || ch>‘9‘) && ch!=‘-‘) ch=getchar();
33     if (ch==‘-‘) q=-1,ch=getchar();
34     while (ch>=‘0‘ && ch<=‘9‘) x=x*10+ch-48,ch=getchar();
35     return q*x;
36 }
37 
38 il int cmp(const node &a,const node &b){
39     if (bl[a.l]==bl[b.l]) return a.r<b.r;
40     return bl[a.l]<bl[b.l];
41 }
42 
43 il void add(RG int x){
44     cnt[a[x]]++;
45     if (cnt[a[x]]==1) f[a[x]]=1,g[b[x]]=1;
46     return;
47 }
48 
49 il void del(RG int x){
50     cnt[a[x]]--;
51     if (!cnt[a[x]]) f[a[x]]=0,g[b[x]]=0;
52     return;
53 }
54 
55 il int check(RG int opt,RG int x){
56     if (opt==1){
57     h=f,h>>=x,h&=f;
58     if (h.count()) return 1;
59     }
60     if (opt==2){
61     h=g,h>>=abs(mc-x),h&=f;
62     if (h.count()) return 1;
63     }
64     if (opt==3){
65     RG int lim=sqrt(x+1);
66     for (RG int i=1;i<=lim;++i){
67         if (x%i) continue;
68         if (cnt[i] && cnt[x/i]) return 1;
69     }
70     }
71     return 0;
72 }
73 
74 il void work(){
75     n=gi(),m=gi(),block=sqrt(n),mc=100002;
76     for (RG int i=1;i<=n;++i)
77     a[i]=gi(),b[i]=mc-a[i],bl[i]=(i-1)/block+1;
78     for (RG int i=1;i<=m;++i)
79     q[i].i=i,q[i].opt=gi(),q[i].l=gi(),q[i].r=gi(),q[i].x=gi();
80     sort(q+1,q+m+1,cmp); RG int L=q[1].l,R=q[1].r;
81     for (RG int i=L;i<=R;++i) add(i); ans[q[1].i]=check(q[1].opt,q[1].x);
82     for (RG int i=2;i<=m;++i){
83     while (L>q[i].l) add(--L);
84     while (R<q[i].r) add(++R);
85     while (L<q[i].l) del(L++);
86     while (R>q[i].r) del(R--);
87     ans[q[i].i]=check(q[i].opt,q[i].x);
88     }
89     for (RG int i=1;i<=m;++i)
90     puts(ans[i] ? "yuno" : "yumi");
91     return;
92 }
93 
94 int main(){
95     File("yn");
96     work();
97     return 0;
98 }