1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<set>
#include<bitset>
#include<assert.h>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-6
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define NM 1500005
#define nm 250005
#define pi 3.1415926535897931
using namespace std;
ll read(){
ll x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f*x;
}
struct P{
int id,x,v;
bool operator<(const P&o)const{return x<o.x||(x==o.x&&id<o.id);}
}a[NM],tmp[NM];
int n,m,tot,num,ans[NM];
void cdq(int l,int r){
if(l==r)return;
int mid=l+r>>1,cnt=l;int s=0;
cdq(l,mid);cdq(mid+1,r);
for(int x=l,y=mid+1;x<=mid||y<=r;)
if(x<=mid&&(y>r||a[x]<a[y])){
if(a[x].id==1)s+=a[x].v;
tmp[cnt++]=a[x++];
}else{
if(a[y].id==2)ans[a[y].v]-=s;
else if(a[y].id==3)ans[a[y].v]+=s;
tmp[cnt++]=a[y++];
}
inc(i,l,r)a[i]=tmp[i];
}
int main(){
n=read();m=read();
inc(i,1,n)a[++tot]=P{1,i,read()};
while(m--){
a[++tot].id=read();
if(a[tot].id==1)a[tot].x=read(),a[tot].v=read();
else{
a[tot].x=read()-1;a[tot].v=++num;
a[++tot]=P{3,read(),num};
}
}
cdq(1,tot);
inc(i,1,num)printf("%d\n",ans[i]);
return 0;
}
|
