[cf]F2. Guess the K-th Zero (Hard version)

题目

题目的询问比easy多，每次问出来之后都要把0变成1。

思路

用线段树记录一下$l到r$的$sum$。

代码

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define int long long
using namespace std;
const int INF = 0x3f3f3f3f;
int a[1000010];
struct sut{
	int l,r,mid,sum,len,lazy;
}tree[800010];
bool vis[800010];
void build(int x,int l,int r){
	tree[x].l=l,tree[x].r=r,tree[x].mid=(l+r)>>1;
	tree[x].len=r-l+1;tree[x].lazy=0;
	tree[x].sum=0;
	if(l==r){
		return;
	}
	int mid=tree[x].mid;
	build(x<<1,l,mid);
	build(x<<1|1,mid+1,r);
}
void pushdown(int x){
	if(tree[x].lazy){
		tree[x<<1].sum+=tree[x<<1].len*tree[x].lazy;
		tree[x<<1|1].sum+=tree[x<<1|1].len*tree[x].lazy;
		tree[x<<1].lazy+=tree[x].lazy;
		tree[x<<1|1].lazy+=tree[x].lazy;
		tree[x].lazy=0;	
	}
}
int query(int x,int pos){
	if(tree[x].l==tree[x].r){
		if(vis[x]){
			return tree[x].sum;
		}
		else{
				cout<<"? "<<1<<" "<<pos<<endl;
				int ans;
				cin>>ans;
				vis[x]=1;
				return tree[x].sum=ans;
			}
		}
		pushdown(x);
	int mid=tree[x].mid;
	if(pos<=mid) return query(x<<1,pos);
	else return query(x<<1|1,pos);
}
void edit(int x,int l,int r,int val){
	if(l<=tree[x].l&&tree[x].r<=r){
		tree[x].sum+=val*tree[x].len;
		tree[x].lazy+=val;
		return;
	}
	pushdown(x);
	int mid=tree[x].mid;
	if(l<=mid) edit(x<<1,l,r,val);
	if(mid<r) edit(x<<1|1,l,r,val);
}

signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int n,t;
	cin>>n>>t;
	build(1,1,n);
	while(t--){
		int k;
		cin>>k;
		int l=1,r=n,res=n;
		bool flag=0;
		while(l<=r){
			int mid=(l+r)>>1;
			int ans=query(1,mid);
			if(mid-ans>=k){
				res=mid;
				r=mid-1;
			}
			else if(mid-ans<k){
				l=mid+1; 
				}
			}
			cout<<"! "<<res<<endl;
			edit(1,res,n,1);
	}
    return 0;
}