【题解】codeforces1058F[ Codeforces Round #512 Div.2]F.Putting Boxes Together 树状数组+二分

题目链接

Description

There is an infinite line consisting of cells. There are n boxes in some cells of this line. The $i_{th}$ box stands in the cell $a_i$ and has weight $w_i$. All $a_i$ are distinct, moreover, $a_{i-1}<a_i$ holds for all valid $i$.

You would like to put together some boxes. Putting together boxes with indices in the segment $[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$ and change $a_i$ by $1$, all positions should remain distinct). You spend $w_i$ units of energy moving the box $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:

$id$ $nw$ — weight $w_{id}$ of the box $id$ becomes $nw$.
$l$ $r$ — you should compute the minimum total energy needed to put together boxes with indices in $[l,r]$. Since the answer can be rather big, print the remainder it gives when divided by $1000000007=10^9+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 $10^9+7$. So if you have two possible answers $2\cdot 10^9+13$ and $2\cdot 10^9+14$, you should choose the first one and print $10^9+6$, even though the remainder of the second answer is $0$.

Input

The first line contains two integers $n$ and $q$ $(1\le n,q\le 2\times 10^5)$ — the number of boxes and the number of queries.

The second line contains $n$ integers $a_1,a_2,\cdots ,a_n$ $(1\le a_i\le 10^9)$ — the positions of the boxes. All ai are distinct, $a_{i-1}<a_i$ holds for all valid $i$.

The third line contains $n$ integers $w_1,w_2,\cdots ,w_n$ $(1\le w_i\le 10^9)$ — the initial weights of the boxes.

Next $q$ lines describe queries, one query per line.

Each query is described in a single line, containing two integers $x$ and $y$. If $x<0$, then this query is of the first type, where $id=-x$, $nw=y$ $(1\le id\le n,1\le nw\le 10^9)$. If $x>0$, then the query is of the second type, where $l=x$ and $r=y$ $(1\le l_j\le r_j\le n)$. $x$ can not be equal to $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=10^9+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:

$11$ — there is only one box so we don’t need to move anything.
$15$ — we can move boxes to segment $[4,8]:1\times |1-4|+1\times |2-5|+1\times |6-6|+1\times |7-7|+2\times |10-8|=10$.
$13$ — we can move boxes to segment $[1,3]$.
$35$ — we can move boxes to segment $[7,9]$.
$-35$ — $w_3$ is changed from $1$ to $5$.
$-110$ — $w_1$ is changed from $1$ to $10$. The weights are now equal to $w=[10,1,5,1,2]$.
$14$ — we can move boxes to segment $[1,4]$.
$25$ — we can move boxes to segment $[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;
}

总结

第一次遇到带权中位数的题，好好学学。