【线段树上二分】swust2020新生赛【苍天阻我寻你，此情坚贞如一】

题目

题目链接

思路

睡醒再来

代码

//#pragma GCC optimize("-Ofast","-funroll-all-loops")
#include<bits/stdc++.h>
#define int long long
#define lowbit(x) (x &(-x))
#define endl '\n'
#define ls x<<1
#define rs x<<1|1
using namespace std;
const int INF=0x3f3f3f3f;
const int dir[4][2]={-1,0,1,0,0,-1,0,1};
const double PI=acos(-1.0);
const double e=exp(1.0);
const double eps=1e-10;
const int M=1e9+7;
const int N=1e6+10;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<int,int> PII;
typedef unsigned long long ull;
inline void read(int &x){
    char t=getchar();
    while(!isdigit(t)) t=getchar();
    for(x=t^48,t=getchar();isdigit(t);t=getchar()) x=x*10+(t^48);
}
struct seg{
	struct sut{
		int l,r,mid,mi,ma,lazy;
	}tree[N<<2];
	void pp(int x){
		tree[x].ma=max(tree[ls].ma,tree[rs].ma);
		tree[x].mi=min(tree[ls].mi,tree[rs].mi);
	}
	void build(int x,int l,int r,int L[],int R[]){
		tree[x]={l,r,(l+r)>>1,0,0,0};
		if(l==r){
			tree[x].ma=R[l];
			tree[x].mi=L[l];
			return;
		}
		int mid=tree[x].mid;
		build(ls,l,mid,L,R);
		build(rs,mid+1,r,L,R);
		pp(x);
	}
	void solve(int x,int k){
		tree[x].ma+=k;
		tree[x].mi+=k;
		tree[x].lazy+=k;
	}
	void pd(int x){
		if(tree[x].lazy){
			solve(ls,tree[x].lazy);
			solve(rs,tree[x].lazy);
			tree[x].lazy=0; 
		} 
	}
	void modify(int x,int l,int r,int k){
		if(tree[x].l>=l&&tree[x].r<=r){
			solve(x,k);
			return;
		}
		pd(x);
		int mid=tree[x].mid;
		if(l<=mid) modify(ls,l,r,k);
		if(mid<r) modify(rs,l,r,k);
		pp(x);
	}
	int query_min(int x,int l,int r){
		if(tree[x].l>=l&&tree[x].r<=r){
			return tree[x].mi;
		}
		int ans=INF;
		pd(x);
		int mid=tree[x].mid;
		if(l<=mid) ans=min(ans,query_min(ls,l,r));
		if(mid<r) ans=min(ans,query_min(rs,l,r));
		pp(x);
		return ans;
	}
	int query_max(int x,int l,int r){
		if(tree[x].l>=l&&tree[x].r<=r){
			return tree[x].ma;
		}
		int ans=-INF;
		pd(x);
		int mid=tree[x].mid;
		if(l<=mid) ans=max(ans,query_max(ls,l,r));
		if(mid<r) ans=max(ans,query_max(rs,l,r));
		pp(x);
		return ans;
	}
}t1,t2;
int a[1000010],b[1000010],sum[1000010];
int query_t1(int x,int l,int r,int prema,int premi){
	if(l+max(prema,t1.tree[x].ma)<r+min(premi,t2.tree[x].mi)) return -1;
	if(t1.tree[x].l==t1.tree[x].r) return t1.tree[x].l;
	t1.pd(x);
	t2.pd(x);
	int lma=max(prema,t1.tree[ls].ma);
	int lmi=min(premi,t2.tree[ls].mi);
	if(l+lma<r+lmi) return query_t1(rs,l,r,lma,lmi);
	else return query_t1(ls,l,r,prema,premi);
}
int query_t2(int x,int l,int r,int prema,int premi){
	if(l+max(prema,t2.tree[x].ma)<r+min(premi,t1.tree[x].mi)) return -1;
	if(t2.tree[x].l==t2.tree[x].r) return t2.tree[x].l;
	t2.pd(x);
	t1.pd(x);
	int lma=max(prema,t2.tree[ls].ma);
	int lmi=min(premi,t1.tree[ls].mi);
	if(l+lma<r+lmi) return query_t2(rs,l,r,lma,lmi);
	else return query_t2(ls,l,r,prema,premi);
}
signed main(){
//	ios::sync_with_stdio(false);
//	cin.tie(0);cout.tie(0);
	int n,q;
	cin>>n>>q;
	for(int i=1;i<=n;i++) cin>>a[i],sum[i]=sum[i-1]+a[i];
	t1.build(1,0,n,sum,sum);
	for(int i=1;i<=n;i++) cin>>b[i],sum[i]=sum[i-1]+b[i];
	t2.build(1,0,n,sum,sum);
	while(q--){
		int op,x,y;
		cin>>op>>x>>y;
		if(op==1){
			t1.modify(1,x,n,-a[x]);
			a[x]=y;
			t1.modify(1,x,n,y);
		}
		else if(op==2){
			t2.modify(1,x,n,-b[x]);
			b[x]=y;
			t2.modify(1,x,n,y);
		}
		else{
			int ans=0;
			if(x<y) ans=query_t1(1,x,y,0,0);
			else ans=query_t2(1,y,x,0,0);
			cout<<ans<<endl;
		}
		
	}
	return 0; 
}