text
stringlengths 49
983k
|
|---|
#include <algorithm>
#include <cstdio>
#define calc(l, r, t) std::min(l, std::max(r, t))
int seq[100005];
int main()
{
// freopen("ARC082-F.in", "r", stdin);
int x, n;
scanf("%d%d", &x, &n);
for (int i = 0; i < n; i++)
scanf("%d", seq + i);
int q, idx = 0, coef = -1, l = x, r = 0, c = 0;
scanf("%d", &q);
while (q--)
{
int t, a;
scanf("%d%d", &t, &a);
while (idx < n && t >= seq[idx])
{
int dt = coef * (seq[idx] - (idx ? seq[idx - 1] : 0));
l = calc(x, 0, l + dt);
r = calc(x, 0, r + dt);
c += dt;
idx++;
coef *= -1;
}
int dt = coef * (t - (idx ? seq[idx - 1] : 0));
printf("%d\n", calc(x, 0, calc(l, r, a + c) + dt));
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
const int N = 1e5;
int x;
int k;
int r[N+5];
int q;
vector<pii> lq;
int main(){
scanf("%d",&x);
scanf("%d",&k);
for(int i=1;i<=k;i++){
scanf("%d",&r[i]);
}
r[k+1] = (int) 1e9;
scanf("%d",&q);
for(int i=0;i<q;i++){
int a,b;
scanf("%d%d",&a,&b);
lq.push_back(make_pair(a,b));
}
int id = 0;
int baw = 0;
int at = x;
int ps = 0;
int maksi = x;
int mini = 0;
int ibaw = 0;
int iat = x;
for(int i=1;i<=k+1;i++){
int dif = r[i] - r[i-1];
while(id < lq.size() && lq[id].first <= r[i]){
int y = lq[id].second;
int ans = y - ps;
if(y <= baw){
ans = ibaw;
}
if(y >= at){
ans = iat;
}
if(i&1){
ans -= lq[id].first - r[i-1];
} else {
ans += lq[id].first - r[i-1];
}
ans = max(0,ans);
ans = min(ans,x);
// if(!(i&1)) ans = x-ans;
printf("%d\n",ans);
id++;
}
if(i&1){
ps+=dif;
maksi-=dif;
mini-=dif;
ibaw-=dif;
iat-=dif;
if(ibaw < 0) ibaw = 0;
if(iat < 0) iat = 0;
if(mini < 0) baw -= mini, mini=0;
} else {
ps-=dif;
maksi+=dif;
mini+=dif;
ibaw+=dif;
iat+=dif;
if(ibaw > x) ibaw = x;
if(iat > x) iat = x;
if(maksi > x) at -= maksi - x,maksi = x;
}
// cout << "baw " << baw << " and " << at << endl;
}
return 0;
}
/*
0 5 9 13 14 20
1-10, 1-5,
5,6,7,8,9,10
0,1,2,3,4,5 => 4,5,6,7,8,9
*/
|
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define forE(i,x) for(int i=head[x];i!=-1;i=ne[i])
using namespace std;
typedef long long i64;
typedef unsigned long long u64;
typedef unsigned u32;
typedef pair<int,int> pin;
#define mk(a,b) make_pair(a,b)
#define lowbit(x) ((x)&(-(x)))
#define sqr(a) ((a)*(a))
#define clr(a) (memset((a),0,sizeof(a)))
#define ls ((x)<<1)
#define rs (((x)<<1)|1)
#define mid (((l)+(r))>>1)
#define pb push_back
#define w1 first
#define w2 second
inline void read(int &x){
x=0;int f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
x*=f;
}
inline void judge(){
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
}
/******************************head*******************************/
const int maxn=100005;
int X,K,r[maxn],Q,a,b,c,d;
inline void add(int v){
c+=v;
if(a>X-c)a=b=X-c;
else b=b>X-c?X-c:b;
if(b<-c)a=b=-c;
else a=a<-c?-c:a;
}
int main(){
read(X);read(K);
rep(i,1,K)read(r[i]);
a=0;b=X;c=d=0;
read(Q);int j=1,k=-1;
rep(i,1,Q){
int t,x;read(t);read(x);
for(;j<=K&&r[j]<=t;d=r[j++],k=-k)add(k*(r[j]-d));
add(k*(t-d));d=t;
int res;
if(x<a)res=a+c;else if (x<=b)res=x+c;else res=b+c;
printf("%d\n",res);
}
return 0;
}
|
#include <iostream>
#include <unordered_map>
#include <algorithm>
#define ll long long
using namespace std;
int x, k, q, t, a, low, up, add, delta, now, ans, r[100007];
bool flag;
int cal(int tt, int lower = 0, int upper = x) {
if (tt < lower) return lower;
if (tt > upper) return upper;
return tt;
}
int main() {
// ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
cin >> x >> k;
for (int i = 1; i <= k; i++) cin >> r[i];
cin >> q;
low = x, now = 1;
while (q--) {
cin >> t >> a;
while (t >= r[now] && now <= k) {
delta = (flag ? 1 : -1) * (r[now] - r[now - 1]), add += delta;
up = cal(delta + up), low = cal(delta + low);
flag = !flag, now++;
}
ans = cal((flag ? 1 : -1) * (t - r[now - 1]) + cal(a + add, up, low));
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int X, K;
cin >> X >> K;
vector<int> R(K+2);
for(int i=1; i<=K; i++) cin >> R[i];
R[K+1] = 1e9;
int Q;
cin >> Q;
vector<int> T(Q), A(Q);
for(int i=0; i<Q; i++) cin >> T[i] >> A[i];
int q = 0;
int mni = 0, mn = 0, mxi = X, mx = X;
bool rev = false;
for(int i=0; i<=K; i++){
//cerr << mni << " " << mn << " " << mxi << " " << mx << endl;
while(q < Q && T[q] <= R[i+1]){
int a = (rev ? X-A[q] : A[q]), t = T[q] - R[i];
int ans = max(min(mx, max(mn, mn+a-mni)) - t, 0);
if(rev) ans = X-ans;
cout << ans << endl;
q++;
}
mn -= R[i+1] - R[i];
mx -= R[i+1] - R[i];
if(mx <= 0){
mni = mxi = mn = mx = 0;
}else if(mn <= 0){
mni -= mn;
mn = 0;
}
mni = X-mni;
mxi = X-mxi;
mn = X-mn;
mx = X-mx;
swap(mni, mxi);
swap(mn, mx);
rev = !rev;
}
}
|
#include<bits/stdc++.h>
#define L long long
#define pb push_back
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define aa first
#define bb second
#define mp make_pair
#define mpp(a,b,c) mp(mp(a,b),c)
using namespace std;
int n,m,q,x[100010],a,b,c,t;
inline void orz(int t,int k)
{
if(k==1)
{
c+=t;
if(b+c>m)
b=m-c;
if(a>b)
a=b=0,c=m;
}
else
{
c-=t;
if(a+c<0)
a=-c;
if(a>b)
a=b=c=0;
}
}
int main()
{
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
int i,j,k,l;
scanf("%d%d",&m,&n);
for(i=1;i<=n;i++)
scanf("%d",&x[i]);
b=m;
k=1;
l=-1;
scanf("%d",&q);
while(q--)
{
scanf("%d%d",&i,&j);
while(k<=n && i>=x[k])
{
orz(x[k]-t,l);
t=x[k];
l*=-1;
k++;
}
orz(i-t,l);
t=i;
if(j<=a)
printf("%d\n",a+c);
else if(j<=b)
printf("%d\n",j+c);
else
printf("%d\n",b+c);
}
return 0;
}
|
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=100010;
int n,m,a[maxn];
int calc(int l,int r,int x)
{return max(l,min(r,x));}
int main(){
int X;
scanf("%d%d",&X,&n);
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
int L=0,R=X;//初值……习惯
int t=0,k=0,s=-1,x=0;
int time,A;
scanf("%d",&m);
for(int i=1;i<=m;i++){
scanf("%d%d",&time,&A);
while(k<n&&a[k+1]<=time){
int dif=s*(a[k+1]-t);
L=calc(0,X,L+dif);
R=calc(0,X,R+dif);
s*=-1;
x+=dif;
t=a[k+1];
k++;
}//printf("\nL=%d R=%d\n",L,R);
//printf("\nk=%d\n",k);
int T=time-t;
A=calc(L,R,A+x);
//printf("\nA=%d\n",A);
A=calc(0,X,A+s*T);
printf("%d\n",A);
}
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;
int main(int argc, char const *argv[]) {
ll x, k;std::cin >> x >> k;
multiset<vll> st;
for(int i=0;i<k;i++){
ll a;scanf("%lld", &a);
st.insert(vll{a, -10000000000});
}
ll q;std::cin >> q;
for(int i=0;i<q;i++){
ll t, a;scanf("%lld %lld", &t, &a);
st.insert(vll{t, a});
}
ll prev = 0;
ll a = 0, b = x, c = 0, cnt = 0;
for(auto v:st){
ll sa = v[0] - prev;
if(cnt%2){
c += sa;
if(b+c>x) b = x - c;
if(a>b) a = b;
}else{
c -= sa;
if(a+c<0) a = -c;
if(a>b) b = a;
}
prev = v[0];
if(v[1]==-10000000000) cnt++;
else std::cout << max(a, min(b, v[1])) + c << '\n';
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define N 1111116
int n,m,x,mx,mn,k,b,a[N],ans[N];
pair<int,int> q[N];
int read(){
int x=0,f=1;char ch=getchar();
for (;!isdigit(ch);ch=getchar()) if (ch=='-') f=-f;
for (;isdigit(ch);ch=getchar()) x=x*10+ch-'0';
return x*f;
}
int main(){
x=read();n=read();
for (int i=1;i<=n;i++)
q[i]=make_pair(read(),0);
m=read();
for (int i=1;i<=m;i++){
q[n+i]=make_pair(read(),i);
a[i]=read();
}
sort(q+1,q+n+m+1);
mn=0;mx=x;k=-1;b=0;
for (int i=1;i<=n+m;i++){
mn+=k*(q[i].first-q[i-1].first);
mn=min(max(mn,0),x);
mx+=k*(q[i].first-q[i-1].first);
mx=min(max(mx,0),x);
b+=k*(q[i].first-q[i-1].first);
if (!q[i].second) k=-k;
else ans[q[i].second]=min(max(a[q[i].second]+b,mn),mx);
}
for (int i=1;i<=m;i++)
printf("%d\n",ans[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int x,k,q,r[100010],t[100010],a[100010];
void work()
{
scanf("%d %d",&x,&k);
for (int i=1; i<=k; i++) scanf("%d",&r[i]);
scanf("%d",&q);
for (int i=1; i<=q; i++) scanf("%d %d",&t[i],&a[i]);
if (t[q]>=r[k]) r[++k]=t[q]+1;
for (int i=1,j=1,L=0,R=x,s=0,ty=-1; i<=k; i++,ty*=-1)
{
for (; (j<=q)&&(t[j]<r[i]); j++)
printf("%d\n",min(max(min(max(a[j]+s,L),R)+ty*(t[j]-r[i-1]),0),x));
L=min(max(L+ty*(r[i]-r[i-1]),0),x);
R=min(max(R+ty*(r[i]-r[i-1]),0),x);
s+=ty*(r[i]-r[i-1]);
}
}
int main()
{
work();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a) for(int i=0;i<(a);i++)
const ll MOD=1000000007;
int main(){
ll X; int K; cin>>X>>K;
set<pair<ll,ll> > st;
rep(i,K){
ll t; cin>>t;
st.insert(make_pair(t,-1));
}
int Q; cin>>Q;
rep(i,Q){
ll t,a; cin>>t>>a;
st.insert(make_pair(t,a));
}
bool inc=0;
ll pre=0, a=0,b=X,c=0;
for(auto s:st){
ll t=s.first, x=s.second;
ll dt=t-pre;
if(inc){
c+=dt;
if(b+c>X) b=X-c;
if(a>b) a=b;
}else{
c-=dt;
if(a+c<0) a=-c;
if(a>b) b=a;
}
if(x==-1) inc=!inc;
else cout<<max(a,min(b,x))+c<<endl;
pre=t;
}
return 0;
}
|
#include <cstdio>
#include <algorithm>
const int maxn = 1e5 + 5;
using namespace std;
struct QNode{
int t, a, res, id;
bool operator< (QNode x)const{
return t < x.t || (t == x.t && a < x.a);
}
}q[maxn]; int X, n, Q, r[maxn], opt = -1;
bool cmpid(QNode x, QNode y){
return x.id < y.id;
}
int main(){
scanf("%d%d", &X, &n); for (int i = 1; i <= n; i++) scanf("%d", r + i);
scanf("%d", &Q); for (int i = 1; i <= Q; i++) scanf("%d%d", &q[i].t, &q[i].a), q[i].id = i;
sort(q + 1, q + Q + 1);
int lr = 0, lq = 1, u = X, d = 0, S = 0;
while (lq <= Q){
if (r[lr + 1] < q[lq].t && lr < n){
++lr; int t = opt * (r[lr] - r[lr - 1]);
d = max(0, min(X, d + t));
u = max(0, min(X, u + t));
S += t; opt *= -1;
}
else{
q[lq].res = max(d, min(u, S + q[lq].a));
q[lq].res = min(X, max(0, q[lq].res + opt * (q[lq].t - r[lr])));
++lq;
}
} sort(q + 1, q + Q + 1, cmpid);
for (int i = 1; i <= Q; i++) printf("%d\n", q[i].res);
return 0;
}
|
#include <iostream>
#include <unordered_map>
#include <algorithm>
#define ll long long
using namespace std;
int x, k, q, t, a, low, up, add, delta, now, ans, r[100007];
bool flag;
int cal(int tt, int lower = 0, int upper = x) {
if (tt < lower) return lower;
if (tt > upper) return upper;
return tt;
}
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
cin >> x >> k;
for (int i = 1; i <= k; i++) cin >> r[i];
cin >> q;
low = x, now = 1;
while (q--) {
cin >> t >> a;
while (t >= r[now] && now <= k) {
delta = (flag ? 1 : -1) * (r[now] - r[now - 1]), add += delta;
up = cal(delta + up), low = cal(delta + low);
flag = !flag, now++;
}
ans = cal((flag ? 1 : -1) * (t - r[now - 1]) + cal(a + add, up, low));
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
long long u[100010],d[100010],r[100010],mn[100010],mx[100010];
int main(){
long long i,j,x,k,q,t,a,l;
cin >> x >> k;
for(i=1;i<=k;i++){
cin >> r[i];
}
r[0] = 0;
//前処理
u[0] = 0; d[0] = x; mn[0] = 0; mx[0] = x;
for(i=1;i<=k;i++){
long long y = r[i]-r[i-1],k;
if(i%2==1){
mx[i] = max(mx[i-1]-y,(long long)0);
mn[i] = max(mn[i-1]-y,(long long)0);
u[i] = u[i-1]+mn[i]-(mn[i-1]-y);
d[i] = d[i-1];
}else{
mx[i] = min(mx[i-1]+y,x);
mn[i] = min(mn[i-1]+y,x);
u[i] = u[i-1];
d[i] = d[i-1]-(mx[i-1]+y-mx[i]);
}
}
cin >> q;
l = 0;
for(j=0;j<q;j++){
cin >> t >> a;
for(i=l;i<=k;i++){
if(r[i]>t){
l = i-1;
break;
}
if(i==k){
l = i;
}
}
if(u[l]>=d[l]){
if(l%2==0){
cout << max(mn[l]-t+r[l],(long long)0) << endl;
}else{
cout << min(mn[l]+t-r[l],x) << endl;
}
}else{
if(a<=u[l]){
if(l%2==0){
cout << max(mn[l] - t + r[l],(long long)0) << endl;
}else{
cout << min(mn[l] + t - r[l],x) << endl;
}
}else if(a>=d[l]){
if(l%2==0){
cout << max(mx[l] - t + r[l],(long long)0) << endl;
}else{
cout << min(mx[l] + t - r[l],x) << endl;
}
}else{
if(l%2==0){
cout << max(mx[l]-(d[l]-a)-t+r[l],(long long)0) << endl;
}else{
cout << min(mx[l]-(d[l]-a)+t-r[l],x) << endl;
}
}
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll x,k;cin>>x>>k;
vector<ll> r(k+1);r[0]=0;for(ll i=1;i<=k;i++)cin>>r[i];
ll d[k],u[k],da[k],ua[k];
d[0]=0;
da[0]=0;
u[0]=x;
ua[0]=x;
for(ll i=1;i<=k;i++){
ll t=r[i]-r[i-1];
//cout<<t<<endl;
if(i%2==0){
if(da[i-1]+t>=x){
d[i]=x;
da[i]=x;
u[i]=x;
ua[i]=x;
}
else{
da[i]=da[i-1]+t;
d[i]=d[i-1];
ua[i]=ua[i-1]+t;
u[i]=u[i-1];
if(ua[i]>=x){
u[i]=u[i-1]-(ua[i]-x);
ua[i]=x;
}
}
}
else{
if(ua[i-1]-t<=0){
d[i]=0;
da[i]=0;
u[i]=0;
ua[i]=0;
}
else{
da[i]=da[i-1]-t;
d[i]=d[i-1];
ua[i]=ua[i-1]-t;
u[i]=u[i-1];
if(da[i]<=0){
d[i]=d[i]-da[i];
da[i]=0;
}
}
}
}
for(ll i=0;i<=k;i++){
//cout<<d[i]<<" "<<da[i]<<" "<<u[i]<<" "<<ua[i]<<endl;
}//return 0;
ll q;cin>>q;
for(ll i=0;i<q;i++){
ll t,a;cin>>t>>a;
ll e=upper_bound(r.begin(),r.end(),t)-r.begin();
ll now;
if(a<=d[e-1])now=da[e-1];
else if(a>=u[e-1])now=ua[e-1];
else now=a-d[e-1]+da[e-1];
if(e%2==1){
now-=t-r[e-1];
now=max((ll)0,now);
}
else{
now+=t-r[e-1];
now=min(x,now);
}
cout<<now<<endl;
}
}
|
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int X, K, Q, v[100009], t[100009], a[100009], ans[100009]; vector<int> g[100009];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cin >> X >> K; K++;
for (int i = 1; i < K; i++) cin >> v[i];
cin >> Q;
for (int i = 0; i < Q; i++) {
cin >> t[i] >> a[i];
g[lower_bound(v, v + K, t[i] + 1) - v - 1].push_back(i);
}
int l = 0, r = X, e = 0;
for (int i = 0; i < K; i++) {
for (int j : g[i]) {
int val = (a[j] < l ? e : (a[j] > r ? e + r - l : e + a[j] - l));
ans[j] = (i & 1 ? min(X, val + t[j] - v[i]) : max(0, val - t[j] + v[i]));
}
if (i & 1) {
e += v[i + 1] - v[i];
if (e + r - l > X) {
r -= e + r - l - X;
if (r < l) r = l;
e = X - r + l;
}
}
else {
e -= v[i + 1] - v[i];
if (e < 0) {
l -= e; e = 0;
if (l > r) l = r;
}
}
}
for (int i = 0; i < Q; i++) cout << ans[i] << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main(){
LL x, k;
cin >> x >> k;
LL r[k];
for(int i = 0; i < k; i++) cin >> r[i];
LL q;
cin >> q;
vector<LL> t;
vector<LL> a;
for(int i = 0; i < q; i++){
LL p, r;
cin >> p >> r;
t.push_back(p);
a.push_back(r);
}
LL minv = 0;
LL maxv = x;
LL dx = 0;
LL sgn = -1;
LL s1 = 0;
LL s2 = 0;
LL lastt = 0;
while(s2 < t.size()){
if(s1 == k || t[s2] < r[s1]){
// answer
LL f = max(minv, min(maxv, a[s2] + dx));
f += sgn*(t[s2] - lastt);
f = max(0LL, min(x, f));
cout << f << endl;
s2++;
} else {
LL diff = r[s1] - lastt;
diff *= sgn;
minv += diff;
maxv += diff;
dx += diff;
minv = max(0LL, min(x, minv));
maxv = max(0LL, min(x, maxv));
sgn *= -1;
lastt = r[s1];
s1++;
//cout << minv << " " << maxv << " " << dx << " " << sgn << endl;
}
}
}
|
#include "bits/stdc++.h"
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
int main() {
int X;cin>>X;
int K;cin>>K;
vector<int>rs(K+1);
vector<int>as(K+1),bs(K+1,X);
int pre=0;
int a=0;
int b=0;
for (int i = 0; i < K; ++i) {
cin>>rs[i+1];
}
vector<int>mins(K+1);
vector<int>maxs(K+1,X);
for (int i = 0; i < K; ++i) {
int sa = rs[i+1]-rs[i];
if (i % 2 == 0) {
mins[i + 1] = max(0, mins[i] - sa);
maxs[i+1]=max(0,maxs[i]-sa) ;
}
else {
maxs[i + 1] = min(X, maxs[i] + sa);
mins[i+1]=min(X,mins[i]+sa);
}
}
for (int i = 0; i < K; ++i) {
int sa = rs[i + 1] - rs[i];
if (i % 2 == 0) {
int yoyuu=mins[i];
as[i+1]=as[i]+max(0,sa-yoyuu);
bs[i+1]=bs[i];
as[i+1]=min(as[i+1],bs[i+1]);
}
else {
int yoyuu=X-maxs[i];
as[i+1]=as[i];
bs[i + 1] = bs[i]-max(0,sa-yoyuu);
bs[i+1]=max(bs[i+1],as[i+1]);
}
}
int Q;cin>>Q;
while (Q--) {
int t,a;cin>>t>>a;
auto it=prev(upper_bound(rs.begin(),rs.end(),t));
int x=it-rs.begin();
int dif=t-*it;
bool flag=x%2;
int ans=-1;
int d;
if (a < as[x]) {
d=mins[x];
}
else if (a < bs[x]) {
d=mins[x]+(a-as[x]);
}
else {
d=maxs[x];
}
ans=x%2?(d+dif):(d-dif);
ans=max(0,min(X,ans));
cout<<ans<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
#define N 100009
using namespace std;
int n,a[N],b[N]; ll m;
int main(){
scanf("%lld%d",&m,&n);
int i;
for (i=1; i<=n; i++){
scanf("%d",&a[i]); b[i]=a[i]-a[i-1];
if (i&1) b[i]=-b[i];
}
int cas; scanf("%d",&cas);
ll l=0,r=m,x=0,y=m,tg=0,u,v; i=1;
while (cas--){
scanf("%lld%lld",&u,&v);
for (; i<=n && u>=a[i]; i++){
tg+=b[i]; x+=b[i]; y+=b[i];
x=min(m,max(0ll,x));
y=min(m,max(0ll,y));
r=min(r,m-tg); l=max(l,-tg);
}
if (l<=v && v<=r) v+=tg;
else v=v<l?x:y;
if (i&1) v-=u-a[i-1]; else v+=u-a[i-1];
printf("%lld\n",min(m,max(0ll,v)));
}
return 0;
}
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#define LL long long
using namespace std;
const int M=1e5+7;
int read(){
int ans=0,f=1,c=getchar();
while(c<'0'||c>'9'){if(c=='-') f=-1; c=getchar();}
while(c>='0'&&c<='9'){ans=ans*10+(c-'0'); c=getchar();}
return ans*f;
}
int ans[M],T[M];
struct pos{int T,s;}e[M];
int x,k=1,n,m,sgn=-1;
void calc(LL &k){if(k<0) k=0; if(k>x) k=x;}
int main(){
x=read();
n=read(); for(int i=1;i<=n;i++) T[i]=read();
m=read(); for(int i=1;i<=m;i++) e[i].T=read(),e[i].s=read();
LL h=0,mx=x,mn=0;
for(int i=1;i<=m;i++){
while(k<=n&&T[k]<=e[i].T){
LL v=(T[k]-T[k-1])*sgn;
mx+=v; mn+=v; h+=v;
calc(mx); calc(mn);
k++;sgn*=-1;
}//printf("[%lld %lld %lld]\n",mx,mn,h);
LL now=e[i].s+h,nowh=(e[i].T-T[k-1])*sgn; //printf("[%lld %lld]\n",now,nowh);
if(now<mn) now=mn;
if(now>mx) now=mx;
now+=nowh; calc(now);
printf("%lld\n",now);
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#define rad 334
using namespace std;
int R[100005];
int K;
int X,T,A,TI;
int Q;
int sens=-1;
int ind=0;
pair<int,int> a,b;
int main()
{
cin>>X>>K;
a.first=b.first=0;
a.second=b.second=X;
for(int i=1;i<=K;i++)cin>>R[i];
cin>>Q;
for(int i=1;i<=Q;i++)
{
cin>>T>>A;
while(ind<K&&R[ind+1]<T)
{
a.first+=sens*(R[ind+1]-TI);
a.second+=sens*(R[ind+1]-TI);
b.first+=max(0,-a.first);
b.second-=max(0,a.second-X);
a.first=max(0,a.first);a.first=min(X,a.first);
a.second=max(0,a.second);a.second=min(X,a.second);
sens*=-1;
TI=R[ind+1];
ind++;
}
a.first+=sens*(T-TI);
a.second+=sens*(T-TI);
b.first+=max(0,-a.first);
b.second-=max(0,a.second-X);
b.first=min(b.first,b.second);
a.first=max(0,a.first);a.first=min(X,a.first);
a.second=max(0,a.second);a.second=min(X,a.second);
TI=T;
cout<<min(max(A,b.first),b.second)-b.first+a.first;
cout<<"\n";
}
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int X,k,r[100010],Q;
struct node{int t,a,id;
}q[100010];int ans[100010];
bool cmp(node x,node y) {return x.t<y.t;}
int pls(int x,int y){return max(0,min(X,x+y));}
int main()
{
scanf("%d%d",&X,&k);
for (int i=1;i<=k;i++) scanf("%d",&r[i]);
scanf("%d",&Q);
for (int i=1;i<=Q;i++)
{
scanf("%d%d",&q[i].t,&q[i].a);q[i].id=i;
}
sort(q+1,q+Q+1,cmp);
int topr=0,topq=1,sum=0,down=0,up=X,add=0,js=-1;
int cnt;
while (topq<=Q)
{
if (r[topr+1]<q[topq].t&&topr<k)
{
topr++;
add=js*(r[topr]-r[topr-1]);
down=pls(down,add);up=pls(up,add);
sum+=add;js=-js;
} else
{
cnt=q[topq].t-r[topr];
ans[q[topq].id]=pls(max(down,min(up,q[topq].a+sum)),js*cnt);
topq++;
}
}
for (int i=1;i<=Q;i++) printf("%d\n",ans[i]);
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
struct opt{int t,id;}Q[N];
bool cmp(opt a,opt b){return a.t<b.t;}
int X,n,q,a[N],ans[N],pre,suf,pre_V,suf_V;
int last,sig;
int main()
{
scanf("%d%d",&X,&n);
for (int i=1;i<=n;i++) scanf("%d",&Q[i].t);
scanf("%d",&q);
for (int i=1;i<=q;i++) scanf("%d%d",&Q[n+i].t,&a[i]),Q[n+i].id=i;
sort(Q+1,Q+n+q+1,cmp);
pre=pre_V=0;suf=suf_V=X;sig=-1;
for (int i=1;i<=n+q;i++){
int d=sig*(Q[i].t-last);last=Q[i].t;
pre_V+=d;suf_V+=d;
if (pre_V<0) pre=min(pre-pre_V,X),pre_V=0;
pre_V=min(pre_V,X);
if (suf_V>X) suf=max(suf+X-suf_V,0),suf_V=X;
suf_V=max(suf_V,0);
if (pre>=suf) pre=X,suf=0;
if (Q[i].id){
int id=Q[i].id;
if (a[id]<=pre) ans[id]=pre_V;else
if (a[id]>=suf) ans[id]=suf_V;else
ans[id]=pre_V+a[id]-pre;
}
else sig=-sig;
}
for (int i=1;i<=q;i++) printf("%d\n",ans[i]);
return 0;
}
|
#include <iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int x,k;cin>>x>>k;
vector<int> r(k);
vector<int> ur(k),dr(k),us(k),ds(k);
int u=x;
int d=0;
int l=-1;
int exus=0;
int exds=0;
int ext=0;
for(int i=0;i<k;i++){
cin>>r[i];
u+=l*(r[i]-ext);
d+=l*(r[i]-ext);
if(u>x){
exus+=u-x;
u=x;
}
if(u<0){
u=0;
}
if(d<0){
exds+=-d;
d=0;
}
if(d>x){
d=x;
}
ur[i]=u;
dr[i]=d;
us[i]=exus;
ds[i]=exds;
ext=r[i];
l*=-1;
}
// for(int i=0;i<k;i++){
// cout<<ur[i]<<' '<<dr[i]<<' '<<us[i]<<' '<<ds[i]<<endl;
// }
int q;cin>>q;
for(int i=0;i<q;i++){
int t,a;cin>>t>>a;
int j=upper_bound(r.begin(),r.end(),t)-r.begin();
int extime,s;
extime=0;
s=a;
if(j){
extime=r[j-1];
s=dr[j-1]-ds[j-1]+a;
if(s<dr[j-1])s=dr[j-1];
if(s>ur[j-1])s=ur[j-1];
if(ur[j-1]==dr[j-1])s=ur[j-1];
}
s+=((j%2)*2-1)*(t-extime);
if(s>x)s=x;
if(s<0)s=0;
cout<<s<<endl;
}
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=100100;
int x,k,q,r[maxn],mx[maxn],mi[maxn],c[maxn];
int main()
{
scanf("%d%d",&x,&k);
for(int i=1;i<=k;i++)
scanf("%d",&r[i]);
mx[0]=x;
r[0]=mi[0]=c[0]=0;
for(int i=1;i<=k;i++)
{
mx[i]=mx[i-1];mi[i]=mi[i-1];
if(i&1)
{
mi[i]=max(mi[i],min(r[i]-r[i-1]-c[i-1],mx[i]));
c[i]=max(c[i-1]+mi[i-1]-r[i]+r[i-1],0)-mi[i];
}
else
{
mx[i]=min(mx[i],max(x-r[i]+r[i-1]-c[i-1],mi[i]));
c[i]=min(c[i-1]+mx[i-1]+r[i]-r[i-1],x)-mx[i];
}
//cout<<mi[i]<<' '<<mx[i]<<' '<<c[i]<<endl;
}
scanf("%d",&q);
for(int i=1;i<=q;i++)
{
int t,a;
scanf("%d%d",&t,&a);
int pl=upper_bound(r+1,r+k+1,t)-r-1,ans=c[pl];
//cout<<"pl:"<<pl<<endl;
if(a<=mi[pl]) ans+=mi[pl];
else if(a>=mx[pl]) ans+=mx[pl];
else ans+=a;
if(pl&1) ans=min(x,ans+t-r[pl]);
else ans=max(0,ans-t+r[pl]);
printf("%d\n",ans);
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int maxn=100010;
int a[maxn];
int main()
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int i,j,X,K,Q;
cin>>X>>K;
for(i=1; i<=K; i++)
cin>>a[i];
int L,R=X;
int cnt=0,k=0,s=-1,x=0,ans,num;
int t,A;
cin>>Q;
for(i=1; i<=Q; i++)
{
cin>>t>>A;
while(k<K&&a[k+1]<=t)
{
ans=s*(a[k+1]-cnt);
L=max(0,min(X,L+ans));
R=max(0,min(X,R+ans));
cnt=a[k+1];
s=-s;
x+=ans;
k++;
}
num=t-cnt;
A=max(L,min(R,A+x));
A=max(0,min(X,A+s*num));
cout<<A<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
const int MX = 100005;
int x, k, r[MX], q, t, a;
struct Sand{int xl, xr, yl, yr;} sd[MX][18];
int calc(Sand& a, int x){return min(a.yr, a.yl + max(0,x-a.xl));}
int rcalc(Sand& a, int y){return min(a.xr, a.xl + max(0,y-a.yl));}
Sand merge(Sand& a, Sand& b){
int ml = max(b.xl,a.yl), mr = min(b.xr,a.yr);
return (Sand){rcalc(a,ml),rcalc(a,mr),calc(b,ml),calc(b,mr)};
}
int main(){
scanf("%d%d", &x, &k);
rep(i,k){
scanf("%d", r+i+1);
int dr = r[i+1] - r[i];
if(i&1) sd[i][0] = (Sand){0,max(0,x-dr),min(x,dr),x};
else sd[i][0] = (Sand){min(x,dr),x,0,max(0,x-dr)};
}
for(int j = 1; j < 18; j++) rep(i,k) if(i + (1<<j) <= k){
sd[i][j] = merge(sd[i][j-1],sd[i+(1<<(j-1))][j-1]);
}
scanf("%d", &q);
rep(i,q){
scanf("%d%d", &t, &a);
int it = (int)(upper_bound(r,r+k+1,t) - r)-1, c = 0;
for(int j = 0; it >> j; j++) if(it>>j&1){
a = calc(sd[c][j],a);
c += 1 << j;
}
if(it&1) a = min(x,a+t-r[it]);
else a = max(0,a-(t-r[it]));
printf("%d\n", a);
}
}
|
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
int r[200000];
ll a[200000],b[200000],c[200000];
int main(){
ll x,k;scanf("%lld%lld",&x,&k);
rep(i,k)scanf("%d",&r[i+1]);
c[0]=x;
rep(i,k){
int s=r[i+1]-r[i];
if(i%2==0)s=-s;
a[i+1]=min(max(a[i]+s,0LL),x);
b[i+1]=b[i]+s;
c[i+1]=min(max(c[i]+s,0LL),x);
}
int q;scanf("%d",&q);
rep(i,q){
int t,d;scanf("%d%d",&t,&d);
int j=upper_bound(r,r+k+1,t)-r-1;
int s=t-r[j];
if(j%2==0)s=-s;
ll na=min(max(a[j]+s,0LL),x);
ll nb=b[j]+s;
ll nc=min(max(c[j]+s,0LL),x);
printf("%lld\n",min(max(nb+d,na),nc));
}
}
|
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
inline int read()
{
int x;char c;
while((c=getchar())<'0'||c>'9');
for(x=c-'0';(c=getchar())>='0'&&c<='9';)x=x*10+c-'0';
return x;
}
#define MN 100000
int r[MN+5],t[MN+5],a[MN+5],s[MN+5],sl,sr,f[MN+5];
vector<int> v[MN+5];
bool cmp(int x,int y){return a[x]<a[y];}
int gf(int k){return f[k]?f[k]=gf(f[k]):k;}
int main()
{
int x,k,q,i,j,ss=0;
x=read();k=read();
for(i=1;i<=k;++i)r[i]=read();
q=read();
for(i=1;i<=q;++i)
{
t[i]=read();a[i]=read();s[i]=i;
v[upper_bound(r+1,r+k+1,t[i])-r-1].push_back(i);
}
sort(s+(sl=1),s+(sr=q)+1,cmp);
for(i=0;i<v[0].size();++i)t[v[0][i]]=max(a[v[0][i]]-t[v[0][i]],0);
for(i=1;i<=k;++i)
if(i&1)
{
ss-=r[i]-r[i-1];
if(a[s[sl]]+ss<=0)
{
for(j=sl;j<=sr&&a[s[j]]+ss<=0;++j);
a[s[--j]]=-ss;
while(sl<j)f[s[sl++]]=s[j];
}
for(j=0;j<v[i].size();++j)
t[v[i][j]]=min(a[gf(v[i][j])]+ss+t[v[i][j]]-r[i],x);
}
else
{
ss+=r[i]-r[i-1];
if(a[s[sr]]+ss>=x)
{
for(j=sr;j>=sl&&a[s[j]]+ss>=x;--j);
a[s[++j]]=x-ss;
while(sr>j)f[s[sr--]]=s[j];
}
for(j=0;j<v[i].size();++j)
t[v[i][j]]=max(a[gf(v[i][j])]+ss-t[v[i][j]]+r[i],0);
}
for(i=1;i<=q;++i)printf("%d\n",t[i]);
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
struct Info{ int s, e, x, y; };
int n, A, t[N], q;
Info a[N];
int main(){
scanf("%d%d", &A, &n);
a[0] = {0, A, 0, 0};
for(int i = 1; i <= n; i++){
scanf("%d", t + i);
int dt = t[i] - t[i - 1];
auto &p = a[i - 1];
int ns = p.s, ne = p.e;
if(~i & 1){ ns += dt; ne += dt; }
else{ ns -= dt; ne -= dt; }
if(ns >= A) a[i] = {A, A, 0, A};
else if(ne > A) a[i] = {ns, A, p.x, p.y + ne - A};
else if(ne <= 0) a[i] = {0, 0, A, 0};
else if(ns < 0) a[i] = {0, ne, p.x - ns, p.y};
else a[i] = {ns, ne, p.x, p.y};
}
scanf("%d", &q);
for(int x, y, z; q--; ){
scanf("%d%d", &x, &y);
z = int(upper_bound(t, t + n + 1, x) - t - 1);
y = max(a[z].s, min(a[z].e, a[z].s + y - a[z].x));
if(z & 1) y = min(A, y + x - t[z]);
else y = max(0, y - x + t[z]);
printf("%d\n", y);
}
}
|
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=100010;
int n,m,a[maxn];
int calc(int l,int r,int x){
return max(l,min(r,x));
}
int main(){
int X;
scanf("%d%d",&X,&n);
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
int L,R=X;//
int t=0,k=0,s=-1,x=0;
int time,A;
scanf("%d",&m);
for(int i=1;i<=m;i++){
scanf("%d%d",&time,&A);
while(k<n && a[k+1]<=time){
int dif=s*(a[k+1]-t);
L = calc(0,X,L+dif);
R = calc(0,X,R+dif);
s*=-1;
x+=dif;
t=a[k+1];
k++;
}
int T=time-t;
A=calc(L,R,A+x);
A=calc(0,X,A+s*T);
printf("%d\n",A);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
ll x, k, q;
ll r[maxn];
ll t[maxn], a[maxn];
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin>>x;
cin>>k;
for (int i=0; i<k; i++) {
cin>>r[i];
}
cin>>q;
for (int i=0; i<q; i++) {
cin>>t[i]>>a[i];
}
auto bound = [&](ll val, ll l, ll r) {
val = min(val, r);
val = max(l, val);
return val;
};
int ri=0;
ll sgn = -1;
ll lo = 0;
ll hi = x;
ll dx = 0;
ll last = 0;
for (int qi=0; qi<q; ) {
if (ri==k || t[qi] < r[ri]) {
ll res = bound(dx+a[qi], lo, hi);
res += sgn*(t[qi]-last);
res = bound(res, 0, x);
cout<<res<<"\n";
qi++;
} else {
ll dr = sgn*(r[ri]-last);
lo = bound(lo+dr, 0, x);
hi = bound(hi+dr, 0, x);
dx += dr;
last = r[ri];
ri++;
sgn = -sgn;
}
}
return 0;
}
|
//
#include<bits/stdc++.h>
#define mod 1000000007
#define sp ' '
#define intmax 2147483647
#define llmax 9223372036854775807
#define nyan "(=^･ω･^=)"
#define mkp make_pair
#define lP pair<ll, ll>
#define iP pair<int,int>
using namespace std;
typedef long long ll;
int X, K, A[100002], Q, t, a, p, q, l, r, L, R;
int main() {
cin >> X >> K;
for (int i = 1; i != K + 1; ++i)
cin >> A[i];
A[K + 1] = intmax;
cin >> Q;
r = X;
R = X;
while (Q--) {
cin >> t >> a;
for (; p != K + 1; ++p) {
if (A[p + 1] >= t) {
int res;
if (p & 1) {
if (a < l) {
res = L + t - A[p];
}
else if (a <= r)
res = a + q + t - A[p];
else
res = R + t - A[p];
res = min(res, X);
}
else {
if (a < l) {
res = L - t + A[p];
}
else if (a <= r)
res = a + q - t + A[p];
else
res = R - t + A[p];
res = max(res, 0);
}
cout << res << endl;
break;
}
if (p & 1) {
L += A[p + 1] - A[p];
q += A[p + 1] - A[p];
R += A[p + 1] - A[p];
L = min(L, X);
R = min(R, X);
r = min(r, X - q);
}
else {
L -= A[p + 1] - A[p];
q -= A[p + 1] - A[p];
R -= A[p + 1] - A[p];
L = max(L, 0);
R = max(R, 0);
l = max(l, -q);
}
}
}
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int X,K;
vector<pair<int,int> >A;
int main()
{
cin>>X>>K;
for(int i=0;i<K;i++)
{
int r;cin>>r;A.push_back(make_pair(r,-1));
}
int Q;cin>>Q;
for(int i=0;i<Q;i++)
{
int t,a;cin>>t>>a;
A.push_back(make_pair(t,a));
}
sort(A.begin(),A.end());
int pre=0,d=1;
int L=0,R=X,AA=0;
for(pair<int,int>p:A)
{
if(p.second<0)
{
int t=p.first-pre;
pre=p.first;
if(d>0)
{
AA-=t;
if(L+AA<0)
{
L=-AA;
}
if(L>R)R=L;
}
else
{
AA+=t;
if(R+AA>X)
{
R=X-AA;
}
if(L>R)L=R;
}
d*=-1;
}
else
{
int a=p.second;
if(a<L)a=L;
else if(a>R)a=R;
a+=AA;
int t=p.first-pre;
cout<<(d>0?max(0,a-t):min(a+t,X))<<endl;
}
}
}
|
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int x,k,r[100050],s[100050],o[100050],w[100050],q,t,a;
int main(){
scanf("%d%d",&x,&k);
int i,j,v=-1;
r[0]=o[0]=w[0]=0;
s[0]=x;
for(i=1;i<=k;i++){
scanf("%d",&r[i]);
int d=(r[i]-r[i-1])*v;
w[i]=min(max(w[i-1]+d,0),x);
s[i]=max(min(s[i-1]+d,x),0);
o[i]=min(o[i-1]-min(0,w[i-1]+d),x);
v*=-1;
}
i=0;
scanf("%d",&q);
while(q--){
scanf("%d%d",&t,&a);
if(t>=r[k]) i=k;
else{
int n=k;
while(i<n-1){
int c=i+(n-i)/2;
if(r[c]<t) i=c;
else n=c;
}
}
int ans=min(w[i]+max(a-o[i],0),s[i])+(t-r[i])*((i%2)*2-1);
printf("%d\n",min(max(ans,0),x));
}
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int x,k,r[100005],t,num;
inline int read()
{int x=0;
char c=getchar();
while (c<'0'||c>'9') c=getchar();
while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x;
}
int main (){
int i,j,q;
x=read();k=read();
for (i=1;i<=k;i++)
{r[i]=read();}
int a,minn=0,maxn=x,pos=1,ansmin=0,ansmax=x,num=0;
q=read();
while (q--)
{t=read();a=read();
while (pos<=k&&r[pos]<t)
{ansmin-=(r[pos]-r[pos-1]);
if (ansmin<0) ansmin=0;
ansmin=x-ansmin;
ansmax-=(r[pos]-r[pos-1]);
if (ansmax<0) ansmax=0;
ansmax=x-ansmax;
if (pos&1) {num-=(r[pos]-r[pos-1]);}
else {num+=(r[pos]-r[pos-1]);}
if (num<0) {minn=max(minn,-num);}
if (num>0) {maxn=min(maxn,x-num);}
pos++;
}
//printf ("%d %d\n",ansmin,ansmax);
int tpans;
if (a<=minn) {tpans=ansmin;}
if (a>=maxn) {tpans=ansmax;}
if (a>minn&&a<maxn) {tpans=ansmin+(a-minn)*((ansmin>ansmax)?-1:1);}
tpans-=(t-r[pos-1]);
if (tpans<0) tpans=0;
if ((pos-1)&1) {tpans=x-tpans;}
printf ("%d\n",tpans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define REV(i,n) for(ll (i) = (n) - 1;(i) >= 0;--i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {REP(WW,n)cerr << v[WW] << ' ';cerr << endl << endl;}
#define SHOW2d(v,WW,HH) {REP(W_,WW){REP(H_,HH)cerr << v[W_][H_] << ' ';cerr << endl;}cerr << endl;}
#define ALL(v) v.begin(),v.end()
#define Decimal fixed<<setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
#define MOD 1000000007
typedef int ll;
typedef pair<ll,ll> P;
int main(){
ll X,K,Q;cin >> X >> K;
vector<pair<ll,ll>> v;
REP(i,K){
ll r;cin >> r;
v.EB(r,-1);
}
cin >> Q;
REP(i,Q){
ll a, b;cin >> a >> b;
v.EB(a,b);
}
sort(ALL(v));
ll minX = 0;
ll minY = 0;
ll maxX = X;
ll maxY = X;
ll type = -1;
ll nowT = 0;
REP(i,v.size()){
minY += type * (v[i].FI - nowT);
if(minY < 0){
minX -= minY;
minY = 0;
}
if(minY > X)minY = X;
maxY += type * (v[i].FI - nowT);
if(maxY > X){
maxX -= (maxY - X);
maxY = X;
}
if(maxY < 0)maxY = 0;
maxX = max(maxX,minX);
if(v[i].SE == -1)type = -type;
else {
if(v[i].SE <= minX){
cout << minY << endl;
}
else if(v[i].SE < maxX){
cout << minY + (v[i].SE - minX) << endl;
}
else {
cout << maxY << endl;
}
}
nowT = v[i].FI;
}
return 0;
}
|
#include <bits/stdc++.h>
//#include <math.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.14159265358979323846
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> PP;
struct edge {
int to, cost;
edge(int t,int c):to(t),cost(c) {}
};
int dx[]={1,-1,0,0},dy[]={0,0,1,-1};
//-----------------------------------------------------------------------------
int X,A[100000],R[100000],T[100000];
int K,Q;
int dir=-1,l,u,m;
int t,dif,j;
void calc(int tmp) {
t+=abs(tmp),dif+=tmp;
l=max(0,min(X,l+tmp));
u=max(0,min(X,u+tmp));
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin>>X>>K;
REP(i,K) cin>>R[i];
cin>>Q;
REP(i,Q) cin>>T[i]>>A[i];
u=X;
REP(i,Q) {
while(j<K&&R[j]<T[i]) calc((R[j++]-t)*dir),dir=-dir;
calc((T[i]-t)*dir);
cout<<max(l,min(u,A[i]+dif))<<endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
inline int getint()
{
static char c;
while ((c = getchar()) < '0' || c > '9');
int res = c - '0';
while ((c = getchar()) >= '0' && c <= '9')
res = res * 10 + c - '0';
return res;
}
const int MaxM = 100000;
const int MaxN = 100000;
int x, m, n;
int rev[MaxM + 1];
int l, r, c;
inline void update(int delta)
{
c += delta;
if (l > x - c)
l = r = x - c;
else
r = min(x - c, r);
if (r < -c)
l = r = -c;
else
l = max(l, -c);
}
int main()
{
cin >> x >> m, r = x;
for (int i = 1; i <= m; ++i)
rev[i] = getint();
cin >> n;
int d = 0, k = 1, coef = -1;
for (int i = 1; i <= n; ++i)
{
int t = getint(), a = getint();
while (k <= m && rev[k] <= t)
{
update(coef * (rev[k] - d));
d = rev[k++];
coef = -coef;
}
update(coef * (t - d)), d = t;
if (a <= l)
printf("%d\n", l + c);
else if (a <= r)
printf("%d\n", a + c);
else
printf("%d\n", r + c);
}
return 0;
}
|
#include<iostream>
#define m(a) min(X,max(0,a))
using namespace std;
int r[200000],X,K,Q,T,A,s,l,k,t,x,d,f=-1;
int main()
{
cin>>X>>K;
for(;l<K;)cin>>r[l++];
l = X;
for(cin >> Q; Q--;cout << m(min(l, max(s, A + x)) + f * (T-t)) << endl)
for(cin >> T >> A; k<K&T>=r[k]; f *= -1)
x += d=f*(r[k]-t),
s=m(s+d),
l=m(l+d),
t = r[k++];
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cassert>
#include <cctype>
using namespace std;
typedef long long lint;
#define cout cerr
#define ni (next_num<int>())
template<class T>inline T next_num(){
T i=0;char c;
while(!isdigit(c=getchar())&&c!='-');
bool flag=c=='-';
flag?c=getchar():0;
while(i=i*10-'0'+c,isdigit(c=getchar()));
return flag?-i:i;
}
template<class T1,class T2>inline void apmax(T1 &a,const T2 &b){if(a<b)a=b;}
template<class T1,class T2>inline void apmin(T1 &a,const T2 &b){if(b<a)a=b;}
const int N=100010;
int lim;
int r[N];
int lb,hb;
int tim=0;
lint mn=0,cur=0,mx=0;
inline int go(int x,int d,int t){
return max(0ll,min((lint)lim,(lint)d*t+x));
}
inline void workto(int d,int t){
int del=t-tim;
tim=t;
lb=go(lb,d,del),hb=go(hb,d,del);
cur+=(lint)d*del;
apmin(mn,cur);
apmax(mx,cur);
}
inline int ask(int x){
if(x<=-mn)return lb;
else if(x>=lim-mx)return hb;
else return x+cur;
}
int main(){
lb=0,lim=hb=ni;
int n=ni;
r[0]=0;
for(int i=1;i<=n;i++){
r[i]=ni;
}
int d=-1;
for(int i=1,tot=ni;tot--;){
int tim=ni;
for(;i<=n&&r[i]<=tim;workto(d,r[i]),d=-d,i++);
workto(d,tim);
printf("%d\n",ask(ni));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int x,k,q,t,a,mx[100005],mn[100005],dt[100005],rv[100005],ans;
int main()
{
scanf("%d%d",&x,&k);mx[0]=x;mn[0]=0;dt[0]=0;
for(int i=1;i<=k;i++) scanf("%d",&rv[i]);
for(int i=1;i<=k;i++)
{
mx[i]=mx[i-1];mn[i]=mn[i-1];int tmp=rv[i]-rv[i-1];
if(i&1) mn[i]=max(mn[i],min(mx[i],tmp-dt[i-1])),dt[i]=max(mn[i-1]+dt[i-1]-tmp,0)-mn[i];
else mx[i]=min(mx[i],max(mn[i],x-tmp-dt[i-1])),dt[i]=min(mx[i-1]+dt[i-1]+tmp,x)-mx[i];
}
for(scanf("%d",&q);q--;printf("%d\n",ans))
{
scanf("%d%d",&t,&a);int pos=upper_bound(rv+1,rv+k+1,t)-rv-1;
if(a<=mn[pos]) a=mn[pos];else if(a>=mx[pos]) a=mx[pos];
ans=a+dt[pos];int tmp=t-rv[pos];
if(pos&1) ans=min(x,ans+tmp);else ans=max(0,ans-tmp);
}
}
|
#include<bits/stdc++.h>
int X,k,q;
struct ev{
int x,y,id;
bool operator<(const ev&e)const{return x<e.x;}
}e[300007];
int ep=0,as[300007];
int main(){
scanf("%d%d",&X,&k);
for(int i=0,a;i<k;++i){
scanf("%d",&a);
e[ep++]=(ev){a,0,0};
}
scanf("%d",&q);
for(int i=1,a,b;i<=q;++i){
scanf("%d%d",&a,&b);
e[ep++]=(ev){a,b,i};
}
std::sort(e,e+ep);
long long mn=0,mx=X,a=0;
for(int i=0,sgn=-1,t0=0;i<ep;++i){
int v0=(e[i].x-t0)*sgn;
if(e[i].id){
long long v=e[i].y+a;
if(v<mn)v=mn;
if(v>mx)v=mx;
v+=v0;
if(v<0)v=0;
if(v>X)v=X;
as[e[i].id]=v;
}else{
mn+=v0,mx+=v0,a+=v0;
if(mn<0)mn=0;
if(mx<0)mx=0;
if(mn>X)mn=X;
if(mx>X)mx=X;
t0=e[i].x;
sgn*=-1;
}
}
for(int i=1;i<=q;++i)printf("%d\n",as[i]);
return 0;
}
|
#include<iostream>
#define DIM 100005
using namespace std;
int x, n, q, t, val, sol, u, i, sum;
int v[DIM], a[DIM], amax[DIM], vmin[DIM];
int main(){
cin>> x >> n;
for(i = 1; i <= n; i++){
cin>> v[i];
}
amax[0] = x;
for(i = 1; i <= n; i++){
if(i % 2 == 1){
a[i] = max(0, a[i - 1] - (v[i] - v[i - 1]) );
amax[i] = max(0, amax[i - 1] - (v[i] - v[i - 1]) );
sum -= v[i] - v[i - 1];
}
else{
a[i] = min(x, a[i - 1] + v[i] - v[i - 1]);
amax[i] = min(x, amax[i - 1] + v[i] - v[i - 1]);
sum += v[i] - v[i - 1];
}
vmin[i] = min(vmin[i - 1], sum);
}
v[n + 1] = 1000000001;
u = 0;
cin>> q;
for(; q; q--){
cin>> t >> val;
while(v[u + 1] <= t){
u++;
}
sol = min(a[u] + max(0, val + vmin[u]), amax[u]);
if(u % 2 == 1){
sol = min(x, sol + t - v[u]);
}
else{
sol = max(0, sol - (t - v[u]) );
}
cout<< sol <<"\n";
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define MN 100005
int t,r[MN],a,v[MN],x,n,q;
int main(){
cin>>x>>n;
for(int i=1;i<=n;++i)scanf("%d",r+i);
for(int i=1;i<=n;++i)v[i]=r[i]-r[i-1];
cin>>q;int tl=0,h=x,l=0,hv=x,lv=0;r[n+1]=v[n+1]=1000000008;
while(q--){
scanf("%d%d",&t,&a);
while(r[tl+1]<=t){
if((++tl)&1){
if(lv<v[tl])l+=v[tl]-lv;
hv=max(0,hv-v[tl]);
lv=max(0,lv-v[tl]);
}else{
if(hv+v[tl]>x)h-=v[tl]+hv-x;
hv=min(x,hv+v[tl]);
lv=min(x,lv+v[tl]);
}
h=max(0,h);l=min(l,x);
}t-=r[tl];
if(l>=a)a=lv;else if(h<=a)a=hv;else a+=lv-l;
if(tl&1)printf("%d\n",min(x,a+t));else printf("%d\n",max(0,a-t));
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int r[1000100];
int main()
{//freopen("in.txt","r",stdin);
int x,n;scanf("%d%d",&x,&n);
for (int i=1;i<=n;i++) scanf("%d",&r[i]);
int q,now=1,p=-1,low=x,high=0,ad=0;scanf("%d",&q);
while (q--)
{
int t,a;scanf("%d%d",&t,&a);
while ((now<=n)&&(t>=r[now]))
{
int dlt=p*(r[now]-r[now-1]);
ad+=dlt;low=min(x,max(dlt+low,0));high=min(x,max(dlt+high,0));
now++;p*=-1;
}
printf("%d\n",min(x,max(0,min(low,max(high,a+ad))+p*(t-r[now-1]))));
}
}
|
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main(){
int X, K, Q;
int r[100010];
cin >> X;
cin >> K;
for(int i = 0; i < K; i++) cin >> r[i];
cin >> Q;
r[K] = 1e9 + 1;
int x, y, z;
int t, a;
int tim = 0, dir = 1, rin = 0;
x = 0; y = X; z = 0;
for(int i = 0; i < Q; i++){
cin >> t >> a;
while(1){
int tt = min(r[rin], t);
if(dir == 1){
z = max(z-(tt - tim), -X);
x = max(x, -z);
y = max(x, y);
}
else{
z = min(z+(tt - tim), X);
y = min(y, X-z);
x = min(x, y);
}
if(tt == r[rin]){
tim = r[rin++];
dir = 1 - dir;
}
if(tt == t){
tim = t;
break;
}
}
if(a <= x) cout << max(0, min(x + z, X)) << endl;
else if(a >= y) cout << max(0, min(y + z, X)) << endl;
else cout << max(0, min(a + z, X)) << endl;
//cout << x << " " << y << " " << z << endl;
//cout << dir << endl;
}
return 0;
}
|
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5+50;
typedef long long ll;
int r[maxn];
int x,k,q,t,a;
int sgn=-1;
int pos=1,und,ds;
ll mx,mn,all;
void cal(ll &y)
{
if(y<0)
y=0;
if(y>x)
y=x;
}
void solve()
{
while(r[pos]<=t&&pos<=k)
{
ll ds=(r[pos]-r[pos-1])*sgn;
mx+=ds;
mn+=ds;
all+=ds;
cal(mx);
cal(mn);
pos++;
sgn*=-1;
//cout << all << endl;
}
ll ans=a+all;
if(ans>mx)
ans=mx;
if(ans<mn)
ans=mn;
ll temp=(t-r[pos-1])*sgn;
ans+=temp;
cal(ans);
printf("%lld\n",ans);
}
int main()
{
//ios::sync_with_stdio(false);
scanf("%d%d",&x,&k);
for(int i=1; i<=k; i++)
{
scanf("%d",&r[i]);
//cin>>r[i];
}
pos=1;
mx=x,mn=0,all=0;
sgn=-1;
r[0]=0;
scanf("%d",&q);
while(q--)
{
//cin>>t>>a;
scanf("%d%d",&t,&a);
solve();
}
//cout << "Hello world!" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
int x;cin >> x;
int k;cin >> k;
vector<int> r, a, b, c;
r.push_back(0);
a.push_back(0);
b.push_back(x);
c.push_back(0);
for(int i=0;i<k;i++){
int rr;cin >> rr;
int d = rr-r[i];
int aa, bb, cc;
if(i%2 == 0){
aa = min(b[i], a[i] + max(0, 0-(c[i]-d)));
bb = b[i];
cc = max(0, c[i]-d);
}else{
aa = a[i];
bb = max(a[i], b[i] - max(0, c[i]+(b[i]-a[i])+d-x));
cc = min(x, c[i]+d);
}
r.push_back(rr);
a.push_back(aa);
b.push_back(bb);
c.push_back(cc);
}
int q;cin >> q;
for(int i=0;i<q;i++){
int t, aa;cin >> t >> aa;
int j = int(upper_bound(r.begin(), r.end(), t) - r.begin()) - 1;
int d = t-r[j];
int f;
if(aa <= a[j]){
f = c[j];
}else if(aa <= b[j]){
f = c[j] + (aa - a[j]);
}else{
f = c[j] + (b[j]-a[j]);
}
if(j%2 == 0){
cout << max(0, f-d) << endl;
}else{
cout << min(x, f+d) << endl;
}
}
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll x;
ll r[100005]={0};
ll fun(ll t,ll low,ll high)
{
if(t<low)return low;
if(t>high)return high;
return t;
}
int main()
{
int q,k;
scanf("%lld%d",&x,&k);
for(int i=1;i<=k;i++)
scanf("%lld",&r[i]);
scanf("%d",&q);
ll l=0,h=x;
ll add=0;
int now=1;
int flag=-1;
while(q--)
{
ll tt,a;
scanf("%lld%lld",&tt,&a);
while(tt>=r[now]&&now<=k)
{
ll xx=flag*(r[now]-r[now-1]);
add=add+xx;
h=fun(h+xx,0,x);
l=fun(l+xx,0,x);
flag=-1*flag;
now++;
}
ll ans=fun(add+a,l,h);
ans=fun(ans+flag*(tt-r[now-1]),0,x);
printf("%lld\n",ans);
}
return 0;
}
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#define LL long long
using namespace std;
const int M=1e5+7;
int read(){
int ans=0,f=1,c=getchar();
while(c<'0'||c>'9'){if(c=='-') f=-1; c=getchar();}
while(c>='0'&&c<='9'){ans=ans*10+(c-'0'); c=getchar();}
return ans*f;
}
int ans[M],T[M];
struct pos{int T,s;}e[M];
int x,k=1,n,m,sgn=-1;
void calc(LL &k){if(k<0) k=0; if(k>x) k=x;}
int main(){
x=read();
n=read(); for(int i=1;i<=n;i++) T[i]=read();
m=read(); for(int i=1;i<=m;i++) e[i].T=read(),e[i].s=read();
LL h=0,mx=x,mn=0;
for(int i=1;i<=m;i++){
while(k<=n&&T[k]<=e[i].T){
LL v=(T[k]-T[k-1])*sgn;
mx+=v; mn+=v; h+=v;
calc(mx); calc(mn);
k++;sgn*=-1;
}
LL now=e[i].s+h,nowh=(e[i].T-T[k-1])*sgn;
if(now<mn) now=mn;
if(now>mx) now=mx;
now+=nowh; calc(now);
printf("%lld\n",now);
}
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
#define INF 10000000000LL
using namespace std;
typedef long long ll;
ll X, K, R[200000], Q, T[200000], A[200000];
int main(void) {
cin >> X >> K;
R[0] = 0;
REP(i, 1, K + 1) cin >> R[i];
R[K + 1] = INF;
cin >> Q;
REP(i, 0, Q) cin >> T[i] >> A[i];
ll lower = 0;
ll upper = X;
ll sum = 0;
ll k = 0;
REP(i, 0, K + 1) {
if(i > 0) {
lower = X - max(lower - (R[i] - R[i - 1]), 0LL);
upper = X - max(upper - (R[i] - R[i - 1]), 0LL);
swap(lower, upper);
}
sum += (i % 2 == 0 ? 1 : -1) * (R[i] - R[i - 1]);
while(k < Q && R[i] <= T[k] && T[k] <= R[i + 1]) {
ll a = i % 2 == 0 ? A[k] + sum : X - A[k] - sum;
if(a <= lower) a = lower;
if(a >= upper) a = upper;
cout << (i % 2 == 0 ? max(a - (T[k] - R[i]), 0LL) : X - max(a - (T[k] - R[i]), 0LL)) << endl;
k++;
}
}
}
|
#include<bits/stdc++.h>
#define fo(i,a,b) for(i=a;i<=b;i++)
#define fd(i,a,b) for(i=a;i>=b;i--)
#define min(a,b) (a<b?a:b)
#define max(a,b) (a>b?a:b)
typedef long long ll;
using namespace std;
inline int read(){
int n=0,f=1;char c;
for(c=getchar();(c<'0'||c>'9')&&c!='-';c=getchar());
if (c=='-') c=getchar(),f=-1;
for(;c>='0'&&c<='9';c=getchar()) n=n*10+c-48;
return n*f;
}
const int maxn=1e5+5;
int T,i,j,now,r[maxn],Q,t,x,mx,mi,c,k,ans,lami,lamx;
bool bz;
int main(){
T=read(),k=read();
fo(i,1,k) r[i]=read();
Q=read();
mi=0,mx=T,c=0;
now=1,bz=1;
for(;Q--;){
t=read(),x=read();
for(;now<=k&&t>r[now];now++,bz^=1){
int len=r[now]-r[now-1];
if (bz) lami=mi,mi=max(mi,min(mx,len-c)),c=max(0,lami+c-len)-mi;
else lamx=mx,mx=min(mx,max(mi,T-len-c)),c=min(lamx+c+len,T)-mx;
}
if (x<mi) ans=mi+c;else
if (x<=mx) ans=x+c;else
ans=mx+c;
if (bz) ans=max(0,ans-(t-r[now-1]));else
ans=min(T,ans+(t-r[now-1]));
printf("%d\n",ans);
}
}
|
#include<bits/stdc++.h>
using namespace std;
int x, k, q, t, a, low, up, jilei, kongsanjiao, now, ans, r[100007];
bool flag=0;
int cal(int tt, int lower = 0, int upper = x) {
if (tt < lower) return lower;
if (tt > upper) return upper;
return tt;
}
int main()
{
scanf("%d%d",&x,&k);
for (int i = 1; i <= k; i++) scanf("%d",&r[i]);
scanf("%d",&q);
now = 1;
low = x;
up = 0;
while (q--)
{
scanf("%d%d",&t,&a);
while (t >= r[now] && now <= k)
{
kongsanjiao = (flag ? 1 : -1) * (r[now] - r[now - 1]);
jilei += kongsanjiao;
up = cal(kongsanjiao + up);
low = cal(kongsanjiao + low);
flag = !flag;
now++;
}
ans = cal((flag ? 1 : -1) * (t - r[now - 1]) + cal(a + jilei, up, low));
printf("%d\n",ans);
}
return 0;
}
|
#include<stdio.h>
#include<queue>
#include<math.h>
#include<time.h>
#include<string.h>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<map>
#include<stack>
#define LL long long
#define mem(a,b) memset(a,b,sizeof(a))
#define lowbit(a) a&(-a)
#define PI acos(-1)
#define shortime(a) std::ios::sync_with_stdio(a);
using namespace std;
const LL inf=16777216;
//long long cmp(node a,node b){ if(a.x==b.x) return a.r>b.r;return a.x>b.x;}
int maxn (int a,int b,int c){return max(max(a,b),max(b,c));}
int judge(int x,int y,int z)
{
if(x<y) return y;
if(x>z) return z;
return x;
}
int main()
{
int x,k,a[100005];
scanf("%d%d",&x,&k);
for(int i=1;i<=k;i++)
{
scanf("%d",&a[i]);
}
int n,l=0,r=x,num=1;
scanf("%d",&n);
int flag=-1,sum=0;
for(int i=0;i<n;i++)
{
int lr,t,a1;
scanf("%d%d",&t,&a1);
while(t>=a[num]&&num<=k)
{
lr=flag*(a[num]-a[num-1]);
sum+=lr;
l=judge(lr+l,0,x);
r=judge(lr+r,0,x);
num++;
flag=-flag;
}
printf("%d\n",judge(flag*(t-a[num-1])+judge(a1+sum,l,r),0,x));
}
return 0;
}
|
#include<iostream>
#include<iomanip>
#include<vector>
#include<set>
#include<string>
#include<algorithm>
#include<math.h>
#include<queue>
#include<unordered_set>
using namespace std;
const int MAX = 100002;
const int INF = 1000000000;
int main() {
int X, K, Q;
int m[MAX], ub[MAX], lb[MAX], up[MAX], lo[MAX];
vector<int> r;
cin >> X >> K;
r.push_back(0);
for (int i = 1; i <= K; i++) {
int temp;
cin >> temp;
r.push_back(temp);
}
r.push_back(INF);
m[0] = 0;
ub[0] = X;
lb[0] = 0;
up[0] = 0;
lo[0] = 0;
bool b = true;
for (int i = 1; i < r.size(); i++) {
int td = r[i] - r[i - 1];
if (b) {
ub[i] = max(0, ub[i - 1] - td);
lb[i] = max(0, lb[i - 1] - td);
m[i] = m[i - 1] - td;
}
else {
ub[i] = min(X, ub[i - 1] + td);
lb[i] = min(X, lb[i - 1] + td);
m[i] = m[i - 1] + td;
}
up[i] = max(m[i], up[i - 1]);
lo[i] = min(m[i], lo[i - 1]);
b = !b;
}
cin >> Q;
for (int i = 0; i < Q; i++) {
int t, a;
cin >> t >> a;
vector<int>::iterator it = upper_bound(r.begin(), r.end(), t);
int index = distance(r.begin(), it) - 1;
int ans = 0;
if (a + up[index] > X) {
ans = ub[index];
}
else if (a + lo[index] < 0) {
ans = lb[index];
}
else {
ans = m[index] + a;
}
t -= r[index];
if (index & 1) {
ans = min(X, ans + t);
}
else {
ans = max(0, ans - t);
}
cout << ans << endl;
}
return 0;
}
|
#include <cstdio>
#include <algorithm>
using namespace std;
#define LL long long
#define REP(a,b,c) for(int a=b;a<=c;++a)
#define RREP(a,b,c) for(int a=b;a>=c;--a)
struct node {
int r,op,a;
}x[300000];
int ans[300000];
int n,m,tim,q,p;
int l,r,y;
int a,b,c,d;
inline bool cmp(node a,node b) {return a.r<b.r;}
int main() {
scanf("%d%d",&m,&n); y=0,l=0,r=m; d=-1;
REP(i,1,n) {scanf("%d",&a); x[++p]=(node){a,0,0};}
scanf("%d",&q); REP(i,1,q) {scanf("%d%d",&a,&b); x[++p]=(node){a,i,b};}
sort(x+1,x+p+1,cmp);
REP(i,1,p) {
if(x[i].op) {
c=d*(x[i].r-tim);
if(x[i].a<=l) c+=y;
else if(x[i].a>=r) c+=y+(r-l);
else c+=y+(x[i].a-l);
if(c<0) c=0; if(c>m) c=m; ans[x[i].op]=c;
} else {
y+=d*(x[i].r-tim); d=-d; tim=x[i].r;
if(y<0) {
if(y+(r-l)<=0) y=l=r=0;
else {l-=y,y=0;}
}
if(y+(r-l)>m) {
if(y>m) y=l=r=m;
else r=m+l-y;
}
}
} REP(i,1,q) printf("%d\n",ans[i]); return 0;
}
|
#include<bits/stdc++.h>
#define N 300005
using namespace std;
int X,n,m,q,op,ans[N];
struct node{
int t,a,num;
node(int _t=0,int _a=0,int _num=0){ t=_t,a=_a,num=_num;}
}a[N];
bool cmp(const node &p,const node &q){ return p.t<q.t||(p.t==q.t&&p.num<q.num);}
int main()
{
int i,x,y,p,l,r,v;
scanf("%d",&X);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&x),a[++m]=node(x,0,0);
scanf("%d",&q);
for(i=1;i<=q;i++)
scanf("%d %d",&x,&y),a[++m]=node(x,y,i);
sort(a+1,a+m+1,cmp);
op=-1,p=l=v=0,r=X;
for(i=1;i<=m;i++){
y=(a[i].t-p)*op;
if(a[i].num!=0){
x=a[i].a+v;
x=min(x,r);
x=max(x,l);
x+=y;
x=min(x,X);
x=max(x,0);
ans[a[i].num]=x;
}
else{
r+=y,l+=y,v+=y;
r=min(r,X),r=max(r,0);
l=min(l,X),l=max(l,0);
p=a[i].t,op=-op;
}
}
for(i=1;i<=q;i++)
printf("%d\n",ans[i]);
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
typedef long long ll;
typedef pair<int, int> pii;
#define mp make_pair
const int N = 100100;
int n;
int X;
int a[N];
int main()
{
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
scanf("%d%d", &X, &n);
n++;
for (int i = 1; i < n; i++)
scanf("%d", &a[i]);
int q;
scanf("%d", &q);
int l = 0, r = X;
int forL = 0;
int it = 0;
int z = 0;
while(q--) {
int t, w;
scanf("%d%d", &t, &w);
while(it + 1 < n && a[it + 1] <= t) {
if (z == 0) {
forL -= a[it + 1] - a[it];
} else {
forL += a[it + 1] - a[it];
}
if (forL < 0) {
l -= forL;
forL = 0;
}
if (forL + r - l > X) {
r -= forL + r - l - X;
forL = X - r + l;
}
if (l > r) {
l = r = 0;
if (forL > X)
forL = X;
}
z ^= 1;
it++;
}
t -= a[it];
if (w < l) w = l;
if (w > r) w = r;
w = forL + w - l;
if (z == 0)
w -= t;
else
w += t;
if (w < 0) w = 0;
if (w > X) w = X;
printf("%d\n", w);
}
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
a = (a<MOD)?a:(a-MOD);
b = (b<MOD)?b:(b-MOD);
a += b;
a = (a<MOD)?a:(a-MOD);
}
ll v[100100];
int main(void){
int n,q,i,j=1;
ll ans,l,r,s=0ll,a,x,t,tmpl,tmpr,d;
std::cin >> x; l = 0ll; r = x;
std::cin >> n; ++n;
for(i=1; i<n; ++i){
std::cin >> v[i];
}
v[n] = INFLL;
std::cin >> q;
for(i=0; i<q; ++i){
std::cin >> t >> a;
while(!(t<v[j])){
if(j%2){
d = (v[j-1]-v[j]);
}else{
d = (v[j]-v[j-1]);
}
if(d>=x){
l = x; r = x; s += d; l -= s; r -= s;
}else if(d<=-x){
l = 0ll; r = 0ll; s += d; l -= s; r -= s;
}else{
s += d;
tmpl = std::max(d,0ll); tmpr = std::min(x+d,x),0ll;
l = std::max(l,tmpl-s); r = std::min(r,tmpr-s);
}
if(l>r){
if(j%2){
r = l;
}else{
l = r;
}
}
// std::cout << l << " " << r << std::endl;
++j;
}
a = std::min(std::max(a,l),r);
if(j%2){
ans = std::max(a+s-(t-v[j-1]),0ll);
}else{
ans = std::min(a+s+(t-v[j-1]),x);
}
std::cout << ans << std::endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <iomanip>
using namespace std;
class Watch {
public:
explicit Watch(int X) : X(X), startA(0), curA(0), startB(X), curB(X), up(true) {}
int query(int time, int a){
int cur = calcStart_(a) + (up ? -time : time);
if(cur <= 0) return 0;
if(cur >= X) return X;
return cur;
}
int progress(int time){
if(up){
curA -= time;
curB -= time;
if(curB <= 0){
startA = startB;
curA = curB = 0;
} else if(curA <= 0){
startA -= curA;
curA = 0;
}
} else {
curA += time;
curB += time;
if(curA >= X){
startB = startA;
curA = curB = X;
} else if(curB >= X){
startB -= curB - X;
curB = X;
}
}
up = !up;
}
private:
int calcStart_(int a){
if(a <= startA) return curA;
if(a >= startB) return curB;
return curA + a - startA;
}
private:
const int X;
int startA, curA, startB, curB;
bool up;
};
int main(){
std::ios::sync_with_stdio(false);
int X, K;
while(cin >> X >> K){
vector<int> times;
times.push_back(0);
for(int i=0;i<K;i++){
int a; cin >> a;
times.push_back(a);
}
times.push_back(1000000007);
Watch watch(X);
int timeIdx = 0;
int Q; cin >> Q;
for(int i=0;i<Q;i++){
int t, a; cin >> t >> a;
while(t >= times[timeIdx+1]){
watch.progress(times[timeIdx+1] - times[timeIdx]);
++timeIdx;
}
cout << watch.query(t - times[timeIdx], a) << endl;
}
}
}
|
#include <iostream>
#include <cstdlib>
#include <cstdio>
using namespace std;
typedef bool boolean;
int X, n, q;
int *rs;
boolean down = true;
typedef class Data {
public:
int L, R;
int low;
Data() { }
void pass(int t, boolean down) {
if (down) {
L -= t, R -= t;
if (L < 0)
low += -L, L = 0, low = min(low, X);
if (R < 0)
R = 0;
} else {
L += t, R += t;
if (R > X)
R = X;
if (L > X)
low = X, L = X;
}
}
int getVal(int v) {
if (v < low)
return L;
if (v > low + R - L)
return R;
return L + v - low;
}
}Data;
Data d;
inline void solve() {
scanf("%d", &X);
scanf("%d", &n);
rs = new int[(n + 1)];
for (int i = 1; i <= n; i++)
scanf("%d", rs + i);
scanf("%d", &q);
int cur = 0, pr = 1, tc, tv;
d.L = 0, d.R = X, d.low = 0;
while (q--) {
scanf("%d%d", &tc, &tv);
while (pr <= n && rs[pr] <= tc) {
d.pass(rs[pr] - cur, down);
down = !down, cur = rs[pr], pr++;
}
d.pass(tc - cur, down), cur = tc;
printf("%d\n", d.getVal(tv));
}
}
int main() {
solve();
return 0;
}
|
#include <cstdio>
#include <cctype>
#include <algorithm>
#define repu(i,x,y) for (int i=x; i<=y; ++i)
using namespace std;
int n,m,a[100100],l[100100],r[100100],w[100100];
int getint()
{
char ch;
while (!isdigit(ch=getchar()));
int x=ch-'0';
for (; isdigit(ch=getchar()); x=x*10+ch-'0');
return x;
}
int main()
{
scanf("%d%d",&m,&n),r[0]=m;
repu(i,1,n)
{
int t=(a[i]=getint())-a[i-1];
if (!(i&1))
if (l[i-1]+w[i-1]+t>m)
l[i]=r[i]=m,w[i]=0;
else
l[i]=l[i-1],r[i]=min(r[i-1],m-w[i-1]-t),w[i]=w[i-1]+t;
else
if (r[i-1]+w[i-1]-t>=0)
l[i]=max(l[i-1],t-w[i-1]),r[i]=r[i-1],w[i]=w[i-1]-t;
}
for (int q=getint(),i=0; q--;)
{
int t=getint(),x=getint();
for (; i<n && a[i+1]<=t; ++i);
int ans=max(min(x+w[i],r[i]+w[i]),l[i]+w[i]);
if (i&1)
ans=min(m,ans+t-a[i]);
else
ans=max(0,ans+a[i]-t);
printf("%d\n",ans);
}
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 100010;
int a[maxn];
int main()
{
int i, j, X, K, Q;
cin >> X >> K;
for (i = 1; i <= K; i++)
cin >> a[i];
int L, R = X;
int cnt = 0, k = 0, s = -1, x = 0, ans, num;
int t, A;
cin >> Q;
for (i = 1; i <= Q; i++)
{
cin >> t >> A;
while (k < K && a[k + 1] <= t)
{
ans = s * (a[k + 1] - cnt);
L = max(0, min(X, L + ans));
R = max(0, min(X, R + ans));
cnt = a[k + 1];
s = -s;
x += ans;
k++;
}
num = t - cnt;
A = max(L, min(R, A + x));
A = max(0, min(X, A + s * num));
cout << A << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
typedef long long ll ;
#define rep(i, a, b) for (int i = a; i <= b; ++i)
using namespace std;
template <typename tn> void read (tn & a) {
tn x = 0, f = 1; char c = getchar();
while (c < '0' || c > '9') { if (c == '-') f = 0; c = getchar(); }
while (c >= '0' && c <= '9') { x = x * 10 + c - '0'; c = getchar(); }
a = f ? x : -x;
}
const int MAXN = 1e5 + 10;
int x, k, q;
int r[MAXN];
int sign, kx;
void calc (ll &k) {
if(k < 0) k = 0;
if(k > x) k = x;
}
int main () {
// freopen("in.txt","r",stdin);
read(x);
read(k);
rep(i, 1, k) read(r[i]);
read(q);
ll L = 0, R = x, kx = 1, m = 0;
sign = -1;
rep(i, 1, q) {
int a, t;
read(t);
read(a);
while (kx <= k && r[kx] <= t) {
ll vx = (r[kx] - r[kx - 1]) * sign;
R += vx;
L += vx;
m += vx;
calc(R);
calc(m);
++kx;
sign = -sign;
}
ll an = a + L;
ll hh = (t - r[kx - 1]) * sign;
// cerr<<" ] "<<kx<<" "<<i<<" "<<t<<" "<<r[kx - 1]<<"\n";
if (an < m) an = m;
if (an > R) an = R;
an += hh;
calc(an);
// cerr<<"! "<<kx<<" "<<L<<" "<<R<<" "<<m<<" "<<hh<<"\n";
printf("%lld\n", an);
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main()
{
cin.tie(0);
int x, k;
cin >> x >> k;
vector<int> rs(k);
for (auto& r : rs)
cin >> r;
rs.push_back(1e9 + 1);
int qn;
cin >> qn;
vector<pair<int, int>> qs(qn);
for (auto& q : qs) {
cin >> q.first >> q.second;
}
int lo = 0, hi = x;
int qi = 0;
int prev = 0;
int base = 0;
for (int i = 0; i < rs.size(); i++) {
// cerr << "hi: " << hi << ", lo: " << lo << ", base: " << base << endl;
int dir = i % 2 == 0 ? -1 : 1;
int r = rs[i];
while (qi < qs.size() && qs[qi].first < r) {
int t = qs[qi].first - prev;
int b = min(hi - lo, max(0, qs[qi].second - base)) + lo;
int ans = min(x, max(0, b + t * dir));
cout << ans << endl;
qi++;
}
int ma = min(x, max(0, hi + (r - prev) * dir));
int mi = min(x, max(0, lo + (r - prev) * dir));
base += (mi - (r - prev) * dir) - lo;
hi = ma;
lo = mi;
prev = r;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define REV(i,n) for(ll (i) = (n) - 1;(i) >= 0;--i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {REP(WW,n)cerr << v[WW] << ' ';cerr << endl << endl;}
#define SHOW2d(v,WW,HH) {REP(W_,WW){REP(H_,HH)cerr << v[W_][H_] << ' ';cerr << endl;}cerr << endl;}
#define ALL(v) v.begin(),v.end()
#define Decimal fixed<<setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
#define MOD 1000000007
typedef long long ll;
typedef pair<ll,ll> P;
int main(){
ll X,K,Q;cin >> X >> K;
vector<pair<ll,ll>> v;
REP(i,K){
ll r;cin >> r;
v.EB(r,-1);
}
cin >> Q;
REP(i,Q){
ll a, b;cin >> a >> b;
v.EB(a,b);
}
sort(ALL(v));
ll minX = 0;
ll minY = 0;
ll maxX = X;
ll maxY = X;
ll type = -1;
ll nowT = 0;
REP(i,v.size()){
minY += type * (v[i].FI - nowT);
if(minY < 0){
minX -= minY;
minY = 0;
}
if(minY > X)minY = X;
maxY += type * (v[i].FI - nowT);
if(maxY > X){
maxX -= (maxY - X);
maxY = X;
}
if(maxY < 0)maxY = 0;
maxX = max(maxX,minX);
if(v[i].SE == -1)type = -type;
else {
if(v[i].SE <= minX){
cout << minY << endl;
}
else if(v[i].SE < maxX){
cout << minY + (v[i].SE - minX) << endl;
}
else {
cout << maxY << endl;
}
}
nowT = v[i].FI;
}
return 0;
}
|
#include <bits/stdc++.h>
#define FOR(i,bg,ed) for(ll i=(bg);i<(ed);i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) for(ll i=1;i<=(n);i++)
#define MOD 1000000007
#define int long long
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int INF = 1e9;
ll T; //合計T[g]の砂
int K; //砂時計をひっくり返す回数
int Q; //クエリ数
signed main()
{
cin >> T;
cin >> K;
set<P> events;
REP(i,K) {
int t; //ひっくり返す時刻。元から昇順で並んでいる
cin >> t;
events.insert(P(t, -1)); //reverse query
}
cin >> Q;
REP(i,Q) {
ll t; //時刻
ll f; //始めのAの砂の量
cin >> t >> f;
events.insert(P(t, f));
}
bool inc = false; //A,Bどちらが上か。Aが上のときfalse
ll pt = 0;
ll a = 0;
ll b = T;
ll c = 0;
for (P e : events) {
ll t = e.first; //ひっくり返す、もしくはクエリの時刻
ll x = e.second; //-1ならreverse query
if (inc) { //Bが上
ll d = t - pt;
c += d;
if (b + c > T) b = T - c;
if (a > b) a = b;
} else { //Aが上
ll d = t - pt;
c -= d;
if (a + c < 0) a = -c;
if (a > b) b = a;
}
if (x == -1) { //reverse
inc = !inc;
} else {
cout << max(a, min(b, x)) + c << endl;
}
pt = t;
}
}
|
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
using namespace std;
int X,k,q,t1=0,t2=1,f=-1,Max,Min=0,now=0,p=0,ans;
int t[100010],a[100010],r[100010];
int main()
{
scanf("%d %d",&X,&k);
for(int i=1;i<=k;i++) scanf("%d",&r[i]);
scanf("%d",&q);
for(int i=1;i<=q;i++) scanf("%d %d",&t[i],&a[i]);
Max=X;
while(t2<=q)
{
if(t[t2]>r[t1+1]&&t1<k)
{
t1++;
now=f*(r[t1]-r[t1-1]);
Max=max(0,min(X,Max+now));
Min=max(0,min(X,Min+now));
f*=-1;p+=now;
}
else
{
ans=max(Min,min(Max,a[t2]+p));
ans=max(0,min(X,ans+f*(t[t2]-r[t1])));
printf("%d\n",ans);t2++;
}
}
}
|
#include<stdio.h>
#include<algorithm>
using namespace std;
struct que{
int t;
int a;
int wz;
bool operator<(que b) const
{
return t<b.t;
}
};
que q[262144];
int ans[131072];
int main()
{
//freopen("c.in","r",stdin);
//freopen("c.out","w",stdout);
int x;
scanf("%d",&x);
int mn=0,mx=x,inc=0;
bool isinc=false;
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&q[i].t);
q[i].a=-1;
}
int m;
scanf("%d",&m);
for(int i=0;i<m;i++)
{
scanf("%d%d",&q[i+n].t,&q[i+n].a);
q[i+n].wz=i;
}
sort(q,q+n+m);
int lt=0;
for(int i=0;i<n+m;i++)
{
int dt=q[i].t-lt;
if(isinc)
{
mn+=dt;
mx+=dt;
inc+=dt;
if(mn>x)
{
mn=x;
}
if(mx>x)
{
mx=x;
}
}
else
{
mn-=dt;
mx-=dt;
inc-=dt;
if(mn<0)
{
mn=0;
}
if(mx<0)
{
mx=0;
}
}
lt+=dt;
if(q[i].a<0)
{
isinc^=1;
}
else
{
int answer=q[i].a+inc;
if(answer<mn)
{
answer=mn;
}
if(answer>mx)
{
answer=mx;
}
ans[q[i].wz]=answer;
}
}
for(int i=0;i<m;i++)
{
printf("%d\n",ans[i]);
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int maxn=100010;
int n,m,a[maxn];
int calc(int l,int r,int x)
{
return max(l,min(r,x));
}
int main()
{
int X;
scanf("%d%d",&X,&n);
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
int L,R=X;
int t=0,k=0,s=-1,x=0;
int time,A;
scanf("%d",&m);
for(int i=1;i<=m;i++)
{
scanf("%d%d",&time,&A);
while(k<n&&a[k+1]<=time)
{
int dif=s*(a[k+1]-t);
L=calc(0,X,L+dif);
R=calc(0,X,R+dif);
s*=-1;
x+=dif;
t=a[k+1];
k++;
}
int T=time-t;
A=calc(L,R,A+x);
A=calc(0,X,A+s*T);
printf("%d\n",A);
}
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PI;
const ll mod = 1e9 + 7;
int main(void) {
ll x;
int k;
cin >> x >> k;
VL r(k + 1, 0);
REP(i, 0, k) {
cin >> r[i + 1];
}
VL el(k + 1), em(k + 1), en(k + 1);
VL curdir(k + 1);
el[0] = 0;
em[0] = x;
en[0] = 0; // max(0, min(x, a + 0))
ll dir = -1;
curdir[0] = -1;
REP(i, 0, k) {
ll pass = r[i + 1] - r[i];
en[i + 1] = en[i] + dir * pass;
el[i + 1] = max(0LL, min(x, el[i] + dir * pass));
em[i + 1] = max(0LL, min(x, em[i] + dir * pass));
dir *= -1;
curdir[i + 1] = dir;
}
int q;
cin >> q;
REP(puella, 0, q) {
ll t, a;
cin >> t >> a;
int idx = upper_bound(r.begin(), r.end(), t) - r.begin() - 1;
ll diff = t - r[idx];
ll base = max(el[idx], min(em[idx], a + en[idx]));
ll ans = max(0LL, min(x, base + curdir[idx] * diff));
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
const int maxn = 1e5 + 3;
int X, K, rev[maxn], Q, ti[maxn], ai[maxn], l, r, u, v;
void trans(int dt) {
if(u + dt < 0) {
l -= u + dt;
u = 0;
} else if(u + dt > X) {
u = X;
l = X;
} else {
u += dt;
}
if(v + dt < 0) {
v = 0;
r = 0;
} else if(v + dt > X) {
r -= v + dt - X;
v = X;
} else {
v += dt;
}
}
int calc(int x) {
if(x <= l)
return u;
if(x >= r)
return v;
return u + x - l;
}
int main() {
scanf("%d%d", &X, &K);
l = u = 0;
r = v = X;
rev[0] = 0;
for(int i = 1; i <= K; ++i)
scanf("%d", rev + i);
scanf("%d", &Q);
for(int i = 0; i < Q; ++i)
scanf("%d%d", ti + i, ai + i);
ti[Q] = 0x7fffffff;
for(int i = 1, j = 0, t = rev[0]; i <= K || j < Q;) {
if(i <= K && rev[i] <= ti[j]) {
trans((i & 1) ? t - rev[i] : rev[i] - t);
t = rev[i++];
} else {
trans((i & 1) ? t - ti[j] : ti[j] - t);
printf("%d\n", calc(ai[j]));
t = ti[j++];
}
}
return 0;
}
|
#include<bits/stdc++.h>
#define mo 1000000007
#define pi 3.1415926535898
#define eps 1e-9
using namespace std;
long long read(){
long long xx=0,flagg=1;
char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-')
ch=getchar();
if(ch=='-'){
flagg=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
xx=xx*10+ch-'0';
ch=getchar();
}
return xx*flagg;
}
void pus(long long xx,long long flagg){
if(xx<0){
putchar('-');
xx=-xx;
}
if(xx>=10)
pus(xx/10,0);
putchar(xx%10+'0');
if(flagg==1)
putchar(' ');
if(flagg==2)
putchar('\n');
return;
}
int X,n,m,i,r[100005],L,R,ti,a,flag,x,sum;
int cz(int u,int v,int w){
return max(u,min(v,w));
}
int main(){
X=read();n=read();
for(i=1;i<=n;i++)
r[i]=read();
m=read();
R=X;i=0;flag=-1;
while(m--){
ti=read();a=read();
while(i<n&&r[i+1]<=ti){
x=flag*(r[i+1]-r[i]);
L=cz(0,X,L+x);
R=cz(0,X,R+x);
flag=-flag;
sum+=x;
i++;
}
pus(cz(0,X,cz(L,R,a+sum)+flag*(ti-r[i])),2);
}
return 0;
}
|
#include<bits/stdc++.h>
#define N 100005
using namespace std;
int q,x,k;
int r[N];
struct node
{
int a,t,op,y;
friend bool operator < (const node &aa,const node &bb)
{
return aa.t<bb.t;
}
}p[N*2];
int ans[N];
int main()
{
scanf("%d%d",&x,&k);
for(int i=1;i<=k;i++)scanf("%d",&r[i]),p[i].t=r[i],p[i].op=1;
scanf("%d",&q);
for(int i=1;i<=q;i++)
{
p[i+k].op=2;p[i+k].y=i;
scanf("%d%d",&p[i+k].t,&p[i+k].a);
}
sort(p+1,p+q+k+1);
int t1=x,t2=0,ts=0;
int now=1;
for(int i=1;i<=k+q;i++)
{
if(now==1)
{
t1-=p[i].t-p[i-1].t;
t2-=p[i].t-p[i-1].t;
if(t1<0)t1=0;
if(t2<0)t2=0;
}
else
{
t1+=p[i].t-p[i-1].t;
t2+=p[i].t-p[i-1].t;
if(t1>x)ts+=t1-x,t1=x;
if(t2>x)t2=x;
if(ts>x)ts=x;
}
if(p[i].op==1)now^=1;
else
{
int tmp=x-p[i].a;
int tt=max(0,min(t1,t1-tmp+ts));
if(tt<t2)tt=t2;
ans[p[i].y]=tt;
}
}
for(int i=1;i<=q;i++)
{
printf("%d\n",ans[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define LL long long
int X;
int n, q;
const int N = 200000;
int ri[N];
struct P3
{
LL a, b, c;
} L[N];
P3 change(P3 a, int d)
{
if (d <= 0)
{
if (a.c + d >= 0) return (P3){a.a, a.b, a.c + d};
else if (a.c + a.b + d >= 0) return (P3){a.a + (-d) - a.c, a.b + a.a - (a.a + (-d) - a.c), 0};
else return (P3){X, 0, 0};
}
else
{
if (a.c + a.b + d <= X) return (P3){a.a, a.b, a.c + d};
else if (a.c + d <= X) return (P3){a.a, X - d - a.c, a.c + d};
else return (P3){X, 0, X};
}
}
int main()
{
cin >> X >> n;
L[0] = (P3){0, X, 0};
for (int i = 1; i <= n; ++ i)
{
cin >> ri[i];
if (i & 1) L[i] = change(L[i - 1], -(ri[i] - ri[i - 1]));
else L[i] = change(L[i - 1], ri[i] - ri[i - 1]);
}
cin >> q;
while (q --)
{
int t, a;
cin >> t >> a;
P3 nw;
int p = upper_bound(ri, ri + n + 1, t) - ri - 1;
if ((p + 1) & 1) nw = change(L[p], -(t - ri[p]));
else nw = change(L[p], t - ri[p]);
if (a <= nw.a) cout << nw.c;
else if (a <= nw.a + nw.b) cout << nw.c + (a - nw.a);
else cout << nw.c + nw.b;
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define up(i,j,n) for (int i = j; i <= n; i++)
#define down(i,j,n) for (int i = j; i >= n; i--)
#define cmax(a,b) a = max (a, b)
#define cmin(a,b) a = min (a, b)
const int MAXN = 1e5 + 5;
const int oo = 0x3f3f3f3f;
int N, r[MAXN], X, Q;
int main(){
scanf("%d%d", &X, &N);
up (i, 1, N) scanf("%d", &r[i]);
scanf("%d", &Q);
int cur = 1, c = 0, lower = 0, upper = X, tt = -1;
while (Q--) {
int t, a;
scanf("%d%d", &t, &a);
while (r[cur] <= t && cur <= N) {
int d = r[cur] - r[cur - 1];
c += tt * d;
if (lower + c < 0) {
if (c >= -X) lower = -c;
else {
lower = X;
c = -X;
}
}else if (lower + c > X) {
if (c <= X) lower = X - c;
else {
lower = 0;
c = X;
}
}
if (upper + c < 0) {
if (c >= -X) upper = -c;
else {
upper = X;
c = -X;
}
}else if (upper + c > X) {
if (c <= X) upper = X - c;
else {
upper = 0;
c = X;
}
}
tt *= -1;
cur++;
}
int d = t - r[cur - 1];
cmax (a, lower);
cmin (a, upper);
a += c + tt * d;
if (a < 0) a = 0;
if (a > X) a = X;
printf("%d\n", a);
}
return 0;
}
|
#include <bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
#define inf 998244353
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
signed main(){
int x,k;
vector<int> r;
cin>>x>>k;
vector< pair<int,int> > ev;
for(int i=0;i<k;i++){
int tmp;
cin>>tmp;
r.pb(tmp);
ev.pb( mp ( tmp, -1 ) );
}
int q; cin>>q;
for(int i=0;i<q;i++){
int tim, a;
cin>>tim>>a;
ev.pb( mp( tim, a ) );
}
sort(ev.begin(),ev.end());
vector<int> ans;
int dir = -1, con = 0, ct = 0, btm = 0, tp = x;
for(int i=0;i<ev.size();i++){
int et = ev[i].first - ct;
con += dir * et;
btm = min( max( btm, -con ), x-con);
tp = min( max( tp, -con ), x-con);
if( ev[i].second == -1){
dir *= -1;
}
else{
int a = ev[i].second;
a = min( max( btm, a ), tp );
ans.pb( a + con );
}
ct = ev[i].first;
}
for(int i=0;i<ans.size();i++){
cout<<ans[i]<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int r[100001],t[100001],a[100001],now,ans,tmp,dir=-1;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int X,K;
cin>>X>>K;
for(int i=1;i<=K;i++)
cin>>r[i];
int q;
cin>>q;
for(int i=1;i<=q;i++)
cin>>t[i]>>a[i];
int M=X,m=0,t1=0,t2=1;
while(t2<=q){
if(t1!=K&&t[t2]>r[t1+1]){
t1++;
now=dir*(r[t1]-r[t1-1]);
M=max(0,min(M+now,X));
m=max(0,min(m+now,X));
tmp+=now;dir*=-1;
}
else{
ans=max(m,min(M,a[t2]+tmp));
ans=max(0,min(X,ans+dir*(t[t2]-r[t1])));
cout<<ans<<'\n';
t2++;
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int max_n=200005;
struct Node{
int t,a,id;
bool operator < (Node p)const {
return t<p.t;
}
}qry[max_n];
int X,k,q;
bool down;
int a,b,c;
void update(int v){
int u=b-a+c;
if(u+v>X){
b-=u+v-X;
c+=v;
b=max(b,a),c=min(c,X);
}
else if(c+v<0){
a-=c+v;
c+=v;
a=min(a,b),c=max(c,0);
}
else c+=v;
}
int query(int x){
//cout<<x<<' '<<a<<' '<<b<<' '<<c<<endl;
if(x<a)return c;
else if(x>=a&&x<=b)return x-a+c;
else return b-a+c;
}
int ans[max_n];
int main(){
scanf("%d%d",&X,&k);
for(int i=1;i<=k;i++){
scanf("%d",&qry[i].t);
}
scanf("%d",&q);
for(int i=1;i<=q;i++){
scanf("%d%d",&qry[i+k].t,&qry[i+k].a);
qry[i+k].id=i;
}
sort(qry+1,qry+q+k+1);
down=true;
a=0,b=X,c=0;
for(int i=1;i<=q+k;i++){
int x=qry[i].t-qry[i-1].t;
if(down)update(-x);
else update(x);
//cout<<qry[i].t<<' '<<a<<' '<<b<<' '<<c<<endl;
if(qry[i].id==0)down^=1;
else ans[qry[i].id]=query(qry[i].a);
}
for(int i=1;i<=q;i++)printf("%d\n",ans[i]);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=100010;
int r[N],tup[N],tdn[N];
int n,X;
int q;
int a,t;
int s[N];
int getlw(int p){
int L=0,R=n;
while(L<R){
//cout<<L<<' '<<R<<endl;
int mid=(L+R+1)>>1;
if(r[mid]>p)R=mid-1;
else{
L=mid;
}
}
return L;
}
int main()
{
//freopen("c.in","r",stdin);
//freopen("c.out","w",stdout);
scanf("%d",&X);
tup[0]=X;
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&r[i]);
if(i%2){
s[i]=s[i-1]-r[i]+r[i-1];
tup[i]=tup[i-1]-r[i]+r[i-1];
tdn[i]=tdn[i-1]-r[i]+r[i-1];
}
else{
s[i]=s[i-1]+r[i]-r[i-1];
tup[i]=tup[i-1]+r[i]-r[i-1];
tdn[i]=tdn[i-1]+r[i]-r[i-1];
}
if(tup[i]>X)tup[i]=X;
else if(tup[i]<0)tup[i]=0;
if(tdn[i]>X)tdn[i]=X;
else if(tdn[i]<0)tdn[i]=0;
//cout<<tup[i]<<' '<<tdn[i]<<endl;
}
scanf("%d",&q);
while(q--)
{
scanf("%d%d",&t,&a);
int p=getlw(t);
//cout<<p<<endl;
int up,dn,now;
if((p+1)%2){
up=tup[p]-t+r[p];
dn=tdn[p]-t+r[p];
now=s[p]-t+r[p];
}else{
up=tup[p]+t-r[p];
dn=tdn[p]+t-r[p];
now=s[p]+t-r[p];
}
now+=a;
if(up>X)up=X;
else if(up<0)up=0;
if(dn>X)dn=X;
else if(dn<0)dn=0;
//cout<<up<<'|'<<now<<'|'<<dn<<endl;
if(now>up)now=up;
if(now<dn)now=dn;
printf("%d\n",now);
}
}
|
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn=1e5+10;
int x,k,a,b,c,r[maxn];
int q,t[maxn],g[maxn];
int main()
{
scanf("%d%d",&x,&k);
for(int i=1;i<=k;i++) scanf("%d",&r[i]);
r[0]=0;r[k+1]=1e9+10;
scanf("%d",&q);
for(int i=1;i<=q;i++) scanf("%d%d",&t[i],&g[i]);
int pos=1;
a=0;b=x;c=0;
for(int i=0;i<=k;i++)
{
while(pos<=q && t[pos]<=r[i+1])
{
g[pos]=max(g[pos],a);
g[pos]=min(g[pos],b);
g[pos]+=c;
if (i%2) g[pos]+=t[pos]-r[i];
else g[pos]-=t[pos]-r[i];
g[pos]=max(g[pos],0);
g[pos]=min(g[pos],x);
printf("%d\n",g[pos]);
pos++;
}
int tmp=r[i+1]-r[i];
if (i%2)
{
c+=tmp;
if (b+c>x)
{
if (a+c<=x) b=x-c;
else
{
a=0;b=0;
c=x;
}
}
}
else
{
c-=tmp;
if (a+c<0)
{
if (b+c>=0) a=-c;
else
{
a=0;b=0;
c=0;
}
}
}
}
return 0;
}
|
#include<bits/stdc++.h>
#define pi 3.1415926535897932384626
using namespace std;
struct P{
int x,y;
bool operator < (const P &a )const{
//if(y!=a.y)
return y<a.y;
};
};
int a,b,c,d,i,k,n,m,e,dx[10]={1,0,-1,0,1,1,-1,-1},dy[10]={0,1,0,-1,1,-1,1,-1};
int o[101101];
int l[101111][4];
int j[1];
long long x,y,z,mod=1000000007;
//string r;
char r[1];
P u[1];
queue<int> q;
//stack<P> s;
vector<int> v[1111];
bool as(P a,P b)
{
return a.x<b.x;
}
int main()
{
scanf("%d %d",&a,&b);
l[0][0]=a;
for(int t=1;t<=b+1;t++)
{
if(t<=b) scanf("%d",&o[t]);
else o[t]=1000000010;
if(t%2)
{
l[t][0]=max(l[t-1][0]-(o[t]-o[t-1]),0);
l[t][1]=max(l[t-1][1]-(o[t]-o[t-1]),0);
l[t][2]=l[t-1][2];
if(l[t][1]==0)l[t][3]=min(a-l[t][2],l[t-1][3]-l[t-1][1]+(o[t]-o[t-1]));
else l[t][3]=l[t-1][3];
}
else
{
l[t][0]=min(l[t-1][0]+(o[t]-o[t-1]),a);
l[t][1]=min(l[t-1][1]+(o[t]-o[t-1]),a);
l[t][3]=l[t-1][3];
if(l[t][0]==a)l[t][2]=min(a-l[t][3],l[t-1][2]+(l[t-1][0]+(o[t]-o[t-1])-a));
else l[t][2]=l[t-1][2];
}
}
b++;
scanf("%d",&c);
for(int t=1;t<=c;t++)
{
scanf("%d %d",&n,&m);
for(;o[e+1]<=n&&e<b;e++);
int p;
if(m<=l[e][3]) p=l[e][1];
else if(a<=m+l[e][2]) p=l[e][0];
else p=l[e][1]+m-l[e][3];
if(e%2) p+=n-o[e];
else p-=n-o[e];
printf("%d\n",max(min(a,p),0));
}
}
//3
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
const long long LINF=1e18;
template<typename T>
void chmin(T &a,T b){
if(a>b)a=b;
}
template<typename T>
void chmax(T &a,T b){
if(a<b)a=b;
}
signed main(){
int x,k;cin>>x>>k;
vector<int> r(k); for(int &p:r)cin>>p;
r.push_back(LINF);
int q;cin>>q;
vector<P> qu(q); for(P &p:qu){int t,a;cin>>t>>a;p=P(t,a);}
int now=0,de=0,fl=1,low=0,high=x;
int A=x;
for(P _:qu){
int t=_.first,a=_.second;
while(now<=k&&r[now]<=t){
de+=fl*(r[now]-(now>0?r[now-1]:0));
chmin(high,x+de);
chmax(low,de);
A-=fl*(r[now]-(now>0?r[now-1]:0));chmax(A,0LL);chmin(A,x);
fl*=-1;now++;
}
int ans,w=-de-fl*(t-(now?r[now-1]:0));
if(a<low)ans=low+w;
else if(a>high)ans=high+w;
else ans=a+w;
if(high<low)ans=A-fl*(t-(now?r[now-1]:0));
chmax(ans,0LL);
chmin(ans,x);
cout<<ans<<endl;
}
}
|
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define X first
#define Y second
using namespace std;
typedef pair<int, int> pii;
const int N = 222222;
vector<pii> a;
int x, n, ac[N], res[N], q;
int main() {
scanf("%d", &x);
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
int t;
scanf("%d", &t);
a.pb(mp(t, -1));
}
scanf("%d", &q);
for (int i = 1; i <= q; ++i) {
int t;
scanf("%d%d", &t, &ac[i]);
a.pb(mp(t, i));
}
sort(a.begin(), a.end());
int i = 0, j = x, yi = 0, yj = x, dir = 0, t0 = 0;
for (int _ = 0; _ < a.size(); ++_) {
int t = a[_].X;
if (t != t0) {
int dt = t - t0;
if (dir == 0) {
if (yi >= dt) {
yi -= dt;
yj -= dt;
} else if (yj < dt) {
yj = yi = 0;
i = j = 0;
} else {
i += dt - yi;
yi = 0;
yj -= dt;
}
} else {
if (yj + dt <= x) {
yi += dt;
yj += dt;
} else if (yi + dt > x) {
i = j = 0;
yi = yj = x;
} else {
j -= yj + dt - x;
yi += dt;
yj = x;
}
}
}
t0 = t;
int id = a[_].Y;
if (~id) {
if (ac[id] <= i) res[id] = yi;
else if (ac[id] >= j) res[id] = yj;
else res[id] = yi + ac[id] - i;
}
else dir ^= 1;
}
for (int i = 1; i <= q; ++i) printf("%d\n", res[i]);
return 0;
}
|
#include<cstdio>
#include<algorithm>
using namespace std;
const int M = 100100;
int x, k, r[M], q, ans[M];
struct Query {
int t, a, id;
}qry[M * 2];
bool cmp(Query a, Query b) {
return a.t < b.t;
}
int main() {
scanf("%d%d", &x, &k);
for(int i = 1; i <= k; i++) {
scanf("%d", &qry[i].t);
qry[i].id = 0;
}
scanf("%d", &q);
for(int i = 1; i <= q; i++) {
scanf("%d%d", &qry[i + k].t, &qry[i + k].a);
qry[i + k].id = i;
}
sort(qry + 1, qry + q + k + 1, cmp);
int j = 1;
int a = 0, a_len = 1, b = x, cge = -1;
for(int i = 1; i <= q + k; i++) {
int cp = qry[i].t - qry[i - 1].t;
if(cge == -1) {
if(cp > a) {
a_len += cp - a;
a = 0;
} else a -= cp;
b -= cp;
if(a_len > x + 1) a_len = x + 1;
if(b < 0) b = 0, a_len = x + 1;
if(a < 0) a = 0;
} else {
a += cp;
b += cp;
if(b > x) b = x;
if(a > x) a = x, a_len = x + 1;
}
if(qry[i].id == 0) cge = -cge;
else {
//
if(qry[i].a < a_len) ans[qry[i].id] = a;
else if(qry[i].a < a_len + b - a) ans[qry[i].id] = qry[i].a - a_len + a + 1;
else ans[qry[i].id] = b;
}//printf("%d %d %d\n", a, a_len, b);
}
for(int i = 1; i <= q; i++) printf("%d\n", ans[i]);
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#define lol(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
int x,k,r[100010],q,a,t;
int main(){
cin>>x>>k;
r[0]=0;
lol(i,k)cin>>r[i+1];
cin>>q;
int pnt=1;
int left=0,right=x,nowleft=0,nowright=x;
while(q--){
cin>>t>>a;
while(pnt<=k){
if(r[pnt]>t)break;
int move;
if(pnt%2==0)move=+(r[pnt]-r[pnt-1]);
if(pnt%2==1)move=-(r[pnt]-r[pnt-1]);
nowleft+=move,nowright+=move;
right-=max(0,nowright-x);
left+=max(0,0-nowleft);
if(left>right)left=right;
nowleft=max(0,nowleft);
nowleft=min(x,nowleft);
nowright=max(0,nowright);
nowright=min(x,nowright);
//cout<<r[pnt]<<"#"<<pnt<<" "<<left<<" "<<right<<" "<<nowleft<<" "<<nowright<<endl;
pnt++;
}
int lastref;
if(a<=left)lastref=nowleft;
if(left<a&&a<right)lastref=nowleft+a-left;
if(right<=a)lastref=nowright;
if(pnt%2==0)lastref+=(t-r[pnt-1]);
if(pnt%2==1)lastref-=(t-r[pnt-1]);
lastref=max(0,lastref);
lastref=min(x,lastref);
//cout<<"%"<<left<<" "<<right<<" "<<a<<" "<<nowleft<<" "<<nowright<<endl;
cout<<lastref<<endl;
}
return 0;
}
|
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
class Operation {
int l, r, d;
public:
Operation() : l(0), r(1<<30), d(0) {};
Operation(int l, int r, int d) : l(l), r(r), d(d) {}
int apply(int a) {
return max(l, min(r, a + d));
};
Operation append(Operation op) {
if (r + op.d <= op.l) return Operation(op.l, op.l, d + op.d);
else if (l + op.d >= op.r) return Operation(op.r, op.r, d + op.d);
else return Operation(max(l + op.d, op.l), min(r + op.d, op.r), d + op.d);
}
};
Operation operator*(Operation lhs, Operation rhs) {
return lhs.append(rhs);
}
int main() {
int x, k; cin >> x >> k;
int r[k]; for (int i = 0; i < k; i++) cin >> r[i];
vector<Operation> ops;
ops.push_back(Operation(0, x, 0));
for (int i = 1; i <= k; i++) {
int r1 = i == 1 ? 0 : r[i-2], r2 = r[i-1];
ops.push_back(ops[i-1] * Operation(0, x, (r2 - r1) * (i % 2 ? -1 : 1)));
}
int q; cin >> q;
while (q--) {
int t, a; cin >> t >> a;
int i = upper_bound(r, r+k, t) - r;
int a1 = ops[i].apply(a);
cout << Operation(0, x, (t - (i > 0 ? r[i-1] : 0)) * (i % 2 ? 1 : -1)).apply(a1) << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main(){
LL x, k;
cin >> x >> k;
LL r[k];
for(int i = 0; i < k; i++) cin >> r[i];
LL q;
cin >> q;
vector<LL> t;
vector<LL> a;
for(int i = 0; i < q; i++){
LL p, r;
cin >> p >> r;
t.push_back(p);
a.push_back(r);
}
LL minv = 0;
LL maxv = x;
LL dx = 0;
LL sgn = -1;
LL s1 = 0;
LL s2 = 0;
LL lastt = 0;
while(s2 < t.size()){
if(s1 == k || t[s2] < r[s1]){
// answer
LL f = max(minv, min(maxv, a[s2] + dx));
f += sgn*(t[s2] - lastt);
f = max(0LL, min(x, f));
printf("%lld\n",f);
s2++;
} else {
LL diff = r[s1] - lastt;
diff *= sgn;
minv += diff;
maxv += diff;
dx += diff;
minv = max(0LL, min(x, minv));
maxv = max(0LL, min(x, maxv));
sgn *= -1;
lastt = r[s1];
s1++;
//cout << minv << " " << maxv << " " << dx << " " << sgn << endl;
}
}
}
|
#include<bits/stdc++.h>
#define Add(x,y) x=mymax(0,mymin(X,x+y))
using namespace std;
namespace IO
{
const int S=(1<<20)+5;
//Input Correlation
char buf[S],*H,*T;
inline char Get()
{
if(H==T) T=(H=buf)+fread(buf,1,S,stdin);
if(H==T) return -1;return *H++;
}
inline int read()
{
int x=0;char c=Get();
while(!isdigit(c)) c=Get();
while(isdigit(c)) x=x*10+c-'0',c=Get();
return x;
}
//Output Correlation
char obuf[S],*oS=obuf,*oT=oS+S-1,c,qu[55];int qr;
inline void flush(){fwrite(obuf,1,oS-obuf,stdout);oS=obuf;}
inline void putc(char x){*oS++ =x;if(oS==oT) flush();}
template <class I>inline void print(I x)
{
if(!x) putc('0');
if(x<0) putc('-'),x=-x;
while(x) qu[++qr]=x%10+'0',x/=10;
while(qr) putc(qu[qr--]);
}
}
inline int mymax(const int &x,const int &y){return x>y?x:y;}
inline int mymin(const int &x,const int &y){return x<y?x:y;}
using namespace IO;
const int N=100010;
int t[N],a[N],r[N];
int X,n,Q;
int main()
{
X=read();n=read();
for(int i=1;i<=n;i++) r[i]=read();
Q=read();
for(int i=1;i<=Q;i++) t[i]=read(),a[i]=read();
int down=0,c=0,up=X,fg=-1,p1=0,p2=1,ad=0;
while(p2<=Q)
{
if(t[p2]>r[p1+1]&&p1<n)
{
p1++;
ad=fg*(r[p1]-r[p1-1]);
Add(down,ad);Add(up,ad);
c+=ad;fg=-fg;
}
else
{
int len=t[p2]-r[p1];
int ans=mymax(down,mymin(up,a[p2]+c));
Add(ans,fg*len);
print(ans);putc('\n');
p2++;
}
}
flush();
return 0;
}
|
#include<cstdio>
const int MaxK=100010,MaxQ=100010;
int X,K,r[MaxK],Q,t[MaxQ],a[MaxQ];
int L,R,b,T;
bool dir;
int min(int a,int b){return a<b?a:b;}
int max(int a,int b){return a>b?a:b;}
void mov(int t){
if(dir){
b+=min(t-T,X-b-L);
R=min(R,X-b);
}
else{
b-=min(t-T,b+R);
L=max(L,-b);
}
T=t;
}
int main(){
scanf("%d%d",&X,&K);
for(int i=0;i<K;i++)scanf("%d",r+i);
scanf("%d",&Q);
for(int i=0;i<Q;i++)scanf("%d%d",t+i,a+i);
R=X;
for(int i=0,j=0;i<K||j<Q;){
if(j==Q||i<K&&r[i]<t[j]){
mov(r[i++]);
dir^=1;
}
else{
mov(t[j]);
printf("%d\n",b+min(max(a[j++],L),R));
}
}
}
|
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define LL long long
using namespace std;
int main(){
LL X;cin>>X;
int K;cin>>K;
LL r[K+1];REP(i,K)cin>>r[i+1];
r[0]=0;
LL sum[K+1];
sum[0]=0;
REP(i,K)sum[i+1]=sum[i]+(r[i+1]-r[i])*(i%2==0 ? 1:-1);
pair<LL,LL> range[K+1];
range[0]={0LL,X};
REP(i,K){
range[i+1].first=range[i].first;range[i+1].second=range[i].second;
if(i%2==0)range[i+1].first=max(range[i+1].first,sum[i+1]);
else range[i+1].second =min(range[i+1].second,X+sum[i+1]);
}
LL a0[K+1];a0[0]=0;
LL ax[K+1];ax[0]=X;
REP(i,K){
a0[i+1]=a0[i]+(r[i+1]-r[i])*(i%2==0 ? -1:1);
a0[i+1]=max(0LL,a0[i+1]);
a0[i+1]=min(X,a0[i+1]);
}
REP(i,K){
ax[i+1]=ax[i]+(r[i+1]-r[i])*(i%2==0 ? -1:+1);
ax[i+1]=max(0LL,ax[i+1]);
ax[i+1]=min(X,ax[i+1]);
}
int q;cin>>q;
REP(i,q){
LL t,a;cin>>t>>a;
LL ans=0;
int k = upper_bound(r,r+K+1,t)-r -1;
if(a>range[k].first&&a<range[k].second)ans = a - sum[k];
else if(a<=range[k].first)ans = a0[k];
else ans = ax[k];
ans += (t-r[k])*(k%2 ==0 ? -1:1);
ans = max(0LL,ans);
ans = min(X,ans);
cout<<ans<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=100100;
int a[N],X,n,q,sum;
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>X>>n;
for(int i=1;i<=n;++i)cin>>a[i];
int L=0,R=X,tag=-1,i=1;
for(cin>>q;q --> 0;){
int x,y;cin>>x>>y;
for(;i<=n&&a[i]<x;++i){
int tmp=tag*(a[i]-a[i-1]);
L+=tmp;L=max(0,min(X,L));
R+=tmp;R=max(0,min(X,R));
sum+=tmp;tag=-tag;
}
int tmp=max(L,min(R,y+sum))+tag*(x-a[i-1]);
cout<<max(0,min(X,tmp))<<'\n';
}
return 0;
}
|
#include<iostream>
using namespace std;
int main() {
int x, k, q, r[100000], t, y;
cin >> x >> k;
for(int i = 0; i < k; i++) cin >> r[i];
cin >> q;
int a{0}, b{x}, c{0}, s{0}, u{0}, v{-1};
auto f = [](int m, int z, int n) { return max(m, min(n, z)); };
while(q--) {
cin >> t >> y;
for(; u < k && r[u] <= t; s = r[u++], v *= -1) {
c = f(-b, c + (r[u] - s) * v, x - a);
a = f(a, 0 - c, b);
b = f(a, x - c, b);
}
cout << f(0, f(a, y, b) + c + (t - s) * v, x) << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
class Watch {
public:
explicit Watch(int X) : X(X), startA(0), curA(0), startB(X), curB(X), up(true) {}
int query(int time, int a){
int cur = calcStart_(a) + (up ? -time : time);
if(cur <= 0) return 0;
if(cur >= X) return X;
return cur;
}
int progress(int time){
if(up){
curA -= time;
curB -= time;
if(curB <= 0){
startA = startB;
curA = curB = 0;
} else if(curA <= 0){
startA -= curA;
curA = 0;
}
} else {
curA += time;
curB += time;
if(curA >= X){
startB = startA;
curA = curB = X;
} else if(curB >= X){
startB -= curB - X;
curB = X;
}
}
up = !up;
}
private:
int calcStart_(int a){
if(a <= startA) return curA;
if(a >= startB) return curB;
return curA + a - startA;
}
private:
const int X;
int startA, curA, startB, curB;
bool up;
};
int main(){
int X, K;
while(cin >> X >> K){
vector<int> times;
times.push_back(0);
for(int i=0;i<K;i++){
int a; cin >> a;
times.push_back(a);
}
times.push_back(1000000007);
Watch watch(X);
int timeIdx = 0;
int Q; cin >> Q;
for(int i=0;i<Q;i++){
int t, a; cin >> t >> a;
while(t >= times[timeIdx+1]){
watch.progress(times[timeIdx+1] - times[timeIdx]);
++timeIdx;
}
cout << watch.query(t - times[timeIdx], a) << endl;
}
}
}
|
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
//#include<iostream>
using namespace std;
#define LL long long
int n,m;
#define maxn 200011
struct event
{
int t,a,id;
bool operator < (const event &b) const {return t<b.t;}
}e[maxn];int le=0;
LL X,ans[maxn];
int main()
{
scanf("%lld%d",&X,&n);
for (int i=1;i<=n;i++) le++,scanf("%d",&e[le].t),e[le].id=e[le].a=0;
scanf("%d",&m);
for (int i=1;i<=m;i++) le++,scanf("%d%d",&e[le].t,&e[le].a),e[le].id=i;
sort(e+1,e+1+le);
// for (int i=1;i<=le;i++) cout<<e[i].t<<' '<<e[i].a<<' '<<e[i].id<<endl;
LL Min=0,Max=X,pre=0;
for (int i=1,sig=-1,last=0;i<=le;i++)
{
LL now=(e[i].t-last)*sig;
if (e[i].id)
{
LL v=e[i].a+pre;
if (v<Min) v=Min;
if (v>Max) v=Max;
v+=now;
if (v<0) v=0;
if (v>X) v=X;
ans[e[i].id]=v;
}
else
{
Min+=now;Max+=now;
if (Min<0) Min=0;if (Max<0) Max=0;
if (Min>X) Min=X;if (Max>X) Max=X;
pre+=now;sig*=-1;last=e[i].t;
}
}
for (int i=1;i<=m;i++) printf("%lld\n",ans[i]);
return 0;
}
|
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define N 220000
using namespace std;
int a[N],b[N],sum[N],l[N],r[N],A,B,ans0[N],ans1[N];
int q,n,x;
int main(){
scanf("%d",&x);
scanf("%d",&n);
n++;
for(int i=1;i<=n;i++){
if(i<n)scanf("%d",&a[i]);
else a[i]=1200000000;
b[i]=a[i]-a[i-1];
b[i]=b[i]*((i&1)?-1:1);
sum[i]=sum[i-1]+b[i];
}
l[0]=0,r[0]=x;
for(int i=1;i<=n;i++){
l[i]=l[i-1];
r[i]=r[i-1];
l[i]=max(l[i],-sum[i]);
r[i]=min(r[i],x-sum[i]);
}
//for(int i=1;i<=n;i++)printf("%d %d\n",l[i],r[i]);
A=0,B=x;
for(int i=1;i<=n;i++){
A=A+b[i];
B=B+b[i];
A=max(A,0);A=min(A,x);
B=max(B,0);B=min(B,x);
ans0[i]=A;
ans1[i]=B;
}
// for(int i=1;i<=n;i++)printf("%d ",b[i]);printf("\n");
// for(int i=1;i<=n;i++)printf("%d ",ans1[i]);printf("\n");
scanf("%d",&q);
for(int i=1;i<=q;i++){
int X,y;
scanf("%d%d",&X,&y);
int p=lower_bound(a+1,a+1+n,X)-a;
if(a[p]>X)p--;
// printf("%d %d %d\n",X,y,p);
int ans=0;
if(y<=l[p]){
ans=ans0[p];
}
if(y>=r[p]){
ans=ans1[p];
}
if(y>=l[p]&&y<=r[p]){
ans=y+sum[p];
}
if(p&1)ans+=X-a[p];
else ans-=X-a[p];
ans=max(ans,0);
ans=min(ans,x);
printf("%d\n",ans);
}
}
|
#include <cstdio>
inline int Min(const int a,const int b){return a<b?a:b;}
inline int Max(const int a,const int b){return a>b?a:b;}
int X,k,q,r[100005],t[100005],a[100005],Ans;
int main()
{
scanf("%d%d",&X,&k);
for(int i=1;i<=k;++i)scanf("%d",&r[i]);
scanf("%d",&q);
for(int i=1;i<=q;++i)scanf("%d%d",&t[i],&a[i]);
int Minn=0,Maxn=X,t1=0,t2=1,f=-1,Now=0,p=0;
while(t2<=q)
if(t[t2]>r[t1+1]&&t1<k)
{
++t1,Now=f*(r[t1]-r[t1-1]);
Minn=Max(0,Min(X,Minn+Now));
Maxn=Max(0,Min(X,Maxn+Now));
p+=Now,f*=-1;
}
else
{
Ans=Max(Minn,Min(Maxn,a[t2]+p));
Ans=Max(0,Min(X,Ans+f*(t[t2]-r[t1])));
printf("%d\n",Ans),++t2;
}
return 0;
}
|
#include<stdio.h>
#include<map>
#include<cmath>
#include<stdlib.h>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
const int MX = 100005;
const int MM = 998244353;
struct EV{
int o, t, a, ad;
EV(int o, int t, int a, int ad):o(o), t(t), a(a), ad(ad){}
bool operator<(EV l)const{
return t < l.t;
}
};
int N;
int ans[MX], D[MX];
int main()
{
vector<EV> L;
int X, K, Q, t, a;
scanf("%d%d", &X, &K);
for(int i = 1; i <= K; i++){
scanf("%d", D+i);
L.emplace_back(0, D[i], 0, 0);
}
scanf("%d", &Q);
for(int i = 1; i <= Q; i++){
scanf("%d%d", &t, &a);
L.emplace_back(1, t, a, i);
}
sort(L.begin(), L.end());
int l = 0, r = X, u = 0, ch = 0, b = 0;
for(EV c : L){
if( c.o == 0 ){
int d = c.t - b; b = c.t;
if( ch ){
int v = X-(u + (r-l));
r = max(l, r - max(0, d-v));
u = min(X, u+d);
}
else{
l = min(r, l + max(0, d - u));
u = max(0, u-d);
}
ch = !ch;
}
else{
int d = c.t - b, a = c.a;
int v = u + min(r-l, max(0, a-l));
if( !ch ){
ans[c.ad] = max(0, v - d);
}
else ans[c.ad] = min(X, v + d);
}
}
for(int i = 1; i <= Q; i++) printf("%d\n", ans[i]);
}
|
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef pair<ll, ll>pii;
int main()
{
ll gen;
int num;
scanf("%lld%d", &gen, &num);
vector<pii>qs;
for (int i = 0; i < num; i++)
{
ll z;
scanf("%lld", &z);
qs.push_back(make_pair(z, -1));
}
int query;
scanf("%d", &query);
for (int i = 0; i < query; i++)
{
int za, zb;
scanf("%d%d", &za, &zb);
qs.push_back(make_pair(za, zb));
}
sort(qs.begin(), qs.end());
ll mina = 0;
ll lb = 0, ub = gen;
ll bef = 0;
int d = 0;
for (int i = 0; i < qs.size(); i++)
{
if (qs[i].second == -1)
{
ll t = qs[i].first - bef;
if (d == 0)
{
if (t < lb)lb -= t, ub -= t;
else if (t < ub)mina += t - lb, lb = 0, ub -= t;
else lb = ub = 0;
}
else
{
if (t < gen - ub)lb += t, ub += t;
else if (t < gen - lb)lb += t, ub = gen;
else lb = ub = gen;
}
d ^= 1;
bef = qs[i].first;
}
else
{
ll t = qs[i].first - bef;
ll z;
if (qs[i].second < mina)z = lb;
else if (qs[i].second <= mina + ub - lb)z = lb + (qs[i].second - mina);
else z = ub;
if (d == 0)z = max(z - t, 0LL);
else z = min(z + t, gen);
printf("%lld\n", z);
}
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.