Submission #2240222

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define FF first
#define SS second

#define DUMP(x) cout<<#x<<":"<<(x)<<endl
template<class S, class T>
istream& operator>>(istream& is, pair<S,T>& p){
  return is >> p.FF >> p.SS;
}
template<class T>
istream& operator>>(istream& is, vector<T>& xs){
  for(auto& x: xs)
	is >> x;
  return is;
}
template<class S, class T>
ostream& operator<<(ostream& os, const pair<S,T>& p){
  return os << p.FF << " " << p.SS;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T>& xs){
  for(unsigned int i=0;i<xs.size();++i)
	os << (i?" ":"") << xs[i];
  return os;
}
template<class T>
void maxi(T& x, T y){
  if(x < y) x = y;
}
template<class T>
void mini(T& x, T y){
  if(x > y) x = y;
}


const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL MOD = 1e9+7;

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  LL X, K;
  cin >> X >> K;
  VL rs(K+2);
  REP(k,K)
	cin >> rs[k+1];
  rs[0] = 0;
  rs[K+1] = 1e15;
  LL Q;
  cin >> Q;

  LL lb = 0, ub = X;
  LL btm = 0, top = X;
  int it = 1;
  while(Q--){
	LL t, a;
	cin >> t >> a;
	while(rs[it] < t){
	  LL dl = rs[it] - rs[it-1];
	  if(it%2 == 1){ // down
		if(lb < dl){
		  maxi(btm, min(top, btm + dl - lb));
		}
		ub = max(0ll, ub - dl);
		lb = max(0ll, lb - dl);
	  }
	  else{ // up
		if(ub+dl > X){
		  mini(top, max(btm, top - (ub + dl - X)));
		}
		ub = min(X, ub + dl);
		lb = min(X, lb + dl);
	  }
	  
	  ++it;
	}

	LL dl = t - rs[it-1];
	LL ans = 1e15;
	if(a <= btm){
	  if(it % 2 == 1)
		ans = max(0ll, lb - dl);
	  else
		ans = min(X, lb + dl);
	}
	else if(top <= a){
	  if(it % 2 == 1)
		ans = max(0ll, ub - dl);
	  else
		ans = min(X, ub + dl);
	}
	else{
	  if(it % 2 == 1)
		ans = max(0ll, a - btm + lb - dl);
	  else
		ans = min(X, a - btm + lb + dl);
	}
	cout << ans << endl;
  }

  return 0;
}

Submission Info

Judge Result