text
stringlengths 49
983k
|
|---|
#include<bits/stdc++.h>
using namespace std;
signed main(){
int a,b; cin >> a >> b;
cout << (((a*b)%2==0)? "Even":"Odd");
}
|
#include <iostream>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
if(((a*b) % 2) == 1)
cout<<"Odd"<<endl;
else
cout<<"Even"<<endl;
}
|
#include <iostream>
int main(){
using namespace std;
int a,b;
cin>>a>>b;
if(a*b%2==1)
cout<<"Odd"<<endl;
else
cout<<"Even"<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
puts(a * b % 2 != 0 ? "Odd" : "Even");
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<(a*b&1?"Odd":"Even");
}
|
#include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a*b%2>0)cout<<"Odd";
else cout<<"Even";
}
|
#include <stdio.h>
int main () {
int a, b;
scanf("%d%d", &a, &b);
if (a % 2 && b % 2) puts("Odd");
else puts("Even");
}
|
#include<stdio.h>
int main( )
{
int i, j;
scanf("%d %d", &i, &j);
printf("%s\n", i * j % 2 ? "Odd" : "Even");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a,b;
int main(){
cin >> a >> b;
cout << ( a*b % 2 == 0 ? "Even":"Odd") << endl;
}
|
#include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
a*=b;
if(a%2==0){cout<<"Even"<<endl;}
else cout<<"Odd"<<endl;
}
|
#include<stdio.h>
int main(void)
{
int n,m;
scanf("%d %d",&n,&m);
if(n*m%2==0) printf("Even\n");
else printf("Odd\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define MAX 100007
int r[MAX];
int a[MAX];
int b[MAX];
int k1[MAX];
int main(){
int x,k,q;
cin >> x >> k;
for(int i=1; i<=k; i++)cin >> r[i];
r[k+1]=INT_MAX;
a[0]=0;
b[0]=x;
k1[0]=1;
// printf("%d %d %d\n",a[0],b[0],k1[0]);
for(int i=1; i<=k; i++){
int dt=r[i]-r[i-1];
if(i&1){
a[i]=max(a[i-1]-dt,0);
b[i]=max(b[i-1]-dt,0);
if(a[i]==b[i])k1[i]=(x+1);
else k1[i]=min(k1[i-1]+max(dt-a[i-1],0),x);
}
else{
a[i]=min(a[i-1]+dt,x);
b[i]=min(b[i-1]+dt,x);
if(a[i]==b[i])k1[i]=(x+1);
else k1[i]=max(k1[i-1]-max(dt-x+a[i-1]+1,0),0);
}
// printf("%d %d %d\n",a[i],b[i],k1[i]);
}
cin >> q;
for(int i=1; i<=q; i++){
int tq, aq;
cin >> tq >> aq;
if(tq==0){cout << aq << endl; continue;}
int p=lower_bound(r,r+k+2,tq)-r-1;
int dt=tq-r[p];
int res=min(a[p]+max(aq-k1[p]+1,0),b[p]);
// cout << dt << " " << res << " ";
res= (p&1) ? min(res+dt,x) :max(res-dt,0);
// cout << p << " " << res << endl;
cout << res << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
int x;
vector<int>rev;
int ptr=0;
#undef int
int main(){
#define int long long
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>x;
int k;cin>>k;
rev.push_back(0);
for(int i=0;i<k;i++){
int t;cin>>t;
rev.push_back(t);
}
int q;cin>>q;
int d=0,u=x,dans=0,uans=x;
for(int i=0;i<q;i++){
int t,a;cin>>t>>a;
while(ptr<rev.size()-1&&t>=rev[ptr+1]){
if(ptr%2==0){
dans-=(rev[ptr+1]-rev[ptr]);
if(dans<0){
d+=(-dans);
dans=0;
}
if(d>u){
d=u;uans=0;
}else{
uans-=(rev[ptr+1]-rev[ptr]);
}
}else{
uans+=(rev[ptr+1]-rev[ptr]);
if(uans>x){
u-=(uans-x);
uans=x;
}
if(u<d){
u=d;dans=x;
}else{
dans+=(rev[ptr+1]-rev[ptr]);
}
}
ptr++;
}
if(ptr%2==0){
if(a>=u){
cout<<max(0LL,uans-(t-rev[ptr]))<<"\n";
}else if(a<=d){
cout<<max(0LL,dans-(t-rev[ptr]))<<"\n";
}else{
int stans=(a-d)+dans;
cout<<max(0LL,stans-(t-rev[ptr]))<<"\n";
}
}else{
if(a>=u){
cout<<min(x,uans+(t-rev[ptr]))<<"\n";
}else if(a<=d){
cout<<min(x,dans+(t-rev[ptr]))<<"\n";
}else{
int stans=(a-d)+dans;
cout<<min(x,stans+(t-rev[ptr]))<<"\n";
}
}
}
return 0;
}
|
#include <cstdio>
#include <iostream>
using namespace std;
const int Q=1<<17;
int s[Q],n,maxn;
int Ch(int x,int l,int r)
{return max(l,min(r,x));}
int main()
{
scanf("%d%d",&maxn,&n);
for(int i=1;i<=n;i++)
scanf("%d",&s[i]);
int p=1,l=0,r=maxn;
int qaq,t,a,ty=-1,del=0;
for(scanf("%d",&qaq);qaq;--qaq){
scanf("%d%d",&t,&a);
while(p<=n&&s[p]<=t){
int val=ty*(s[p]-s[p-1]);
l=Ch(l+val,0,maxn);
r=Ch(r+val,0,maxn);
del+=val;
ty=-ty;
++p;
}
printf("%d\n",Ch(Ch(a+del,l,r)+ty*(t-s[p-1]),0,maxn));
}
return 0;
}
|
#include <iostream>
#include <algorithm>
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 << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MN = 101000;
ll r[MN];
ll v[MN],w[MN],u[MN];
ll vt[MN],vb[MN],sn[MN];
int main() {
ll x,k,q;
scanf("%lld %lld ",&x,&k);
r[0] = 0;
for(int i=0;i<k;i++) {
scanf("%lld ",&r[i+1]);
}
k++;
sn[0] = -1;
vt[0] = 0;vb[0] = 0;
v[0] = x;w[0] = 0;u[0] = 0;
for(int i=1;i<k;i++) {
u[i] = u[i-1]+sn[i-1]*(r[i]-r[i-1]);
v[i] = v[i-1]+sn[i-1]*(r[i]-r[i-1]);
w[i] = w[i-1]+sn[i-1]*(r[i]-r[i-1]);
vt[i] = vt[i-1];vb[i] = vb[i-1];
if(v[i] > x) {
vt[i] += v[i]-x;
v[i] = x;
}
if(w[i] > x) {w[i] = x;}
if(w[i] < 0) {
vb[i] -= w[i];
w[i] = 0;
}
if(v[i] < 0) {v[i] = 0;}
sn[i] = sn[i-1]*-1;
}
scanf("%lld ",&q);
while(q--) {
ll t,a;
scanf("%lld %lld ",&t,&a);
int id = upper_bound(r,r+k,t)-r-1;
//printf("%lld -> %lld, id %ld\n",w[id],v[id],id);
if(a <= vb[id]) {
a = w[id];
} else if(a >= x-vt[id]) {
a = v[id];
} else {
a += u[id];
}
a += sn[id]*(t-r[id]);
a = max(a,0LL);
a = min(a,x);
printf("%lld\n",a);
}
}
|
#include <bits/stdc++.h>
#define ll long long
#define lf double
#define E complex<lf>
#define inf 0x3f3f3f3f
#define eps 1e-8
#define pa pair<int,int>
#define pb push_back
#define ms(x,y) memset(x,y,sizeof(x))
#define l(x) (x<<1)
#define r(x) (x<<1|1)
#define mod 1000000007
#define N 100010
using namespace std;
inline ll read() {
ll x=0,f=1;char c=getchar();
while (c<'0'||c>'9') f=(c=='-')?-1:1,c=getchar();
while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x*f;
}
int n,m;
ll x,t[N],a[N],r[N];
int main() {
x=read(),n=read();
for (int i=1; i<=n; i++) r[i]=read();
m=read();
for (int i=1; i<=m; i++) t[i]=read(),a[i]=read();
ll h=0,k=1,opt=-1,mx=x,mn=0;
for (int i=1; i<=m; i++) {
while (k<=n&&t[i]>=r[k]) {
ll v=(r[k]-r[k-1])*opt;
mx+=v,mn+=v,h+=v;
mx=min(mx,x),mx=max(mx,0ll);
mn=min(mn,x),mn=max(mn,0ll);
k++,opt*=-1;
}
ll now=a[i]+h,d=(t[i]-r[k-1])*opt;
now=max(now,mn),now=min(now,mx);
now+=d,now=max(now,0ll),now=min(now,x);
printf("%lld\n",now);
}
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stdio.h>
#include <string.h>
#include <math.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int x;
cin >> x;
int k;
cin >> k;
vector<int> r(k);
for (int i = 0; i < k; i++) {
cin >> r[i];
}
int q;
cin >> q;
int a = 0, b = x, c = 0, e = 0;
int i = 0, s = 0;
for (int j = 0; j < q; j++) {
int t, y;
cin >> t >> y;
for (; i < k && r[i] < t; i++) {
int d = r[i] - s;
s = r[i];
if (i % 2 == 0) {
e = max(e - d, 0);
c -= d;
a = max(a, 0 - c);
} else {
e = min(e + d, x);
c += d;
b = min(b, x - c);
}
}
y = a < b ? (y <= a ? a : y < b ? y : b) + c : e;
y += (t - s) * (i % 2 == 0 ? -1 : 1);
y = min(max(y, 0), x);
cout << y << '\n';
}
return 0;
}
|
#include <cstdio>
int r[100005],X,K,Q,a,b,c,d;
void calc(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(){
scanf("%d%d",&X,&K);
for (int i=1;i<=K;i++) scanf("%d",&r[i]);
a=0;b=X;c=d=0;
scanf("%d",&Q);
for (int i=1,j=1,k=-1;i<=Q;i++){
int t,x;
scanf("%d%d",&t,&x);
for (;j<=K && r[j]<=t;d=r[j++],k=-k) calc(k*(r[j]-d));
calc(k*(t-d));d=t;
if (x<a) printf("%d\n",a+c);
else if (x<=b) printf("%d\n",x+c);
else printf("%d\n",b+c);
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int Nmax = 1e5 + 5;
int X, n, a[Nmax], mode, tmp, t, A, B, C, init, i, q;
void advance(int x)
{
if(mode == -1)
{
int t = A + C;
C -= x;
if(t <= x) A += x-t;
}
else
{
int t = X - (B + C);
C += x;
if(t <= x) B -= x-t;
}
if(A > B)
{
if(mode == 1) A = B = X, C = 0;
else A = B = 0, C = 0;
}
}
int f(int x)
{
if(x <= A) return A + C;
if(x >= B) return B + C;
return x + C;
}
int main()
{
// freopen("input", "r", stdin);
cin >> X >> n;
for(i=1; i<=n; ++i) cin >> a[i];
cin >> q; i = 1; A = 0, B = X, C = 0;
tmp = 0; mode = -1;
while(q--)
{
cin >> t >> init;
while(i<=n && a[i] <= t)
{
advance(a[i] - tmp);
mode = -mode; tmp = a[i++];
}
advance(t - tmp); tmp = t;
cout << f(init) << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct Event {
int t, d, a;
Event() {}
Event(int _t, int _d, int _a) : t(_t), d(_d), a(_a) {}
bool operator<(const Event& _oth) const {
return t < _oth.t;
}
};
void solve() {
int R, K;
cin >> R >> K;
vector<Event> es;
for (int _ = 0; _ < K; _++) {
int t; cin >> t;
es.emplace_back(t, -1, 0);
}
int Q; cin >> Q;
for (int _ = 0; _ < Q; _++) {
int t,a;
cin >> t >> a;
es.emplace_back(t, 1, a);
}
sort(es.begin(), es.end());
int l = 0, r = R, x = 0;
int t = 0, d = -1;
for (auto& e: es) {
x += d * (e.t - t); t = e.t; d *= e.d;
l = min(max(l,-x), -x+R);
r = min(max(r,-x), -x+R);
if (e.d > 0) {
int a = min(max(e.a, l), r);
cout << (a + x) << "\n";
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int K = 1e5+9;
ll r[K];
inline ll read() {
ll s = 1, a = 0; char ch = getchar();
while (ch < '0' || ch > '9') {if (ch == '-') s = -1; ch = getchar();}
while (ch >= '0' && ch <= '9') {a = a * 10 + ch - '0'; ch = getchar();}
return s * a;
}
inline void turn(ll &v, ll x) {
if (v < 0) v = 0;
if (v > x) v = x;
}
int main() {
ll x = read(), k = read();
for (int i = 1; i <= k; i++) r[i] = read();
ll q = read();
ll low = 0, mid = 0, upp = x;
int i = 1, sign = -1;
while (q--) {
ll t = read(), a = read();
while (i <= k && r[i] <= t) {
ll dta = (r[i] - r[i - 1]) * sign;
low += dta, upp += dta, mid += dta;
turn(low, x), turn(upp, x);
i++, sign *= -1;
}
ll res = a + mid;
ll dta = (t - r[i - 1]) * sign;
if (res < low) res = low;
if (res > upp) res = upp;
res += dta, turn(res, x);
printf("%lld\n", res);
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3e5+1;
const int inf = 0x7ffffff;
int X,k,Q,ans[N];
struct nd{int t,a,id;}q[N];
bool cmp(nd a,nd b){return a.t<b.t;}
int up(int &x){if(x<0)x=0;if(x>X)x=X;}
int main()
{
scanf("%d%d",&X,&k);
for(int i=1;i<=k;++i)scanf("%d",&q[i].t);
scanf("%d",&Q);
for(int i=1;i<=Q;++i)
scanf("%d%d",&q[i+k].t,&q[i+k].a),q[i+k].id=i;
sort(q+1,q+Q+k+1,cmp);
int a=0,b=X,l=0,r=X,tag=-1,pre=0;
for(int i=1;i<=Q+k;++i)
{
if(q[i].id)
{
int ret=0,res=q[i].t-pre;
if(q[i].a<=l)ret=a;
else if(q[i].a>=r)ret=b;
else ret=a-l+q[i].a;
ret+=res*tag;
up(ret);
ans[q[i].id]=ret;
}
else
{
int v=q[i].t-pre;
if(tag==-1)
{
if(v>a)
{
b-=v;l+=v-a;
up(b);up(l);
if(r<l)r=l;
a=0;
}
else a-=v,b-=v;
}
else
{
if(v+b>X)
{
a+=v;r-=b+v-X;
up(a);up(r);
if(r<l)l=r;
b=X;
}
else a+=v,b+=v;
}
tag*=-1;
pre=q[i].t;
}
}
for(int i=1;i<=Q;++i)printf("%d\n",ans[i]);
}
|
#include<bits/stdc++.h>
using namespace std;
inline long long getnum()
{
long long now=0;long long fh=1;char ch=getchar();
while(ch<'0' || ch>'9'){if(ch=='-')fh=-1;ch=getchar();}
while(ch>='0' && ch<='9'){now=(now<<3)+(now<<1)+ch-'0';ch=getchar();}
return now*fh;
}
int r[100003],mx[100003],mn[100003],ans,n,q,k,x,ans0[100003],ansx[100003],f,t;
int ai,ti;
int qz[100003];
int find(int t)//correct
{
int bl=0;
int br=k+1;
int mid;
while (br-bl>1)
{
mid=(bl+br)>>1;
if (r[mid]>t) br=mid;else bl=mid;
}
return bl;
}
int main()
{
x=getnum();
k=getnum();
for (int i=1;i<=k;i++)
{
r[i]=getnum();
}
q=getnum();
f=-1;
ansx[0]=x;
mx[0]=x;
for (int i=1;i<=k;i++)
{
ans0[i]=ans0[i-1]+f*(r[i]-r[i-1]);
ans0[i]=max(ans0[i],0);
ans0[i]=min(ans0[i],x);
ansx[i]=ansx[i-1]+f*(r[i]-r[i-1]);
ansx[i]=max(ansx[i],0);
ansx[i]=min(ansx[i],x);
qz[i]=qz[i-1]+f*(r[i]-r[i-1]);
f=-f;
}
f=-1;
for (int i=1;i<=k;i++)
{
t+=f*(r[i]-r[i-1]);
mn[i]=max(mn[i-1],-t);
mx[i]=min(mx[i-1],x-t);
f=-f;
//printf("%d %d %d\n",t,mn[i],mx[i]);
}
while(q--)
{
ti=getnum();
ai=getnum();
int la=find(ti);
int ans;
if (mn[la]<=ai&&mx[la]>=ai)
ans=ai+qz[la]+((la%2)*2-1)*(ti-r[la]);//la%2==1:+ ==0:-
else
if (mn[la]>ai)
ans=ans0[la]+((la%2)*2-1)*(ti-r[la]);
else
ans=ansx[la]+((la%2)*2-1)*(ti-r[la]);
ans=max(ans,0);
ans=min(ans,x);
printf("%d\n", ans);
}
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int X, K;
int r[100005];
int Q;
int lb[100005], ub[100005];
int sum[100005], Max[100005], Min[100005];
int main(void)
{
cin >> X >> K;
for(int i = 1; i <= K; i++) cin >> r[i];
for(int i = 1; i <= K; i++){
if(i % 2) sum[i] = sum[i-1] - (r[i] - r[i-1]);
else sum[i] = sum[i-1] + (r[i] - r[i-1]);
}
Max[0] = X, ub[0] = X;
for(int i = 1; i <= K; i++){
ub[i] = ub[i-1];
if(i % 2){
Max[i] = Max[i-1] - (r[i] - r[i-1]);
if(Max[i] < 0) Max[i] = 0;
}
else{
Max[i] = Max[i-1] + (r[i] - r[i-1]);
if(Max[i] > X){
ub[i] -= Max[i] - X;
Max[i] = X;
}
}
}
Min[0] = 0, lb[0] = 0;
for(int i = 1; i <= K; i++){
lb[i] = lb[i-1];
if(i % 2){
Min[i] = Min[i-1] - (r[i] - r[i-1]);
if(Min[i] < 0){
lb[i] += -Min[i];
Min[i] = 0;
}
}
else{
Min[i] = Min[i-1] + (r[i] - r[i-1]);
if(Min[i] > X) Min[i] = X;
}
}
cin >> Q;
int t, a, pos, val;
for(int q = 0; q < Q; q++){
cin >> t >> a;
pos = upper_bound(r, r+K+1, t) - r-1;
if(a <= lb[pos]) val = Min[pos];
else if(a >= ub[pos]) val = Max[pos];
else val = a + sum[pos];
if(pos % 2){
val += t - r[pos];
val = min(val, X);
}
else{
val -= t - r[pos];
val = max(val, 0);
}
cout << val << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))
using ll = long long;
using P = std::tuple<int,int>;
const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};
vector<tuple<int, int, int> > v;
int main(){
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
ll X, K;
std::cin >> X >> K;
for(int i=0;i<K;++i){
int r;
std::cin >> r;
v.emplace_back(r, 2, -1);
}
int Q;
std::cin >> Q;
for(int i=0;i<Q;++i){
int t, a;
std::cin >> t >> a;
v.emplace_back(t, 1, a);
}
sort(v.begin(), v.end());
// 今 max{lb, min{ub, x + s}}
ll lb = 0, ub = X, s = 0;
int lastTime = 0, sgn = -1;
for(const auto& p : v){
int t, qt, a;
tie(t, qt, a) = p;
int passedTime = t - lastTime;
if(qt == 1){
ll x = max(lb, min<ll>(ub, a + s));
x = max(0ll, min<ll>(X, x + sgn * passedTime));
std::cout << x << std::endl;
}else{
lb = max(0ll, min<ll>(X, lb + sgn * passedTime));
ub = max(0ll, min<ll>(X, ub + sgn * passedTime));
s += sgn * passedTime;
sgn *= -1;
lastTime = t;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int X;
int K;
cin >> X >> K;
vector<int> r(K + 1);
r[0] = 0;
for (int i = 1; i <= K; i++) cin >> r[i];
int Q;
cin >> Q;
int L = 0, R = X, c = 0;
for (int i = 0, j = 1; i < Q; i++) {
int t, a;
cin >> t >> a;
while (j <= K && t >= r[j]) {
if (j % 2 == 1) {
c -= r[j] - r[j - 1];
} else {
c += r[j] - r[j - 1];
}
R = max(min(R, X - c), -c);
L = min(max(L, -c), X - c);
j++;
}
int ans;
if (a < L) {
ans = L + c;
} else if (a > R) {
ans = R + c;
} else {
ans = a + c;
}
if (j % 2 == 1) ans = max(ans - t + r[j - 1], 0);
else ans = min(ans + t - r[j - 1], X);
cout << ans << endl;
}
return 0;
}
|
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll X, K;
cin >> X >> K;
int r[100002];
rep1(i, K) cin >> r[i];
r[0] = 0;
r[K + 1] = 2e9;
ll L = 0;
ll R = X;
ll takasa = 0;
int katamuki = -1;
int *ri = r + 1;
int Q;
cin >> Q;
rep(i, Q) {
ll t, a;
cin >> t >> a;
while (t > *ri) {
takasa += katamuki * (*ri - *(ri - 1));
ll nl = takasa + L;
ll nr = takasa + R;
if (katamuki < 0) {
if (nl < 0) L -= nl;
if (nr < 0) R -= nr;
}
else {
if (nl > X) L -= nl - X;
if (nr > X) R -= nr - X;
}
ri++;
katamuki *= -1;
}
chmax(a, L);
chmin(a, R);
a += takasa + katamuki * (t - *(ri - 1));
chmax(a, 0ll);
chmin(a, X);
co(a);
}
Would you please return 0;
}
|
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<functional>
#include<tuple>
using namespace std;
int X, K, Q, p[100009], ans[100009], L = 0, R, s = 0, t; bool unity = false;
int l[100009], r[100009], v[100009]; bool u[100009];
int main() {
cin >> X >> K; R = X; t = X;
for (int i = 1; i < 100009; i++)p[i] = 1000000009;
for (int i = 1; i <= K; i++)cin >> p[i]; p[K + 1] = 1000000007; K += 2;
l[0] = 0; r[0] = R; v[0] = 0;
for (int i = 1; i < K; i++) {
if (i % 2 == 1) { s -= (p[i] - p[i - 1]); t -= (p[i] - p[i - 1]); if (s < 0) { L += (-s); s = 0; }if (t < 0) { unity = true; } }
if (i % 2 == 0) { s += (p[i] - p[i - 1]); t += (p[i] - p[i - 1]); if (s > X) { s = X; unity = true; }if (t > X) { R -= (t - X); t = X; } }
if (L >= R)unity = true;
u[i] = unity; l[i] = L; r[i] = R; v[i] = s;
}
cin >> Q;
for (int i = 0; i < Q; i++) {
int p1, p2; cin >> p1 >> p2;
int pos1 = upper_bound(p, p + K, p1) - p; pos1--;
int GG = max(l[pos1], min(r[pos1], p2)) - l[pos1]; GG += v[pos1];
if (pos1 % 2 == 0)GG -= (p1 - p[pos1]); else GG += (p1 - p[pos1]);
GG = max(0, min(X, GG));
cout << GG << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn=1e5+10;
int n,m,X,l=0,r,x=0,k=1,s=-1,tmp=0,tim,A,a[maxn];
inline int calc(int l,int r,int x){
return max(l,min(r,x));
}
int main(){
scanf("%d%d",&X,&n);
for (int i=1; i<=n; i++) scanf("%d",&a[i]);
r=X;
scanf("%d",&m);
for (int i=1; i<=m; i++){
scanf("%d%d",&tim,&A);
while(k<=n && a[k]<=tim){
int d=s*(a[k]-tmp);
tmp=a[k];
x+=d;
k++;
s*=-1;
l=calc(0,X,l+d);
r=calc(0,X,r+d);
}
int p=tim-tmp;
A=calc(l,r,A+x);
A=calc(0,X,A+s*p);
printf("%d\n",A);
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 7;
int r[MAXN], t[MAXN], a[MAXN];
int main()
{
int X, k; scanf("%d%d", &X, &k);
for (int i = 1; i <= k; i++) scanf("%d", &r[i]);
r[k + 1] = 1e9 + 1;
int q; scanf("%d", &q);
for (int i = 1; i <= q; i++) scanf("%d%d", &t[i], &a[i]);
int i = 0, j = 1;
int low = 0, up = X, sig = -1, bound = 0;
int det, res;
while (j <= q)
{
if (i < k && t[j] >= r[i + 1])
{
i++;
det = sig * (r[i] - r[i - 1]);
low = max(min(low + det, X), 0);
up = max(min(up + det, X), 0);
bound += det;
sig *= -1;
}
else
{
det = t[j] - r[i];
res = max(min(a[j] + bound, up), low);
res = max(min(X, res + sig * det), 0);
printf("%d\n", res);
j++;
}
}
return 0;
}
|
#include<cstdio>
#include<algorithm>
#include<cstdlib>
using namespace std;
int X,n,r[100010],Q,delta[100010],num0[100010],numx[100010],t[100010],a[100010];
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",&t[i],&a[i]);
delta[0]=0;
num0[0]=0;
numx[0]=X;
for(int i=1;i<=n;i++)
{
num0[i]=num0[i-1];
numx[i]=numx[i-1];
if(i&1)
{
// delta[i]=delta[i-1]-r[i]+r[i-1];
num0[i]=max(num0[i],min(r[i]-r[i-1]-delta[i-1],numx[i]));
delta[i]=max(delta[i-1]+num0[i-1]-r[i]+r[i-1],0)-num0[i];
}
else
{
// delta[i]=delta[i-1]+r[i]-r[i-1];
numx[i]=min(numx[i],max(X-r[i]+r[i-1]-delta[i-1],num0[i]));
delta[i]=min(delta[i-1]+numx[i-1]+r[i]-r[i-1],X)-numx[i];
}
}
for(int i=1;i<=Q;i++)
{
int place=upper_bound(r+1,r+n+1,t[i])-r-1,ans=delta[place];
if(a[i]<=num0[place])ans+=num0[place];
else if(a[i]>=numx[place])ans+=numx[place];
else ans+=a[i];
if(place&1) ans=min(X,ans+t[i]-r[place]);
else ans=max(0,ans-t[i]+r[place]);
printf("%d\n",ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int X,n,q;
int r[100001],t[100000],a[100000];
int main() {
scanf("%d%d",&X,&n);
for(int i=1;i<=n;i++) scanf("%d",r+i);
scanf("%d",&q);
for(int i=0;i<q;i++) scanf("%d%d",t+i,a+i);
int sl=0,sr=X,ll=0,rr=X;
for(int i=0,j=1;i<q;i++) {
for(;j<=n && r[j]<=t[i];j++) {
int d=r[j]-r[j-1];
if(j%2==1) {
sl += max(d-ll,0);
sl = min(sl,sr);
ll = max(ll-d,0);
rr = max(rr-d,0);
} else {
sr -= max(d-(X-rr), 0);
sr = max(sl,sr);
rr = min(rr+d,X);
ll = min(ll+d,X);
}
}
a[i] = max(a[i],sl);
a[i] = min(a[i],sr);
int v=ll+(a[i]-sl);
if(j%2==1) v-=t[i]-r[j-1];
else v+=t[i]-r[j-1];
v = min(v,X); v=max(v,0);
printf("%d\n",v);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define db(x) cout << #x << "=" << x << " "
#define el cout << endl;
#define re(i, n) for(int i = 0; i < n; ++i)
const int MXN = 2e5 + 10;
int X, D, U, K, Q;
int R[MXN], T[MXN], A[MXN];
int clip(int x, int low = 0, int high = X) {
return max(low, min(x, high));
}
int delta = 0, tim = 0;
void adv(int t) {
delta += t, tim += abs(t);
U = clip(U + t);
D = clip(D + t);
}
int main() {
cin >> X >> K;
re(i, K) scanf("%d", R + i);
cin >> Q;
D = 0, U = X;
int p = 0;
re(i, Q) {
scanf("%d %d", T + i, A + i);
while (p < K && R[p] < T[i]) {
adv((R[p] - tim) * ((p & 1) * 2 - 1));
++p;
}
adv((T[i] - tim) * ((p & 1) * 2 - 1));
printf("%d\n", clip(A[i] + delta, D, U));
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int r[100005];
int X,K,Q,T,A,s,l,k,t,x,f;
int main()
{
f = -1;
cin >> X >> K;
FOR(i,0,K) cin >> r[i];
s = 0; // 下限
l = X; // 上限
t = 0;
k = 0;
x = 0;
for(cin>>Q;Q--;) {
cin >> T >> A;
while(k < K && T >= r[k]){
int d = f * (r[k] - t); // 変化量
x += d; // 全体の変化量
s = min(X, max(0, s + d));
l = min(X, max(0, l + d));
t = r[k];
k++;
f *= -1;
}
int xx = min(l, max(s, A + x)) + f * (T - t);
cout << min(X, max(0, xx)) << endl;
}
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,LA=0;
int R=X,RA=X;
for(pair<int,int>p:A)
{
if(p.second<0)
{
int t=p.first-pre;
pre=p.first;
if(d>0)
{
LA-=t;
RA-=t;
if(RA<0)
{
LA=RA=L=R=0;
}
else if(LA<0)
{
L+=-LA;
LA=0;
if(R<L)L=R;
}
}
else
{
RA+=t;
LA+=t;
if(LA>X)
{
LA=RA=L=R=X;
}
else if(RA>X)
{
R-=RA-X;
RA=X;
if(R<L)R=L;
}
}
d*=-1;
//cout<<"L : "<<L<<", LA : "<<LA<<endl;
//cout<<"R : "<<R<<", RA : "<<RA<<endl<<endl;
}
else
{
int a=p.second;
if(a<L)a=LA;
else if(a>R)a=RA;
else
{
a=LA+a-L;
}
int t=p.first-pre;
cout<<(d>0?max(0,a-t):min(a+t,X))<<endl;
}
}
}
|
#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 <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 << '\n';
}
return 0;
}
|
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long LL;
const int MX=100011;
LL x,k;int q;
LL r[MX];
struct Func{
LL k,b,L,R;//A=min(X,max(0,kt+b+a)),in[L,R]
Func(int _k=0,int _b=0,int _L=0,int _R=0):k(_k),b(_b),L(_L),R(_R){}
inline LL V(LL a,LL t){return min(x,max(0LL,k*t+b+min(R,max(L,a))));}
}f[MX];
int main(){
scanf("%lld%lld",&x,&k);
for(int i=1;i<=k;i++)scanf("%lld",&r[i]);
int K=-1;
Func cur(K,0,0,x);
f[0]=cur;
for(int i=1;i<=k;i++){
LL vl=f[i-1].V(f[i-1].L,r[i]),vr=f[i-1].V(f[i-1].R,r[i]);
K=-K;
if(vl>0&&vr<x){
f[i]=cur=Func(K,vl-f[i-1].L-K*r[i],f[i-1].L,f[i-1].R);
}else if(vr<x&&vr>0){
f[i]=cur=Func(K,vr-f[i-1].R-K*r[i],f[i-1].R-vr,f[i-1].R);
}else if(vl>0&&vl<x){
f[i]=cur=Func(K,vl-f[i-1].L-K*r[i],f[i-1].L,f[i-1].L+x-vl);
}else{//(vl==vr)
f[i]=cur=Func(K,vl-K*r[i],0,0);
}
}
scanf("%d",&q);
for(int i=1;i<=q;i++){
LL t,a;scanf("%lld%lld",&t,&a);
printf("%lld\n",f[upper_bound(r,r+k+1,t)-r-1].V(a,t));
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX=2e5+5;
const int INF=0x3f3f3f3f;
template<class T>bool gmax(T &a,T b){return a<b?a=b,1:0;}
template<class T>bool gmin(T &a,T b){return a>b?a=b,1:0;}
ll n,q,t,a,r[MAX],X;
int main()
{
scanf("%lld%lld",&X,&n);
for(int i=1;i<=n;i++)scanf("%lld",&r[i]);
scanf("%lld",&q);
ll minsand=0,maxsand=X,val=0,k=1,sign=-1;
while(q--)
{
scanf("%lld%lld",&t,&a);
while(k<=n&&r[k]<=t)
{
ll v=sign*(r[k]-r[k-1]);
minsand+=v;
maxsand+=v;
val+=v;
gmax(minsand,0ll);
gmin(minsand,(ll)X);
gmax(maxsand,0ll);
gmin(maxsand,(ll)X);
sign*=-1;
k++;
}
ll now=val+a;
gmax(now,minsand);
gmin(now,maxsand);
now+=sign*(t-r[k-1]);
gmax(now,0ll);
gmin(now,(ll)X);
printf("%lld\n",now);
}
}
|
#include"bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define int long long
int r[100006];
int t[100005], a[100005];
signed main() {
int x, k; cin >> x >> k;
rep(i, k)cin >> r[i+1];
int q; cin >> q;
rep(i, q)cin >> t[i] >> a[i];
t[q] = 1145141919;
r[k + 1] = 1145141919;
int u = 0, d = x, ux = 0, dx = x;
int now = 0;
rep(i, k+1) {
while (t[now] < r[i+1]) {
int ft = a[now];
if (ft < u)ft = u;
else if (d < ft)ft = d;
int D = t[now] - r[i];
if (i & 1) {
ft += D + ux - u;
ft = min(ft, x);
cout << ft << endl;
}
else {
ft -= D; ft += ux - u;
ft = max(0ll, ft);
cout << ft << endl;
}
now++;
}
int D = r[i + 1] - r[i];
if (i & 1) {
ux += D; dx += D;
if (dx > x) {
d -= dx - x;
dx = x;
}
if (ux > x) {
u = d = x;
ux = dx = x;
}
}
else {
ux -= D; dx -= D;
if (ux < 0) {
u += -ux;
ux = 0;
}
if (dx < 0) {
u = d = ux = dx = 0;
}
}
}
}
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 100010
using namespace std;
int n, m, t[N], w[N], a[N], l, r, lx, rx, sum, x, y, now, q;
int main(){
scanf("%d%d", &m, &n);
for(int i=1; i<=n; i++)scanf("%d", &t[i]);
scanf("%d", &q);
for(int i=1; i<=q; i++)scanf("%d%d", &w[i], &a[i]);
t[0]=0; t[n+1]=w[q]+1; now=0;
l=0; lx=0; r=m; rx=m; sum=0;
while(now<q&&w[now+1]<t[1]){now++; printf("%d\n", max(0, a[now]-w[now]));}
for(int i=1; i<=n; i++){
x=t[i]-t[i-1];
if(i&1){
if(l+1<=r-1&&l+1+sum-x<=0)l=min(m, x-sum);
if(l>=r)l=m; lx=max(0, lx-x);
if(l==m)r=1; rx=max(0, rx-x);
sum-=x;
}else{
if(l+1<=r-1&&r-1+sum+x>=m)r=max(0, m-x-sum);
if(r<=l)r=0; rx=min(m, rx+x);
if(!r)l=m; lx=min(m, lx+x);
sum+=x;
}
while(now<q&&w[now+1]<t[i+1]){
now++;
if(a[now]<=l)y=lx;
if(l<a[now]&&a[now]<r)y=a[now]+sum;
if(a[now]>=r)y=rx;
if(i&1)printf("%d\n", min(m, y+w[now]-t[i]));
else printf("%d\n", max(0, y-(w[now]-t[i])));
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int r[100001];
int main(){
#ifdef DEBUG
freopen("input.txt", "r", stdin);
#endif
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;
int j = 0;
int d = 0;
int mn = 0;
int mx = x;
int valmn = 0;
int valmx = x;
for (int i = 0; i < q; i++){
int t1, a1;
cin >> t1 >> a1;
while (j + 1 <= k && t1 >= r[j + 1]){
int ch = r[j + 1] - r[j];
if (j & 1){
mx = min(mx, mx + (x - valmx - ch));
valmn = min(valmn + ch, x);
valmx = min(valmx + ch, x);
} else {
mn = max(mn, mn + ch - valmn);
valmn = max(valmn - ch, 0);
valmx = max(valmx - ch, 0);
}
j++;
}
int ans;
if (a1 <= mn){
ans = valmn;
} else if (a1 >= mx){
ans = valmx;
} else {
ans = valmn + (a1 - mn);
}
if (j & 1) {
ans = min(ans + (t1 - r[j]), x);
} else {
ans = max(ans - (t1 - r[j]), 0);
}
cout << ans << "\n";
}
return 0;
}
|
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int MAX_N = 100005;
typedef long long i64;
int R[MAX_N], X, K, Q;
void get(i64 &temp) {
if (temp < 0) temp = 0;
if (temp > X) temp = X;
}
int main() {
scanf("%d%d", &X, &K);
for (int i = 1; i <= K; ++i)
scanf("%d", &R[i]);
scanf("%d", &Q);
i64 sum = 0, mul = -1;
i64 mn = 0, mx = X;
int l = 1;
while (Q--) {
int T;
i64 A;
scanf("%d%lld", &T, &A);
while (l <= K && R[l] <= T) {
sum += (R[l] - R[l - 1]) * mul;
mn += (R[l] - R[l - 1]) * mul;
mx += (R[l] - R[l - 1]) * mul;
get(mn), get(mx), mul = -mul;
l++;
}
A += sum;
if (A < mn) A = mn;
if (A > mx) A = mx;
A += (T - R[l - 1]) * mul;
get(A);
printf("%lld\n", A);
}
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int X,K,Q,maxn[100001],minn[100001],r[1000001],f[1000001],t,a,ans;
int main(){
scanf("%d%d",&X,&K);maxn[0]=X;for(int i=1;i<=K;++i)scanf("%d",r+i);
for(int i=1;i<=K;++i){
int t=r[i]-r[i-1];maxn[i]=maxn[i-1],minn[i]=minn[i-1];
if(i&1)minn[i]=max(minn[i],min(maxn[i],t-f[i-1])),f[i]=max(minn[i-1]+f[i-1]-t,0)-minn[i];
else maxn[i]=min(maxn[i],max(minn[i],X-t-f[i-1])),f[i]=min(maxn[i-1]+f[i-1]+t,X)-maxn[i];
}
scanf("%d",&Q);
for(int i=1;i<=Q;++i){
scanf("%d%d",&t,&a);
int j=upper_bound(r+1,r+K+1,t)-r-1,p=t-r[j];
a=max(minn[j],a),a=min(maxn[j],a);
ans=a+f[j];
if(j&1)ans=min(X,ans+p);else ans=max(0,ans-p);
printf("%d\n",ans);
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define N 101000
#define ll long long
struct query {
int t,s;
}e[N];
int n,m,sgn=-1,k=1;
int T[N];
ll mx,mn,h,X;
void cal(ll &k) {
if (k>X) k=X;
if (k<0) k=0;
}
int main()
{
scanf("%lld%d",&X,&n);
for (int i=1;i<=n;i++) scanf("%d",&T[i]);
scanf("%d",&m);
for (int i=1;i<=m;i++) scanf("%d%d",&e[i].t,&e[i].s);
mn=0; mx=X;
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;
cal(mx); cal(mn);
sgn*=-1; k++;
}
ll now=e[i].s+h,nowh=(e[i].t-T[k-1])*sgn;
if (now>mx) now=mx;
if (now<mn) now=mn;
now+=nowh;
cal(now);
printf("%lld\n",now);
}
return 0;
}
|
#include <bits/stdc++.h>
typedef long long i64;
using std::cout;
using std::endl;
using std::cin;
int main(){
int X, k, Q; cin >> X >> k; std::vector<int> r(k + 2, (1 << 30));
for(int i = 0; i < k; i++) cin >> r[i + 1]; r[0] = 0;
cin >> Q;
int tap = 0, lis = X; // 潰れヴァリュー
int low = 0, high = X; // 潰れ判定
int cnt = 0, sum = 0;
for(int i = 0; i < Q; i++) {
int t, a; cin >> t >> a;
while(r[cnt + 1] <= t) {
int d = r[cnt + 1] - r[cnt];
if(cnt % 2) {
int uku = std::max(0, lis + d - X);
high -= uku;
tap = std::max(0, std::min(X, tap + d));
lis = std::max(0, std::min(X, lis + d));
} else {
int luz = std::max(0, -(tap - d));
low += luz;
tap = std::max(0, std::min(X, tap - d));
lis = std::max(0, std::min(X, lis - d));
}
cnt += 1;
}
int d = t - r[cnt];
if(cnt % 2) {
if(low <= a and a <= high) cout << std::max(0, std::min(X, tap + a - low + d)) << endl;
else if(a < low) cout << std::max(0, std::min(X, tap + d)) << endl;
else cout << std::max(0, std::min(X, lis + d)) << endl;
} else {
if(low <= a and a <= high) cout << std::max(0, std::min(X, tap + a - low - d)) << endl;
else if(a < low) cout << std::max(0, std::min(X, tap - d)) << endl;
else cout << std::max(0, std::min(X, lis - d)) << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
const int N = 100005;
int all, k, q, r[N], t[N], a[N];
int up, down, c;
int main() {
std::ios::sync_with_stdio(0), std::cin.tie(0);
std::cin >> all >> k;
for (int i = 1; i <= k; ++i)
std::cin >> r[i];
r[0] = 0, r[k + 1] = 1e9 + 1;
std::cin >> q; int p = 0;
for (int i = 0; i < q; ++i)
std::cin >> t[i] >> a[i];
up = all; int typ = 0;
for (int i = 0; i <= k && p < q; ++i) {
while (p < q && t[p] >= r[i] && t[p] < r[i + 1]) {
int x = std::min(std::max(a[p] + c, down), up), d = t[p++] - r[i];
if (typ) x = std::min(x + d, all); else x = std::max(x - d, 0);
std::cout << x << '\n';
}
int d = r[i + 1] - r[i];
if (typ) down = std::min(down + d, all), up = std::min(up + d, all), c += d;
else down = std::max(down - d, 0), up = std::max(up - d, 0), c -= d;
typ ^= 1;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int x,k;
cin>>x>>k;
int r[k];
for(int i=0;i<k;i++) cin>>r[i];
int q;
cin>>q;
int t[q],a[q];
for(int i=0;i<q;i++) cin>>t[i]>>a[i];
int L=0,R=x;//[L,R]
int j=0,p=0,d=0;
int lv=0,uv=x;
for(int i=0;i<q;i++){
while(j<k&&r[j]<=t[i]){
if(j%2==0){
p+=r[j]-d;
lv=max(lv-(r[j]-d),0LL);
uv=max(uv-(r[j]-d),0LL);
}else{p-=r[j]-d;
lv=min(lv+(r[j]-d),x);
uv=min(uv+(r[j]-d),x);
}
L=max(L,p);
R=min(R,x+p);
d=r[j++];
}
int c;
if(L<=a[i]&&a[i]<=R) c=a[i]-p;
if(a[i]<L) c=lv;
if(R<a[i]) c=uv;
if(j%2==0) c=max(c-(t[i]-d),0LL);
else c=min(c+(t[i]-d),x);
cout<<c<<endl;
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,x,n) for(int i=x;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
#define MP(a,b) make_pair(a,b)
typedef long long LL;
typedef pair<int, int> PI;
typedef vector<int> VI;
const LL MOD = 1000000007LL;
int r[100000];
int main() {
int X;
int K;
cin >> X;
cin >> K;
rep(i, K) cin >> r[i];
int Q;
cin >> Q;
int L = 0, R = X, C = 0;
int j = 0;
int prev = 0;
rep(i, Q) {
int t, a;
cin >> t >> a;
while (j < K&&r[j] <= t) {
int T = r[j] - prev;
if (j % 2 == 0) {
if (T > C) L = min(L + (T - C), R);
C = max(C - T, 0);
}
else {
if (T > X - ((R - L) + C)) R = max(R - (T - (X - ((R - L) + C))), L);
C = min(C + T, X);
}
prev = r[j];
j++;
}
int T = t - prev;
if (j % 2 == 0) {
if (T > C) L = min(L + (T - C), R);
C = max(C - T, 0);
}
else {
if (T > X - ((R - L) + C)) R = max(R - (T - (X - ((R - L) + C))), L);
C = min(C + T, X);
}
prev = t;
if (a <= L) {
cout << C << endl;
}
else if (R <= a) {
cout << (R - L) + C << endl;
}
else {
cout << (a - L) + C << endl;
}
}
}
|
#include <cstdio>
#include <algorithm>
#define Rep(i, n) for (int i = 1; i <= n; i ++)
#define Rep0(i, n) for (int i = 0; i <= n; i ++)
#define RepG(i, x) for (int i = head[x]; i; i = edge[i].next)
using namespace std;
typedef long long LL;
const int N = 100010;
LL r[N], a[N], b[N], z[N];
int main()
{
LL x, k;
scanf("%lld%lld", &x, &k);
a[0] = 0, b[0] = x;
Rep(i, k) {
scanf("%lld", &r[i]);
LL tmp = r[i] - r[i - 1];
a[i] = a[i - 1], b[i] = b[i - 1], z[i] = z[i - 1];
if (i & 1) {
if (z[i] >= tmp) z[i] -= tmp;
else if (tmp <= b[i] - a[i] + z[i])
a[i] += tmp - z[i], z[i] = 0;
else z[i] = 0, a[i] = 0, b[i] = 0;
}
else {
if (z[i] + b[i] - a[i] + tmp <= x) z[i] += tmp;
else if (z[i] + tmp <= x)
z[i] += tmp, b[i] -= z[i] + b[i] - a[i] - x;
else z[i] = x, a[i] = 0, b[i] = 0;
}
//printf("%lld %lld %lld\n", a[i], b[i], z[i]);
}
int q;
scanf("%d", &q);
Rep(i, q) {
LL a0, t0;
scanf("%lld%lld", &t0, &a0);
LL tmp = (upper_bound(r + 1, r + 1 + k, t0) - r) - 1;
LL ans;
if (a0 <= a[tmp]) ans = z[tmp];
else if (a0 <= b[tmp]) ans = z[tmp] + a0 - a[tmp];
else ans = z[tmp] + b[tmp] - a[tmp];
LL tx = t0 - r[tmp];
if ((tmp + 1) & 1) ans = max(0ll, ans - tx);
else ans = min(x, ans + tx);
printf("%lld\n", ans);
}
return 0;
}
/*
50 3
9 35 67
1
92 28
38
*/
|
#include <bits/stdc++.h>
using namespace std;
typedef long long lli;
typedef double lld;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<double> vdl;
typedef vector<vector<lli>> mat;
typedef vector<vdl> mad;
typedef unordered_map<lli,unordered_map<lli,lli>> graph;
typedef complex<double> cmp;
typedef vector<cmp> vcl;
lli x,k;
vll r;
lli q;
vll t,a;
int main(){
cin >> x >> k;
r = vll(k+1);
for(lli i = 1;i <= k;i++) cin >> r[i];
cin >> q;
t = a = vll(q);
for(lli i = 0;i < q;i++) cin >> t[i] >> a[i];
lli l,u,s;
l = 0;u = x;s = 0;
for(lli i = 0,j = 0;i < q;i++){
while(j+1 <= k && r[j+1] < t[i]){
if(j%2){
lli d = min(r[j+1]-r[j],x-l-s);
u = min(u,x-s-d);
s += d;
}else{
lli d = max(r[j]-r[j+1],-u-s);
l = max(l,-s-d);
s += d;
}
j++;
}
if(j%2){
lli d = min(t[i]-r[j],x-l-s);
u = min(u,x-s-d);
s += d;
}else{
lli d = max(r[j]-t[i],-u-s);
l = max(l,-s-d);
s += d;
}
r[j] = t[i];
if(a[i] <= l) cout << l+s << endl;
else if(a[i] >= u) cout << u+s << endl;
else cout << a[i]+s << endl;
}
return 0;
}
|
#include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <map>
#include <list>
#include <set>
#include <numeric>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <climits>
#include <cfloat>
#include <ctime>
#include <complex>
#include <cassert>
#include <array>
#include <bitset>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long LL;
typedef pair<int,int> P;
const int L=1e5+1;
int X;
int K;
int r[L];
int b[L];
int u[L];
int l[L];
int main() {
scanf("%d%d",&X,&K);
for(int i=1;i<=K;i++){
scanf("%d",r+i);
}
u[0]=X;
for(int i=1;i<=K;i++){
int d;
if(i%2){
d=-r[i]+r[i-1];
}
else{
d=r[i]-r[i-1];
}
b[i]=b[i-1]+d;
u[i]=u[i-1]+d;
l[i]=l[i-1]+d;
u[i]=max(0,min(X,u[i]));
l[i]=max(0,min(X,l[i]));
}
int Q;
scanf("%d",&Q);
for(int i=0;i<Q;i++){
int t,a;
scanf("%d%d",&t,&a);
int p=upper_bound(r,r+K+1,t)-r;
p--;
int s=a+b[p];
if(s<l[p]){
s=l[p];
}
else if(u[p]<s){
s=u[p];
}
if(p%2==0){
s-=t-r[p];
}
else{
s+=t-r[p];
}
s=max(0,min(X,s));
printf("%d\n",s);
}
return 0;
}
|
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int X, K;
cin >> X >> K;
int r[100002];
rep1(i, K) cin >> r[i];
r[0] = 0;
r[K + 1] = 2e9;
int L = 0;
int R = X;
int takasa = 0;
int katamuki = -1;
int *ri = r;
int Q;
cin >> Q;
rep(i, Q) {
int t, a;
cin >> t >> a;
while (t > *(ri + 1)) {
takasa += katamuki * (*(ri + 1) - *ri);
if (katamuki < 0) {
L -= min(0, takasa + L);
R -= min(0, takasa + R);
}
else {
L -= max(0, takasa + L - X);
R -= max(0, takasa + R - X);
}
ri++;
katamuki *= -1;
}
chmax(a, L);
chmin(a, R);
a += takasa + katamuki * (t - *ri);
chmax(a, 0);
chmin(a, X);
co(a);
}
Would you please return 0;
}
|
#include<cstdio>
#include<cctype>
#include<algorithm>
using namespace std;
int x,k,q,r[100010],maxn[100010],mini[100010],c[100010];
int rd(){
int x=0;
char c;
do c=getchar();
while(!isdigit(c));
do{
x=(x<<1)+(x<<3)+(c^48);
c=getchar();
}while(isdigit(c));
return x;
}
void InitInput(){
x=rd(),k=rd();
for(int i=1;i<=k;i++)
r[i]=rd();
maxn[0]=x,r[0]=mini[0]=c[0]=0;
for(int i=1;i<=k;i++){
maxn[i]=maxn[i-1];
mini[i]=mini[i-1];
if(i&1){
mini[i]=max(mini[i],min(r[i]-r[i-1]-c[i-1],maxn[i]));
c[i]=max(c[i-1]+mini[i-1]-r[i]+r[i-1],0)-mini[i];
}else{
maxn[i]=min(maxn[i],max(x-r[i]+r[i-1]-c[i-1],mini[i]));
c[i]=min(c[i-1]+maxn[i-1]+r[i]-r[i-1],x)-maxn[i];
}
}
return;
}
void Ask(){
q=rd();
for(int i=1;i<=q;i++){
int t=rd(),a=rd();
int pos=upper_bound(r+1,r+k+1,t)-r-1,ans=c[pos];
if(a<=mini[pos])
ans+=mini[pos];
else if(a>=maxn[pos])
ans+=maxn[pos];
else
ans+=a;
if(pos&1)
ans=min(x,ans+t-r[pos]);
else ans=max(0,ans-t+r[pos]);
printf("%d\n",ans);
}
}
int main(){
InitInput();
Ask();
return 0;
}
|
# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
using namespace std;
using LL = long long;
constexpr int MOD = 1000000000 + 7;
constexpr int INF = 2000000000;
const double PI = acos(-1);
int main() {
int x, k;
cin >> x >> k;
int r[100000];
for (int i = 0; i < k; i++) {
cin >> r[i];
}
int q;
cin >> q;
int t[100000], a[100000];
for (int i = 0; i < q; i++) {
cin >> t[i] >> a[i];
}
int L = 0, R = x;
int j = 0, p = 0, d = 0;
int lv = 0, uv = x;
for (int i = 0; i < q; i++) {
while (j < k&&r[j] <= t[i]) {
if (j % 2 == 0) {
p += r[j] - d;
lv = max(lv - (r[j] - d), 0);
uv = max(uv - (r[j] - d), 0);
}
else {
p -= r[j] - d;
lv = min(lv + (r[j] - d), x);
uv = min(uv + (r[j] - d), x);
}
L = max(L, p);
R = min(R, x + p);
d = r[j++];
}
int c;
if (L <= a[i] && a[i] <= R) c = a[i] - p;
if (a[i]<L) c = lv;
if (R<a[i]) c = uv;
if (j % 2 == 0) c = max(c - (t[i] - d), 0);
else c = min(c + (t[i] - d), x);
cout << c << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
struct Event {
int t;
int d;
int a;
bool operator<(const Event& r) const {
return t < r.t;
}
};
int R, K, Q;
int s[100000];
int t[100000];
int a[100000];
void sub(int t, int d, int a) {
static int prev_d = 1;
static int prev_t = 0;
static int l = 0;
static int r = R;
static int x = 0;
bool q = d == 0;
if (q) {
d = -prev_d;
}
x += d * (t - prev_t);
l = min(max(l, -x), -x + R);
r = min(max(r, -x), -x + R);
if (q) {
a = max(a, l);
a = min(a, r);
cout << x + a << endl;
}
if (!q) {
prev_d = d;
}
prev_t = t;
}
int main() {
cin >> R >> K;
for (int i = 0; i < K; ++i) cin >> s[i];
cin >> Q;
for (int i = 0; i < Q; ++i) cin >> t[i] >> a[i];
vector<Event> es;
int d = -1;
for (int i = 0; i < K; ++i) {
es.push_back(Event{ s[i], d, 0 });
d = -d;
}
for (int i = 0; i < Q; ++i) {
es.push_back(Event{ t[i], 0, a[i] });
}
sort(es.begin(), es.end());
for (auto e : es) {
sub(e.t, e.d, e.a);
}
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
// a == -1 is a turn query
struct Query {
int t, a;
Query (int _t, int _a) : t(_t), a(_a) {}
};
bool operator< (Query p, Query q) {
return p.t < q.t;
}
int main () {
ios::sync_with_stdio(false);
int cap;
cin >> cap;
int K;
cin >> K;
vector<Query> queries;
for (int i = 0; i < K; i++) {
int r;
cin >> r;
queries.push_back(Query(r, -1));
}
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
int t, a;
cin >> t >> a;
queries.push_back(Query(t, a));
}
sort(queries.begin(), queries.end());
int speed = -1, last = 0, l = 0, r = cap, add = 0;
for (Query q : queries) {
add += speed * (q.t - last);
last = q.t;
if (speed == -1) {
l = max(l, -add);
if (l > r) r = l;
} else {
r = min(r, cap - add);
if (r < l) l = r;
}
if (q.a == -1) {
speed *= -1;
} else {
q.a = min(q.a, r);
q.a = max(q.a, l);
cout << q.a + add << '\n';
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int X, K;
cin >> X >> K;
vector<int> r(K + 1); r[0] = 0;
for (int i = 0; i < K; i++) cin >> r[i + 1];
int Q;
cin >> Q;
vector<int> t(Q), a(Q);
for (int i = 0; i < Q; i++) cin >> t[i] >> a[i];
int now = 0, pos = 0;
int L = 0, R = X;
int va = 0, vb = X;
for (int i = 0; i < Q; i++) {
for (int j = now + 1; j <= K; j++) {
if (r[j] > t[i]) break;
if (j % 2 == 1) {
pos += r[j] - r[j - 1];
va = max(0, va - (r[j] - r[j - 1]));
vb = max(0, vb - (r[j] - r[j - 1]));
} else {
pos -= r[j] - r[j - 1];
va = min(X, va + (r[j] - r[j - 1]));
vb = min(X, vb + (r[j] - r[j - 1]));
}
L = max(L, pos);
R = min(R, X + pos);
now++;
}
int c;
if (L <= a[i] && a[i] <= R) c = a[i] - pos;
if (a[i] < L) c = va;
if (R < a[i]) c = vb;
c = (now % 2 == 0) ? max(0, c - (t[i] - r[now])) : min(X, c + (t[i] - r[now]));
cout << c << endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
const int z = 100001;
int x, k, r[z], s[z], o[z], w[z], q, i;
cin >> x;
cin >> k;
int v = -1;
r[0] = w[0] = o[0] = 0;
s[0] = x;
for (i = 1; i <= k; i++, v *= -1) {
cin >> 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);
}
cin >> q;
i = 0;
while(q--) {
int t, a;
cin >> 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);
cout << min(max(ans, 0), x) << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=100005;
int m,n,Q;
struct func{
int a,b,w,t,k;
int g(int x){
if(x<=a)return w;
if(x<=b)return w+x-a;
return w+b-a;
}
void expand(int dt){
t+=dt;w+=dt*k;k=-k;
if(w+b-a<=0)a=b=m,w=0;else if(w<0)a-=w,w=0;
if(w>=m)a=b=m,w=m;else if(w+b-a>m)b-=w+b-a-m;
}
}f[N];
bool operator<(const int&a,const func&b){return a<b.t;}
int main(){
scanf("%d%d",&m,&n);
f[0]=(func){0,m,0,0,-1};
for(int i=1,t;i<=n;i++)f[i]=f[i-1],scanf("%d",&t),f[i].expand(t-f[i].t);
scanf("%d",&Q);
for(int t,a,p,r;Q--;){
scanf("%d%d",&t,&a);
p=upper_bound(f,f+n+1,t)-f-1;
r=f[p].g(a)+(t-f[p].t)*f[p].k;
if(r<0)r=0;if(r>m)r=m;
printf("%d\n",r);
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int zs,ctw,n,q,nt,nv,nfx=1,nzl,xyz,fzt[N],fw1[N],fw2[N];
void mchange()
{
int kbl=fzt[ctw+1]-fzt[ctw];
if(nfx==1)
{
fw1[ctw+1]=max(0,fw1[ctw]-kbl);
fw2[ctw+1]=max(0,fw2[ctw]-kbl);
nzl-=kbl;
}
else
{
fw1[ctw+1]=min(zs,fw1[ctw]+kbl);
fw2[ctw+1]=min(zs,fw2[ctw]+kbl);
nzl+=kbl;
}
nfx=nfx*(-1);
}
int main()
{
//freopen("c4.in","r",stdin);
//freopen("test.out","w",stdout);
int i,j;
scanf("%d",&zs);
scanf("%d",&n);
for(i=1;i<=n;++i)
{
scanf("%d",&fzt[i]);
}
scanf("%d",&q);
fw2[0]=zs;
for(i=1;i<=q;++i)
{
scanf("%d%d",&nt,&nv);
while(ctw<n&&fzt[ctw+1]<nt)
{
mchange();
ctw++;
}
if(nv+nzl>=fw1[ctw]&&nv+nzl<=fw2[ctw]) xyz=nv+nzl;
if(nv+nzl<fw1[ctw]) xyz=fw1[ctw];
if(nv+nzl>fw2[ctw]) xyz=fw2[ctw];
int kbl=nt-fzt[ctw];
if(nfx==1) xyz=max(0,xyz-kbl);
else xyz=min(zs,xyz+kbl);
printf("%d\n",xyz);
}
return 0;
}
|
//f(t, a) (t固定) : ____/----の形をしているから, (__の値b, --の値c, __の終わりd, --の始まりe)を適当に更新する.
#include <iostream>
#include <algorithm>
#define int long long
using namespace std;
int x;
int k;
int r[100001];
int q;
int t[100000], a[100000];
int h(int i) {
if (i & 1) return -1;
return 1;
}
signed main() {
int i;
cin >> x >> k;
for (i = 1; i <= k; i++) cin >> r[i];
int b = 0, c = x, d = 0, e = x, j = 1;
cin >> q;
for (i = 0; i < q; i++) {
cin >> t[i] >> a[i];
for (; j <= k && r[j] <= t[i]; j++) {
if (h(j) == -1) d = d + max(0LL, r[j] - r[j - 1] - b);
b = min(x, max(0LL, b + h(j) * (r[j] - r[j - 1])));
c = min(x, max(0LL, c + h(j) * (r[j] - r[j - 1])));
e = d + (c - b);
}
int ans;
if (a[i] <= d) ans = b;
else if (a[i] <= e) ans = b + (a[i] - d);
else ans = c;
ans = min(x, max(0LL, ans + h(j) * (t[i] - r[j - 1])));
cout << ans << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N = 100005;
int X,K,Q,r[N],t[N],x[N],la,lb,a,b,c,t1,t2,add,tmp,diff,f;
int main() {
// freopen("data.in","r",stdin);
cin>>X;
cin>>K;
for(int i=1;i<=K;i++)
cin>>r[i];
cin>>Q;
for(int i=1;i<=Q;i++)
cin>>t[i]>>x[i];
t1=0,t2=1;
a=0,b=X,f=-1;
while(t2<=Q) {
if(t[t2]>r[t1+1]&&t1<K) {
t1++;
add=f*(r[t1]-r[t1-1]);
// b=max(0ll,max(0ll,min(X,X-f*add))-c);
// a=min(X,min(X,max(0ll,0ll-f*add))-c);
b+=add,a+=add;
b=max(0,min(X,b)),a=max(0,min(X,a));
c+=add;
f*=-1;
}
else {
diff=t[t2]-r[t1];
tmp=max(a,min(b,x[t2]+c));
tmp+=diff*f;
tmp=max(0,min(X,tmp));
cout<<tmp<<endl;
t2++;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pi = pair<int, int>;
const int MAXN = 1000005;
int x, n;
int t[MAXN], p[MAXN], q[MAXN], l[MAXN];
int main(){
scanf("%d %d",&x,&n);
l[0] = x;
for(int i=1; i<=n; i++){
scanf("%d",&t[i]);
int del = t[i] - t[i-1];
tie(p[i], q[i], l[i]) = make_tuple(p[i-1], q[i-1], l[i-1]);
if(i & 1){
int dx = min(del, q[i]);
q[i] -= dx;
del -= dx;
dx = min(del, l[i]);
p[i] += dx;
l[i] -= dx;
}
else{
int dx = min(del, x - q[i] - l[i]);
q[i] += dx;
del -= dx;
dx = min(del, l[i]);
q[i] += dx;
l[i] -= dx;
}
// printf("%d %d %d\n", p[i], q[i], l[i]);
}
int qr;
scanf("%d",&qr);
for(int i=0; i<qr; i++){
int ti, v; scanf("%d %d",&ti,&v);
int pos= upper_bound(t, t + n + 1, ti) - t - 1;
int now = 0;
if(v <= p[pos]) now = q[pos];
else now = q[pos] + min(l[pos], v - p[pos]);
ti -= t[pos];
if(pos % 2 == 0) now = max(0, now - ti);
else now = min(x, now + ti);
printf("%d\n", now);
}
}
|
#include<iostream>
#define m(a) min(X,max(0,a))
using namespace std;
int r[200000];
int X,K,Q,T,A,s,l,k,t,x,f=-1;
int main()
{
cin>>X>>K;
for(;l<K;)cin>>r[l++];
l = X;
for(cin >> Q; Q--;) {
cin >> T >> A;
for(; k<K&T>=r[k]; ) {
int d = f * (r[k] - t);
x += d;
s=m(s+d);
l=m(l+d);
t = r[k];
k++;
f *= -1;
}
cout << m(min(l, max(s, A + x)) + f * (T-t)) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int X,K,Q,r[N],t[N],x[N],la,lb,a,b,c,t1,t2,add,tmp,diff,f;
int main() {
// freopen("input.txt", "r", stdin);
cin>>X;
cin>>K;
for(int i=1;i<=K;i++)
cin>>r[i];
cin>>Q;
for(int i=1;i<=Q;i++)
cin>>t[i]>>x[i];
t1=0,t2=1;
a=0,b=X,f=-1;
while(t2<=Q) {
if(t[t2]>r[t1+1]&&t1<K) {
t1++;
add=f*(r[t1]-r[t1-1]);
b+=add,a+=add;
b=max(0,min(X,b)),a=max(0,min(X,a));
c+=add;
f*=-1;
}
else {
diff=t[t2]-r[t1];
tmp=max(a,min(b,x[t2]+c));
tmp+=diff*f;
tmp=max(0,min(X,tmp));
cout<<tmp<<endl;
t2++;
}
}
return 0;
}
|
#include<bits/stdc++.h>
#define N 200000
typedef long long LL;
using namespace std;
int r[N], X, k, Q;
int calc(LL x) {
if (x > X) x = X;
if (x < 0) x = 0;
return x;
}
int main() {
cin >> X >> k;
for(int i = 1; i <= k; i++) scanf("%d", &r[i]);
cin >> Q;
int p = 1, L = 0, R = X, ty = -1;
LL now = 0;
while (Q--) {
int t, a;scanf("%d%d", &t, &a);
while (p <= k && r[p] <= t) {
int tmp = (r[p] - r[p - 1]) * ty;
L = calc((LL)L + tmp), R = calc((LL)R + tmp), now = now + tmp;
p++, ty *= -1;
}
int det = t - r[p - 1], ret = now + a;
if (ret > R) ret = R;
if (ret < L) ret = L;
ret = calc((LL)ret + det * ty);
printf("%d\n", ret);
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = (1e5)+1;
int X, n, q;
long long r[MAX], t[MAX], a[MAX];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> X >> n;
for(int i = 1; i <= n; i++) cin >> r[i];
cin >> q;
long long mn = 0, mx = X, sum = 0;
for(int i = 1, j = 1, mul = -1; i <= q; i++) {
cin >> t[i] >> a[i];
while(j <= n && r[j] <= t[i]) {
sum += mul * (r[j] - r[j-1]);
mn += mul * (r[j] - r[j-1]);
mx += mul * (r[j] - r[j-1]);
mn = max(0ll, mn);
mn = min(1ll * X, mn);
mx = max(0ll, mx);
mx = min(1ll * X, mx);
mul *= -1;
++j;
}
a[i] += sum;
if(a[i] < mn) a[i] = mn;
if(a[i] > mx) a[i] = mx;
a[i] += mul * (t[i] - r[j-1]); // always over 1
a[i] = max(0ll, a[i]);
a[i] = min(1ll * X, a[i]);
cout << a[i] << '\n';
}
}
|
#include<iostream>
#include<cstdio>
using namespace std;
const int N=1e5+10;
int sm,n,t,q,a,r[N],v[N];
int main(){
scanf("%d%d",&sm,&n);
for (int i=1;i<=n;++i) scanf("%d",r+i);
for (int i=n;i;--i) v[i]=r[i]-r[i-1];
int low=0,lh=0;
int up=sm,uh=sm;
int pos=0;r[n+1]=2e9;
scanf("%d",&q);
while (q--){
scanf("%d%d",&t,&a);
while (r[pos+1]<=t){
++pos;
if (pos&1){//ÏòÏÂv[pos]
if (lh<v[pos]) low+=v[pos]-lh;
lh=max(lh-v[pos],0);
uh=max(uh-v[pos],0);
}else{//ÏòÉÏ
if (uh+v[pos]>sm) up-=uh+v[pos]-sm;
lh=min(lh+v[pos],sm);
uh=min(uh+v[pos],sm);
}
low=min(low,sm);
up=max(up,0);
}
t-=r[pos];
if (a<=low) a=lh;
else if (a>=up) a=uh;
else a=lh+a-low;
if (pos&1) printf("%d\n",min(a+t,sm));else printf("%d\n",max(a-t,0));
}
return 0;
}
|
#include<iostream>
using namespace std;
int r[200000];
int X, K, Q, T, A, s, l;
int main()
{
int k = 0, t = 0, x = 0, sign = -1;
cin >> X >> K;
for(int i = 0; i < K; i++) {
cin >> r[i];
}
l = X;
for(cin >> Q; Q; Q--) {
cin >> T >> A;
for(; k<K&T>=r[k]; ) {
int diff = sign * (r[k] - t);
x += diff;
s = min(X, max(0, s + diff));
l = min(X, max(0, l + diff));
t = r[k];
k++;
sign *= -1;
}
T -= t;
A = min(l, max(s, A + x));
A = min(X, max(0, A + sign * T));
cout << A << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,s,t) for (auto i=s; i<=t ;i++)
#define per(i,s,t) for (auto i=s; i>=t; i--)
using namespace std;
const int maxn=1e5+10;
int n,m,a[maxn];
int X,L,R,tmp=0,k=0,s=-1,x=0,tim,A,d,p,ans;
inline int mami(int l,int r,int x){
return max(l,min(r,x));
}
void fun(){
while(k<n&&a[k+1]<=tim){
d=s*(a[k+1]-tmp);
s*=-1;
x+=d;
tmp=a[k+1];
L=mami(0,X,L+d);
R=mami(0,X,R+d);
k++;
}
}
int main(){
scanf("%d%d",&X,&n);
L=0,R=X;
rep(i,1,n) scanf("%d",&a[i]);
scanf("%d",&m);
rep(i,1,m){
scanf("%d%d",&tim,&A);
fun();
p=tim-tmp;
ans=mami(L,R,A+x);
ans=mami(0,X,ans+s*p);
printf("%d\n",ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define MAXN 100002
typedef long long ll;
ll sum[MAXN];
int r[MAXN], lo[MAXN], hi[MAXN];
int x, k;
void solve(int t, int a) {
int i = upper_bound(r+1, r+k+2, t) - r - 1;
int ans = (i%2 ? 1 : -1)*(t-r[i]);
if (a<=lo[i]-sum[i]) {
ans += lo[i];
} else if (a<=hi[i]-sum[i]) {
ans += sum[i] + a;
} else {
ans += hi[i];
}
cout << min(max(ans, 0), x) << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> x >> k;
for (int i = 1; i <= k; ++i) {
cin >> r[i];
sum[i] += sum[i-1] + ((i%2) ? -1 : 1)*(r[i]-r[i-1]);
}
r[k+1] = 2e9;
hi[0] = x;
for (int i = 1; i <= k+1; ++i) {
if (i%2) {
lo[i] = max(0, lo[i-1]-r[i]+r[i-1]);
hi[i] = max(0, hi[i-1]-r[i]+r[i-1]);
} else {
lo[i] = min(x, lo[i-1]+r[i]-r[i-1]);
hi[i] = min(x, hi[i-1]+r[i]-r[i-1]);
}
}
int q;
cin >> q;
for (int i = 0; i < q; ++i) {
int t, a;
cin >> t >> a;
solve(t, a);
}
return 0;
}
|
#include <bits/stdc++.h>
using std::max;
using std::min;
int x,n,Q,a,t,r[100005];
int main(){
scanf("%d",&x);
scanf("%d",&n);
for (int i=1;i<=n;i++) scanf("%d",&r[i]);
int lx=0,rx=x,ly=0,ry=x;
scanf("%d",&Q);
scanf("%d%d",&t,&a);
int now=-1;
for (int i=1;i<=n;i++){
while (t<=r[i] && Q){
t=t-r[i-1];
if (a<=lx) printf("%d\n",min(x,max(ly+t*now,0)));
else if (a>=rx) printf("%d\n",min(x,max(ry+t*now,0)));
else printf("%d\n",min(x,max(ly+(a-lx)+t*now,0)));
Q--;
if (Q==0) break;
scanf("%d%d",&t,&a);
}
int ti=r[i]-r[i-1];
if (now==-1){
if (ly-ti<0) lx+=ti-ly;
if (lx>x){
lx=x,rx=0;
ry=0;
}
ly=std::max(0,ly-ti);
ry=std::max(0,ry-ti);
}else{
if (ry+ti>x) rx-=(ry+ti-x);
if (rx<0){
lx=x,rx=0;
ly=x;
}
ly=std::min(x,ly+ti);
ry=std::min(x,ry+ti);
}
now=now*(-1);
}
while (Q){
t=t-r[n];
if (a<=lx) printf("%d\n",min(x,max(ly+t*now,0)));
else if (a>=rx) printf("%d\n",min(x,max(ry+t*now,0)));
else printf("%d\n",min(x,max(ly+(a-lx)+t*now,0)));
Q--;
if (Q==0) break;
scanf("%d%d",&t,&a);
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int x,k;
cin>>x>>k;
int r[k];
for(int i=0;i<k;i++) cin>>r[i];
int q;
cin>>q;
int t[q],a[q];
for(int i=0;i<q;i++) cin>>t[i]>>a[i];
int L=0,R=x;//[L,R]
int lb[k],ub[k];
fill_n(lb,k,0);
fill_n(ub,k,x);
int j=0,p=0,d=0;
int lv=0,uv=x;
for(int i=0;i<q;i++){
while(j<k&&r[j]<=t[i]){
if(j%2==0) p+=r[j]-d;
else p-=r[j]-d;
if(j%2==0){
lv=max(lv-(r[j]-d),0LL);
uv=max(uv-(r[j]-d),0LL);
}else{
lv=min(lv+(r[j]-d),x);
uv=min(uv+(r[j]-d),x);
}
L=max(L,p);
R=min(R,x+p);
lb[j]=L;
ub[j]=R;
d=r[j++];
}
//cout<<i<<" "<<j<<":"<<p<<endl;
//cout<<L<<" "<<R<<endl;
if(L<=a[i]&&a[i]<=R){
int c=a[i]-p;
if(j%2==0) c=max(c-(t[i]-d),0LL);
else c=min(c+(t[i]-d),x);
cout<<c<<endl;
}else if(a[i]<L){
int c=lv;
if(j%2==0) c=max(c-(t[i]-d),0LL);
else c=min(c+(t[i]-d),x);
cout<<c<<endl;
}else if(R<a[i]){
int c=uv;
if(j%2==0) c=max(c-(t[i]-d),0LL);
else c=min(c+(t[i]-d),x);
cout<<c<<endl;
}else{
cout<<"?"<<endl;
}
}
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<bitset>
using namespace std;
typedef long long LL;
const int N=2e5;
int gi() {
int w=0;bool q=1;char c=getchar();
while ((c<'0'||c>'9') && c!='-') c=getchar();
if (c=='-') q=0,c=getchar();
while (c>='0'&&c <= '9') w=w*10+c-'0',c=getchar();
return q? w:-w;
}
int R[N],ans[N];
struct P{ int t,a,id; inline bool operator < (const P &b) const { return t<b.t; } }p[N];
int main()
{
int s=gi(),n=gi(),m,i,t,k,l=0,r=s,d,sum=0;
for (i=1;i<=n;i++) R[i]=gi();
for (i=1,m=gi();i<=m;i++) p[i].t=gi(),p[i].a=gi(),p[i].id=i;
sort(p+1,p+1+m);
for (i=k=1,d=-1;i<=m;i++) {
for (;k<=n&&R[k]<=p[i].t;k++,d*=-1) {
l=max(0,l+d*(R[k]-R[k-1]));l=min(l,s);
r=max(0,r+d*(R[k]-R[k-1]));r=min(r,s);
sum+=d*(R[k]-R[k-1]);
}
t=max(p[i].a+sum,l);t=min(t,r);
t=max(0,t+d*(p[i].t-R[k-1]));t=min(t,s);
ans[p[i].id]=t;
}
for (i=1;i<=m;i++)
printf("%d\n",ans[i]);
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;
// The answer is bounded between [lo,hi]. Once they converge to lo=hi, the answer is pre-determined.
// dx is added to the initial condition a[qi], but we still bound the answer by [lo,hi].
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 <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);
scanf("%d %d", &x, &k);
for (int i = 1; i <= k; i++) scanf("%d", &r[i]);
scanf("%d", &q);
low = x, now = 1;
while (q--) {
scanf("%d %d", &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));
printf("%d\n", ans);
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define MAXN 100005
#define INF 0x3f3f3f3f
#define FIO "c"
#define ll long long
#define mid ((l+r)>>1)
#define lid (id<<1)
#define rid (id<<1|1)
template <class T>
inline void read(T &x)
{
T f=1;x=0;
char ch=getchar();
for (;!isdigit(ch) && ch!='-';ch=getchar());
if (ch=='-') ch=getchar(),f=-1;
for (;isdigit(ch);ch=getchar()) x=x*10+ch-'0';
x*=f;
}
int N,X,Q,t,a,cur=1,pre,mx,mi,r[MAXN],delta,flag=-1,ans;
inline int f(int x,int mi=0,int mx=X){return (x<mi||x>mx)?((x<mi)?mi:mx):x;}
int main()
{
// freopen(FIO".in","r",stdin);
// freopen(FIO".out","w",stdout);
read(X);read(N);
for (int i=1;i<=N;i++) read(r[i]);
read(Q);
mx=X;
while (Q--)
{
read(t);read(a);
while (t>=r[cur] && cur<=N)
{
delta=flag*(r[cur]-r[cur-1]);pre+=delta;
mx=f(mx+delta);mi=f(mi+delta);
flag=-flag;cur++;
}
ans = f(flag * (t - r[cur - 1]) + f(a + pre, mi, mx));
printf("%d\n",ans);
}
fclose(stdin);fclose(stdout);
return 0;
}
|
#include <bits/stdc++.h>
const int N = 100054;
int V, n, q, t;
int k1, k2, k3;
int rev[N];
bool Up = false;
inline void up(int &x, const int y) {x < y ? x = y : 0;}
inline void down(int &x, const int y) {x > y ? x = y : 0;}
inline int min(const int x, const int y) {return x < y ? x : y;}
inline int max(const int x, const int y) {return x < y ? y : x;}
inline int f(int x) {return min(max(x, k1), k2) + k3;} // clip
inline void handle(int I) {Up ? (k3 += I, down(k1, V - k3), down(k2, V - k3)) : (k3 -= I, up(k1, -k3), up(k2, -k3)), t += I;}
int main() {
int i, tg, x;
scanf("%d%d", &V, &n);
for (i = 0; i < n; ++i) scanf("%d", rev + i);
rev[n] = INT_MAX;
i = 0, k2 = V;
for (scanf("%d", &q); q; --q) {
scanf("%d%d", &tg, &x);
for (; rev[i] <= tg; ++i) handle(rev[i] - t), Up = !Up;
handle(tg - t), printf("%d\n", f(x));
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(void)
{
int x,k,q;
vector<int> r;
vector<int> a,t;
cin>>x>>k;
for(int i = 0;i < k;i++)
{
int temp;
cin>>temp;
r.push_back(temp);
}
cin>>q;
for(int i = 0;i < q;i++)
{
int ta,tt;
cin>>tt>>ta;
t.push_back(tt);
a.push_back(ta);
}
int target = 0;
int position = 0;
int ctime = 0;
int sign = -1;
int dx = 0;
int minimum = 0,maximum = x;
while(position < q)
{
if(target == k || t[position] < r[target])
{
int f = max(minimum,min(maximum,a[position]+dx)) + sign*(t[position] - ctime);
f = max(0,min(x,f));
cout<<f<<endl;
position++;
} else {
//Calc variaion
int diff = sign*(r[target] - ctime);
minimum += diff;
maximum += diff;
dx += diff;
minimum = min(x,minimum);
if(minimum < 0)
minimum = 0;
maximum = min(x,maximum);
if(maximum < 0)
maximum = 0;
sign *= -1;
ctime = r[target];
target++;
}
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#define int long long
#define rep(i, n) for (i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
int X, K;
int r[100000];
int Q;
int t[100000], a[100000];
vector<P> query; //(時刻, 内容(-1:ひっくり返す, a[i](>=0):求める))
signed main() {
int i;
cin >> X >> K;
rep(i, K) cin >> r[i]; cin >> Q; rep(i, Q) cin >> t[i] >> a[i];
rep(i, K) query.push_back(P(r[i], -1));
rep(i, Q) query.push_back(P(t[i], a[i]));
sort(query.begin(), query.end());
int l = 0, r = X, b = 0, c = X;
int dx = -1, prevT = 0;
rep(i, query.size()) {
int qt = query[i].first;
int qa = query[i].second;
//更新
if (dx == -1) {
int cnt1 = min(b, qt - prevT);
int cnt2 = qt - prevT - cnt1;
b -= cnt1;
c -= cnt1 + cnt2; if (c < b) c = b;
l = min(l + cnt2, r);
}
else {
int cnt1 = min(X - c, qt - prevT);
int cnt2 = qt - prevT - cnt1;
c += cnt1;
b += cnt1 + cnt2; if (b > c) b = c;
r = max(r - cnt2, l);
}
prevT = qt;
//cout << "debug[l, r, b, c, dx, prevT, qa] = [" << l << ", " << r << ", " << b << "," << c << ", " << dx << ", " << prevT << ", "<< qa << "]" << endl;
//クエリ
if (qa == -1) {
dx *= -1;
}
else {
if (qa <= l) cout << b << endl;
else if (qa >= r) cout << c << endl;
else cout << b + (qa - l) << endl;
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int X, K, Q;
int R[100001];
scanf("%d %d", &X, &K);
for(int i = 1; i <= K; i++) scanf("%d", &R[i]);
scanf("%d", &Q);
R[0] = 0;
R[K + 1] = 1 << 30;
int tail = 1;
int low = 0, high = X;
int latte = 0, malta = X;
while(Q--) {
int T, A;
scanf("%d %d", &T, &A);
while(R[tail] <= T) {
auto beet = R[tail] - R[tail - 1];
auto delta = beet * (tail % 2 == 0 ? 1 : -1);
if(tail % 2 == 0) high -= max(0, malta + delta - X);
else low += max(0, -(latte + delta));
latte = min(X, max(0, latte + delta));
malta = min(X, max(0, malta + delta));
++tail;
}
auto beet = T - R[tail - 1];
auto delta = beet * (tail % 2 == 0 ? 1 : -1);
if(low <= A && A <= high) printf("%d\n", min(X, max(0, latte + delta + (A - low))));
else if(A < low) printf("%d\n", min(X, max(0, latte + delta)));
else printf("%d\n", min(X, max(0, malta + delta)));
}
}
|
#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+10;
int S,n,m,way=-1;
int La,Lp,Ra,Rp,Ans[maxn];
struct events{
int t,a,id;
events() {}
events(int t,int a,int id):t(t),a(a),id(id) {}
bool operator < (const events &e) const {return t<e.t;}
}e[maxn];
int main()
{
#ifdef h10
freopen("F.in","r",stdin);
freopen("F.out","w",stdout);
#endif
int i,t,a;
scanf("%d",&S);
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%d",&t);
e[i]=events(t,-1,0);
}
scanf("%d",&m);
for (i=1;i<=m;i++)
{
scanf("%d%d",&t,&a);
e[n+i]=events(t,a,i);
}
sort(e+1,e+n+m+1);
La=0; Lp=0; Ra=S; Rp=S;
for (i=1;i<=n+m;i++)
{
Lp+=way*(e[i].t-e[i-1].t);
Rp+=way*(e[i].t-e[i-1].t);
if (Lp<0)
{
if (Rp<0) La=Ra=S,Lp=Rp=0;
else La-=Lp,Lp=0;
}
if (Rp>S)
{
if (Lp>S) La=Ra=0,Lp=Rp=S;
else Ra-=Rp-S,Rp=S;
}
if (e[i].a==-1) way=-way;
else
{
int tmp=Lp+e[i].a-La;
tmp=min(tmp,Rp);
tmp=max(tmp,Lp);
Ans[e[i].id]=tmp;
}
}
for (i=1;i<=m;i++)
printf("%d\n",Ans[i]);
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
int r[100002];
static inline int magic(int l, int x, int r) {
return max(min(r, x), l);
}
static inline void slide(int h, int dist, int &mina, int &minb, int &maxa, int &maxb) {
minb = magic(0, minb + dist, h);
maxb = magic(0, maxb + dist, h);
if(maxb - minb < maxa - mina) {
int delta = (maxa - mina) - (maxb - minb);
if(dist < 0)
mina += delta;
else
maxa -= delta;
}
}
int main() {
int h, n, q, t, a, mina, maxa, minb, maxb, dist, j;
#ifdef DEBUG
freopen("codeforces.in", "r", stdin);
freopen("codeforces.out", "w", stdout);
#endif
scanf("%d%d", &h, &n);
for(int i = 1; i <= n; ++i)
scanf("%d", &r[i]);
r[n + 1] = INF;
n = n + 2;
j = 1;
mina = minb = 0;
maxa = maxb = h;
scanf("%d", &q);
for(int i = 0; i < q; ++i) {
scanf("%d%d", &t, &a);
while(r[j] < t) {
dist = r[j] - r[j - 1];
if(j % 2 == 1)
dist = -dist;
slide(h, dist, mina, minb, maxa, maxb);
++j;
}
dist = t - r[j - 1];
if(j % 2 == 1)
dist = -dist;
slide(h, dist, mina, minb, maxa, maxb);
r[j - 1] = t;
a = magic(mina, a, maxa);
printf("%d\n", maxb - (maxa - a));
}
return 0;
}
|
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<set>
#include<bitset>
#include<map>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
typedef long long LL;
typedef double db;
int get(){
char ch;
while(ch=getchar(),(ch<'0'||ch>'9')&&ch!='-');
if (ch=='-'){
int s=0;
while(ch=getchar(),ch>='0'&&ch<='9')s=s*10+ch-'0';
return -s;
}
int s=ch-'0';
while(ch=getchar(),ch>='0'&&ch<='9')s=s*10+ch-'0';
return s;
}
const int N = 1e+5+5;
int n,q,k,X;
int rev[N];
int X0,Y0,X1,s,now;
void turn(int t){
int v=(t-now);
if (s==1){
Y0+=v;
int Y1=Y0+X1-X0;
if (Y0>=X)X0=X,X1=X,Y0=X;
else
if (Y1>X)X1-=Y1-X;
}
else{
Y0-=v;
int Y1=Y0+X1-X0;
if(Y1<=0)X0=X,X1=X,Y0=0;
else
if (Y0<0)X0-=Y0,Y0=0;
}
now=t;
}
int main(){
X=get();
k=get();
fo(i,1,k)rev[i]=get();
X0=0,Y0=0,X1=X,now=0,s=-1;
q=get();
int w=1;
fo(i,1,q){
int t=get(),a=get();
while(w<=k&&rev[w]<t){
turn(rev[w++]);
s=-s;
}
turn(t);
if (a<X0)printf("%d\n",Y0);
if (a>=X0&&a<=X1)printf("%d\n",Y0-X0+a);
if (a>X1)printf("%d\n",Y0+X1-X0);
}
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#define N 100010
#define ll long long
using namespace std;
ll num[N],ans[N];
struct ques{
int a,t,id;
bool operator <(const ques b)const{return t<b.t;}
}q[N];
int main()
{
ll x;
int n;
scanf("%lld%d",&x,&n);
for(int i=1;i<=n;i++) scanf("%lld",&num[i]);
int m;
scanf("%d",&m);
for(int i=1;i<=m;i++) scanf("%d%d",&q[i].t,&q[i].a),q[i].id=i;
sort(q+1,q+m+1);
ll u=1,r=0,up=x,down=0,opt=-1;
ll sum=0;
while(u<=m)
{
if(num[r+1]<q[u].t && r<n)
{
ll res=0;
r++;
res=opt*(num[r]-num[r-1]);
down=max(0ll,min(x,down+res));
up=max(0ll,min(x,up+res));
sum+=res;
opt=-opt;
}
else
{
ll cnt=q[u].t-num[r];
ll res=max(down,min(up,q[u].a+sum));
ans[q[u].id]=max(0ll,min(x,res+opt*cnt));
u++;
}
}
for(int i=1;i<=m;i++) printf("%lld\n",ans[i]);
return 0;
}
|
#include<iostream>
#include<cstring>
using namespace std;
int n,x,r[1000100];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin >>x>>n;
for(int i=1;i<=n;i++)cin >>r[i];
int q,now=1,p=-1,low=x,high=0,ad=0;cin >>q;
while(q--)
{
int t,a;cin >>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;
}
cout <<min(x,max(0,min(low,max(a+ad,high))+p*(t-r[now-1])))<<'\n';
}
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define lf double
#define E complex<lf>
#define inf 0x3f3f3f3f
#define eps 1e-8
#define pa pair<int,int>
#define pb push_back
#define ms(x,y) memset(x,y,sizeof(x))
#define l(x) (x<<1)
#define r(x) (x<<1|1)
#define mod 1000000007
#define N 100010
using namespace std;
inline ll read() {
ll x=0,f=1;char c=getchar();
while (c<'0'||c>'9') f=(c=='-')?-1:1,c=getchar();
while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x*f;
}
int n,m;
ll x,t[N],a[N],r[N];
int main() {
x=read(),n=read();
for (int i=1; i<=n; i++) r[i]=read();
m=read();
for (int i=1; i<=m; i++) t[i]=read(),a[i]=read();
ll h=0,k=1,opt=-1,mx=x,mn=0;
for (int i=1; i<=m; i++) {
while (k<=n&&t[i]>=r[k]) {
ll v=(r[k]-r[k-1])*opt;
mx+=v,mn+=v,h+=v;
mx=min(mx,x),mx=max(mx,0ll);
mn=min(mn,x),mn=max(mn,0ll);
k++,opt*=-1;
}
ll now=a[i]+h,d=(t[i]-r[k-1])*opt;
now=max(now,mn),now=min(now,mx);
now+=d,now=max(now,0ll),now=min(now,x);
cout << now << endl;
}
}
|
#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,lst=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]-lst);
ad+=dlt;low=min(x,max(dlt+low,0));high=min(x,max(dlt+high,0));
lst=r[now];now++;p*=-1;
}
printf("%d\n",min(x,max(0,min(low,max(high,a+ad))+p*(t-lst))));
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5+5;
int X, K, Q, r[maxn], t[maxn], a[maxn], ub, lb, b, t1, t2, add, tmp, diff, sgn;
void Add(int &n, int num){
n+=num;
n = max(0, min(X, n));
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin >> X >> K;
for(int i = 1; i <= K; i++) cin >> r[i];
cin >> Q;
for(int i = 1; i <= Q; i++) cin >> t[i] >> a[i];
t1 = 0, t2 = 1;
lb = b = 0, ub = X, sgn = -1;
while(t2 <= Q){
if(t[t2] > r[t1+1] && t1 < K){
t1++;
add = sgn*(r[t1] - r[t1-1]);
Add(lb, add); Add(ub, add);
b+=add;
sgn*=-1;
}
else{
diff = (t[t2] - r[t1]);
tmp = max(lb, min(ub, a[t2]+b));
Add(tmp, diff*sgn);
cout << tmp << "\n";
t2++;
}
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll X, K; cin >> X >> K;
ll r[K+1]; FOR(i,1,K+1) cin >> r[i];
r[0] = 0;
ll Q; cin >> Q;
ll mx = X, mn = 0;
int j = 1;
ll d = 0;
FOR(i,0,Q) {
ll t, a; cin >> t >> a;
while(j <= K && r[j] <= t) {
if(j % 2 == 1) {
mx = max(0LL, mx - (r[j] - r[j-1]));
mn = max(0LL, mn - (r[j] - r[j-1]));
d -= (r[j] - r[j-1]);
} else {
mx = min(X, mx + (r[j] - r[j-1]));
mn = min(X, mn + (r[j] - r[j-1]));
d += (r[j] - r[j-1]);
}
j++;
}
ll dd = min(mx, max(mn, a + d)) + (j % 2 == 1 ? - (t - r[j-1]) : (t - r[j-1]));
cout << max(min(dd, X), 0LL) << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
multiset<int> ms;
int fl[100005];
int main() {
int x,n;
scanf("%d%d",&x,&n);
for(int i=0;i<n;i++) scanf("%d",fl+i);
fl[n] = 1e9+7;
int q,i=0,pt=0,lb=0, lv=0, rb=x, rv=x;
bool up=false;
scanf("%d",&q);
while(q--) {
int t,a;
scanf("%d%d",&t,&a);
while(pt<t) {
if(fl[i] > t) {
int v = (up?1:-1)*(t-pt);
lv += v;
rv += v;
pt = t;
} else {
int v = (up?1:-1)*(fl[i]-pt);
up = !up;
pt = fl[i++];
lv += v;
rv += v;
}
if(rv > x) {
rb -= rv-x;
rv = x;
if(lv > x) {
lb = rb;
lv = x;
}
}
if(lv < 0) {
lb -= lv;
lv = 0;
if(rv < 0) {
rb = lb;
rv = 0;
}
}
if(lb<0) lb = 0;
if(lb>x) lb = x;
if(rb<0) rb = 0;
if(rb>x) rb = x;
}
if(a <= lb) printf("%d\n",lv);
else if(a >= rb) printf("%d\n",rv);
else printf("%d\n",lv + (a-lb));
}
}
|
#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[500007];
int ep=0,as[500007];
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){
long long 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(mx>X) mx=X;
if(mn>X) mn=X;
t0=e[i].x;
sgn*=-1;
}
}
for(int i=1;i<=q;++i)printf("%d\n",as[i]);
return 0;
}
|
#include<cstdio>
#include<algorithm>
using namespace std;
int X, n;
int Mn[101000], Mx[101000], Q, Cur[101000];
int MnL[101000], MxL[101000];
int S[101000], T[101000], ck;
int main() {
int i;
scanf("%d%d", &X, &n);
int t = 1, a;
for (i = 1; i <= n + 1; i++) {
if(i<=n)scanf("%d", &T[i]);
else T[i] = 1e9;
t *= -1;
S[i] = S[i - 1] + t*(T[i] - T[i - 1]);
Mn[i] = Mn[i - 1], Mx[i] = Mx[i - 1], MnL[i] = MnL[i - 1], MxL[i] = MxL[i - 1];
if (Mn[i] > S[i]) Mn[i] = S[i], MnL[i] = i;
if (Mx[i] < S[i]) Mx[i] = S[i], MxL[i] = i;
if (Mx[i] - Mn[i] >= X) {
if (!ck) {
if (t == 1) Cur[i] = X;
else Cur[i] = 0;
ck = 1;
}
else {
Cur[i] = min(X, max(0, Cur[i - 1] + t*(T[i] - T[i - 1])));
}
}
}
n++;
scanf("%d", &Q);
while (Q--) {
scanf("%d%d", &t, &a);
int pv = lower_bound(T + 1, T + n + 1, t + 1) - T - 1;
int x;
if (Mx[pv] - Mn[pv] >= X) {
x = Cur[pv];
}
else {
if (a + Mn[pv] <= 0) {
x = S[pv] - S[MnL[pv]];
}
else if (a + Mx[pv] >= X) {
x = S[pv] - S[MxL[pv]] + X;
}
else {
x = a + S[pv];
}
}
int tp = -1;
if (pv % 2)tp = 1;
printf("%d\n", max(min(x + tp * (t - T[pv]), X), 0));
}
}
|
#include<cstdio>
#include<cctype>
#include<algorithm>
using namespace std;
int x,k,q,r[100010],maxn[100010],mini[100010],c[100010];
char buffer[10000010],*hd;
char Getchar(){
return *hd++;
}
int rd(){
int x=0;
char c;
do c=Getchar();
while(!isdigit(c));
do{
x=(x<<1)+(x<<3)+(c^48);
c=Getchar();
}while(isdigit(c));
return x;
}
void InitInput(){
fread(buffer,1,10000000,stdin);
hd=buffer;
x=rd(),k=rd();
for(int i=1;i<=k;i++)
r[i]=rd();
maxn[0]=x,r[0]=mini[0]=c[0]=0;
for(int i=1;i<=k;i++){
maxn[i]=maxn[i-1];
mini[i]=mini[i-1];
if(i&1){
mini[i]=max(mini[i],min(r[i]-r[i-1]-c[i-1],maxn[i]));
c[i]=max(c[i-1]+mini[i-1]-r[i]+r[i-1],0)-mini[i];
}else{
maxn[i]=min(maxn[i],max(x-r[i]+r[i-1]-c[i-1],mini[i]));
c[i]=min(c[i-1]+maxn[i-1]+r[i]-r[i-1],x)-maxn[i];
}
}
return;
}
void Ask(){
q=rd();
for(int i=1;i<=q;i++){
int t=rd(),a=rd();
int pos=upper_bound(r+1,r+k+1,t)-r-1,ans=c[pos];
if(a<=mini[pos])
ans+=mini[pos];
else if(a>=maxn[pos])
ans+=maxn[pos];
else
ans+=a;
if(pos&1)
ans=min(x,ans+t-r[pos]);
else ans=max(0,ans-t+r[pos]);
printf("%d\n",ans);
}
}
int main(){
InitInput();
Ask();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+20;
int X,K,Q,solve();
int hehe=solve(),r[maxn],mx[maxn],mn[maxn],c[maxn];
int solve(){
scanf("%d",&X);
scanf("%d",&K);
for(int i=1;i<=K;++i){
scanf("%d",&r[i]);
}
mx[0]=X;
for(int i=1;i<=K;++i){
mx[i]=mx[i-1];mn[i]=mn[i-1];
if(i&1){
mn[i]=max(mn[i],min(r[i]-r[i-1]-c[i-1],mx[i]));
c[i]=max(c[i-1]+mn[i-1]-r[i]+r[i-1],0)-mn[i];
}
else{
mx[i]=min(mx[i],max(X-r[i]+r[i-1]-c[i-1],mn[i]));
c[i]=min(c[i-1]+mx[i-1]+r[i]-r[i-1],X)-mx[i];
}
}
scanf("%d",&Q);
for(int a,t,pl,ans;Q--;){
scanf("%d%d",&t,&a);
ans=c[pl=(upper_bound(r+1,r+K+1,t)-r-1)];
if(a<=mn[pl])ans+=mn[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;
}
int main(){};
|
#include<cstdio>
#include<algorithm>
#define fo(i,a,b) for(i=a;i<=b;i++)
using namespace std;
const int maxn=100000+10;
struct dong{
int t,a;
} ask[maxn];
int p[maxn],ans[maxn];
int i,j,k,l,t,n,m,f,a,b,c,d,e,X;
bool czy;
int get(int x){
if (czy) return e;
if (x<=a) return b;
else if (x>=c) return d;
else return (x-a)+b;
}
void change(int f,int t){
if (czy){
e+=f*t;
e=max(0,min(X,e));
return;
}
if (f==-1){
if (d-t<=0){
czy=1;
e=0;
return;
}
if (t>=b){
a+=t-b;
b=0;
d-=t;
}
else{
b-=t;
d-=t;
}
}
else{
if (b+t>=X){
czy=1;
e=X;
return;
}
if (d+t>=X){
b+=t;
c-=d+t-X;
d=X;
}
else{
b+=t;
d+=t;
}
}
}
int main(){
scanf("%d",&X);
scanf("%d",&n);
fo(i,1,n) scanf("%d",&p[i]);
scanf("%d",&m);
fo(i,1,m) scanf("%d%d",&ask[i].t,&ask[i].a);
j=0;
a=0;b=0;c=X;d=X;
f=-1;
fo(i,1,n){
while (j<m&&ask[j+1].t<p[i]){
j++;
k=ask[j].a;
ans[j]=max(0,min(X,get(k)+f*(ask[j].t-p[i-1])));
}
change(f,p[i]-p[i-1]);
f*=-1;
}
while (j<m){
k=ask[++j].a;
ans[j]=max(0,min(X,get(k)+f*(ask[j].t-p[n])));
}
fo(i,1,m) printf("%d\n",ans[i]);
}
|
#include <bits/stdc++.h>
const int MAXN = 100010;
int qa[MAXN], ansl[MAXN];
std::map<int, std::vector<int> > qry;
int X, Q;
int main() {
std::ios_base::sync_with_stdio(false), std::cin.tie(0);
std::cin >> X >> Q;
for (int i = 1, t; i <= Q; ++i)
std::cin >> t, qry[t].push_back(-1);
std::cin >> Q;
for (int i = 1, t; i <= Q; ++i)
std::cin >> t >> qa[i], qry[t].push_back(i);
int lx = 0, ly = 0, rx = X, ry = X, lst = 0, typ = 0;
for (auto t : qry) {
int d = t.first - lst; lst = t.first;
ly -= d, ry -= d;
if (ly < 0) lx -= ly, ly = 0;
if (ry < 0) rx += ry, ry = 0;
if (lx >= rx) lx = rx = 0;
for (auto i : t.second) {
if (i == -1) ly = X - ly, ry = X - ry, typ ^= 1;
else {
if (qa[i] <= lx) ansl[i] = ly;
else if (qa[i] >= rx) ansl[i] = ry;
else ansl[i] = ly + (ry - ly) / (rx - lx) * (qa[i] - lx);
if (typ) ansl[i] = X - ansl[i];
}
}
}
for (int i = 1; i <= Q; ++i) std::cout << ansl[i] << '\n';
return 0;
}
|
#include<iostream>
using namespace std;
int r[200000];
int X, K;
int main()
{
int Q, T, A, minA, maxA, k = 0, t = 0, x = 0, sign = -1;
cin >> X >> K;
for(int i = 0; i < K; i++) {
cin >> r[i];
}
r[K] = 2e9;
minA = 0;
maxA = X;
cin >> Q;
for(int i = 0; i < Q; i++) {
cin >> T >> A;
for(; T >= r[k]; ) {
int diff = sign * (r[k] - t);
x += diff;
minA = min(X, max(0, minA + diff));
maxA = min(X, max(0, maxA + diff));
t = r[k];
k++;
sign *= -1;
}
T -= t;
A = min(maxA, max(minA, A + x));
A = min(X, max(0, A + sign * T));
cout << A << endl;
//cout << minA << " " << maxA << " " << x << " " << t << endl;
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.