Description
There is an infinite line consisting of cells. There are n boxes in some cells of this line. The i t h i_{th} ith box stands in the cell a i a_i ai and has weight w i w_i wi. All a i a_i ai are distinct, moreover, a i − 1 < a i a_{i−1}<a_i ai−1<ai holds for all valid i i i.
You would like to put together some boxes. Putting together boxes with indices in the segment [ l , r ] [l,r] [l,r] means that you will move some of them in such a way that their positions will form some segment 4[x,x+(r−l)]$.
In one step you can move any box to a neighboring cell if it isn’t occupied by another box (i.e. you can choose i i i and change a i a_i ai by 1 1 1, all positions should remain distinct). You spend w i w_i wi units of energy moving the box i i i by one cell. You can move any box any number of times, in arbitrary order.
Sometimes weights of some boxes change, so you have queries of two types:
i
d
id
id
n
w
nw
nw — weight
w
i
d
w_{id}
wid of the box
i
d
id
id becomes
n
w
nw
nw.
l
l
l
r
r
r — you should compute the minimum total energy needed to put together boxes with indices in
[
l
,
r
]
[l,r]
[l,r]. Since the answer can be rather big, print the remainder it gives when divided by
1000000007
=
1
0
9
+
7
1000000007=10^9+7
1000000007=109+7. Note that the boxes are not moved during the query, you only should compute the answer.
Note that you should minimize the answer, not its remainder modulo
1
0
9
+
7
10^9+7
109+7. So if you have two possible answers
2
⋅
1
0
9
+
13
2⋅10^9+13
2⋅109+13 and
2
⋅
1
0
9
+
14
2⋅10^9+14
2⋅109+14, you should choose the first one and print
1
0
9
+
6
10^9+6
109+6, even though the remainder of the second answer is
0
0
0.
Input
The first line contains two integers n n n and q q q ( 1 ≤ n , q ≤ 2 × 1 0 5 ) (1≤n,q≤2\times10^5) (1≤n,q≤2×105) — the number of boxes and the number of queries.
The second line contains n n n integers a 1 , a 2 , ⋯   , a n a_1,a_2,\cdots,a_n a1,a2,⋯,an ( 1 ≤ a i ≤ 1 0 9 ) (1≤a_i≤10^9) (1≤ai≤109) — the positions of the boxes. All ai are distinct, a i − 1 < a i a_{i−1}<a_i ai−1<ai holds for all valid i i i.
The third line contains n n n integers w 1 , w 2 , ⋯   , w n w_1,w_2,\cdots,w_n w1,w2,⋯,wn ( 1 ≤ w i ≤ 1 0 9 ) (1≤w_i≤10^9) (1≤wi≤109) — the initial weights of the boxes.
Next q q q lines describe queries, one query per line.
Each query is described in a single line, containing two integers x x x and y y y. If x < 0 x<0 x<0, then this query is of the first type, where i d = − x id=−x id=−x, n w = y nw=y nw=y ( 1 ≤ i d ≤ n , 1 ≤ n w ≤ 1 0 9 ) (1≤id≤n, 1≤nw≤10^9) (1≤id≤n,1≤nw≤109). If x > 0 x>0 x>0, then the query is of the second type, where l = x l=x l=x and r = y r=y r=y ( 1 ≤ l j ≤ r j ≤ n ) (1≤l_j≤r_j≤n) (1≤lj≤rj≤n). x x x can not be equal to 0 0 0.
Output
For each query of the second type print the answer on a separate line. Since answer can be large, print the remainder it gives when divided by 1000000007 = 1 0 9 + 7 1000000007=10^9+7 1000000007=109+7.
Example
Input
5 8
1 2 6 7 10
1 1 1 1 2
1 1
1 5
1 3
3 5
-3 5
-1 10
1 4
2 5
Output
0
10
3
4
18
7
Note
Let’s go through queries of the example:
1
1
1\quad1
11 — there is only one box so we don’t need to move anything.
1
5
1\quad 5
15 — we can move boxes to segment
[
4
,
8
]
:
1
×
∣
1
−
4
∣
+
1
×
∣
2
−
5
∣
+
1
×
∣
6
−
6
∣
+
1
×
∣
7
−
7
∣
+
2
×
∣
10
−
8
∣
=
10
[4,8]: 1\times|1−4|+1\times|2−5|+1\times|6−6|+1\times|7−7|+2\times|10−8|=10
[4,8]:1×∣1−4∣+1×∣2−5∣+1×∣6−6∣+1×∣7−7∣+2×∣10−8∣=10.
1
3
1\quad 3
13 — we can move boxes to segment
[
1
,
3
]
[1,3]
[1,3].
3
5
3\quad 5
35 — we can move boxes to segment
[
7
,
9
]
[7,9]
[7,9].
−
3
5
−3\quad 5
−35 —
w
3
w_3
w3 is changed from
1
1
1 to
5
5
5.
−
1
10
−1\quad 10
−110 —
w
1
w_1
w1 is changed from
1
1
1 to
10
10
10. The weights are now equal to
w
=
[
10
,
1
,
5
,
1
,
2
]
w=[10,1,5,1,2]
w=[10,1,5,1,2].
1
4
1\quad 4
14 — we can move boxes to segment
[
1
,
4
]
[1,4]
[1,4].
2
5
2\quad 5
25 — we can move boxes to segment
[
5
,
8
]
[5,8]
[5,8].
第一次遇到带权中位数的题,学习了大佬博客
#include<cstdio>
#include<cmath>
using namespace std;
typedef long long ll;
const int N=2e5+10;
const int mod=1e9+7;
int n,q;
ll a[N],w[N],c[N<<1][2];
inline void add(int x,ll v,int id)
{
if(!id)for(;x<=n;x+=x&-x)c[x][id]+=v;
else for(;x<=n;x+=x&-x)c[x][id]=(c[x][id]+v+mod)%mod;
}
inline ll ask(int x,int id)
{
ll ret=0;
if(!id)for(;x;x-=x&-x)ret+=c[x][id];
else for(;x;x-=x&-x)ret=(ret+c[x][id]+mod)%mod;
return ret;
}
inline ll gets(int x,int y,int id)
{
if(!id)return y>=x?ask(y,id)-ask(x-1,id):0;
else return (ask(y,id)-ask(x-1,id)+mod)%mod;
}
inline int bsearch(int x,int y)
{
int l=x,r=y,mid;
while(l<r)
{
mid=(l+r)/2;
if(gets(x,mid,0)>=gets(mid+1,y,0))r=mid;
else l=mid+1;
}
return r;
}
int main()
{
//freopen("in.txt","r",stdin);
scanf("%d%d",&n,&q);
for(register int i=1;i<=n;i++)scanf("%lld",&a[i]);
for(register int i=1;i<=n;i++)scanf("%lld",&w[i]),add(i,w[i],0),add(i,w[i]*(a[i]-i),1);
while(q--)
{
int x,y;
scanf("%d%d",&x,&y);
if(x<0)
{
x=-x;
add(x,-w[x],0);add(x,-w[x]*(a[x]-x),1);
w[x]=y;
add(x,w[x],0);add(x,w[x]*(a[x]-x),1);
}
else
{
if(x==y){puts("0");continue;}
ll pos=bsearch(x,y),ans=0;
ans=(ans+(gets(x,pos,0)%mod)*(int)abs(a[pos]-pos)%mod-gets(x,pos,1)+mod)%mod;
ans=(ans-(gets(pos,y,0)%mod)*(int)abs(a[pos]-pos)%mod+gets(pos,y,1)+mod)%mod;
printf("%lld\n",ans);
}
}
return 0;
}
总结
第一次遇到带权中位数的题,好好学学。