分块还有前途吗

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int B=500;

int n,q;
ll s[300005],d[300005];

ll f[300005];
int ne[300005];

ll g[300005];
int far[300005];

int main(){
	ios::sync_with_stdio(0);
	
	cin>>n;
	for(int i=1;i<=n;++i) cin>>s[i]>>d[i];
	
	for(int i=1;i<n;++i){
		for(int j=0;j<60;++j){
			++f[i];
			ll np=s[i]+d[i]*(1ll<<j);
			if(np<s[i+1]) f[i]+=d[i]*(1ll<<j);
			else{
				ne[i]=upper_bound(s+1,s+n+1,np)-s-1;
				f[i]+=np-s[ne[i]];
				break;
			}
		}
	}
	
	f[n]=1e18,s[0]=-1e18;
	
	for(int i=1;i<=n;++i){
		if(i>n-B){
			g[i]=1e18;
			continue;
		}
		int cur=i;
		while(cur<i+B){
			g[i]+=f[cur];
			cur=ne[cur];
		}
		far[i]=cur;
	}
	
	cin>>q;
	
	while(q--){
		ll p,t;
		cin>>p>>t;
		
		int cur=upper_bound(s+1,s+n+1,p)-s-1;
		
		if(t<p-s[cur]){
			cout<<p-t<<endl;
			continue;
		}
		
		t-=p-s[cur];
		
		while(t>=g[cur]){
			t-=g[cur];
			cur=far[cur];
		}
		
		while(t>=f[cur]){
			t-=f[cur];
			cur=ne[cur];
		}
		
		ll ans=s[cur];
		
		for(int j=0;j<60;++j){
			if(t==0) break;
			--t;
			if(t>=d[cur]*(1ll<<j)) t-=d[cur]*(1ll<<j);
			else ans=s[cur]+d[cur]*(1ll<<j)-t,t=0;
		}
		
		cout<<ans<<endl;
	}
	
	return 0;
}