提出 #1816259

---

ソースコード 拡げる

#include"bits/stdc++.h"


#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define iout(x) printf("%d\n",x)
#define lout(x) printf("%lld\n",x)
#define REP(x,l,u) for(int x = (l);x<=(u);x++)
#define RREP(x,l,u) for(int x = (l);x>=(u);x--)
#define mst(x,a) memset(x,a,sizeof(x))
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define MP make_pair
#define se second
#define fi first
#define dbg(x) cout<<#x<<" = "<<(x)<<endl;
#define sz(x) ((int)x.size())
#define cl(x) x.clear()

typedef  long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
using namespace std;

const int maxn = 100010;
const int mod = 1e9+7;
const int MAX = 1000000010;
const double eps = 1e-6;
const double PI = acos(-1);

template<typename T> inline void read(T &x){
x=0;T f=1;char ch;do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');do x=x*10+ch-'0',ch=getchar();while(ch<='9'&&ch>='0');x*=f;
}

template<typename A,typename B> inline void read(A&x,B&y){read(x);read(y);}
template<typename A,typename B,typename C> inline void read(A&x,B&y,C&z){read(x);read(y);read(z);}
template<typename A,typename B,typename C,typename D> inline void read(A&x,B&y,C&z,D&w){read(x);read(y);read(z);read(w);}
template<typename A,typename B> inline A fexp(A x,B p){A ans=1;for(;p;p>>=1,x=1LL*x*x%mod)if(p&1)ans=1LL*ans*x%mod;return ans;}
template<typename A,typename B> inline A fexp(A x,B p,A mo){A ans=1;for(;p;p>>=1,x=1LL*x*x%mo)if(p&1)ans=1LL*ans*x%mo;return ans;}

int X,n,Q;

int R[maxn],c[maxn],l[maxn],r[maxn];

void Work(){
	read(Q);
	while(Q--){
		int t,a;
		read(t,a);
		int x=upper_bound(R+1,R+n+1,t)-R-1;
		int ans=a+c[x];
		ans=min(ans,r[x]);ans=max(ans,l[x]);
		if(x&1)ans+=t-R[x];else ans-=t-R[x];
		ans=min(ans,X);ans=max(ans,0);
		iout(ans);
	}
}

void Init(){
	read(X);
	read(n);
	REP(i,1,n)read(R[i]);
	l[0]=0;r[0]=X;c[0]=0;
	REP(i,1,n){
		int t;
		if(i&1)t=-1;else t=1;
		t*=(R[i]-R[i-1]);
		c[i]=c[i-1]+t;//c[i]=min(c[i],X);c[i]=max(c[i],-X);
		l[i]=l[i-1]+t;l[i]=min(l[i],X);l[i]=max(l[i],0);
		r[i]=r[i-1]+t;r[i]=min(r[i],X);r[i]=max(r[i],0);
	}
}

int main(){
	Init();
	Work();
	return 0;
}

提出情報

ジャッジ結果