結果
問題 | No.1568 Sushi |
ユーザー |
|
提出日時 | 2021-04-17 14:01:03 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,872 ms / 2,000 ms |
コード長 | 3,713 bytes |
コンパイル時間 | 8,160 ms |
コンパイル使用メモリ | 266,592 KB |
最終ジャッジ日時 | 2025-01-20 21:15:20 |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
純コード判定しない問題か言語 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 25 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for(long long i=0;i<(long long)(n);i++)#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)typedef long long ll;#define all(a) a.begin(),a.end()#define lb(v,k) (lower_bound(all(v),(k))-v.begin())ll cons=1000000000000000;ll inf=1001001001001001001;using vi=vector<ll>;using vvi=vector<vi>;typedef pair<ll,ll> P;template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}template<class T> void out(T a){cout<<a<<'\n';}template<class T> void outp(T a){cout<<'('<<a.first<<','<<a.second<<')'<<'\n';}class sparsetable{vi tmp;vvi Lmi,Rmi,Lma,Rma;vi rng;public:sparsetable(vi v){rng.resize(v.size());rep(c,20)REP(i,1<<c,1<<(c+1))if(i<v.size())rng[i]=c;Lmi=vvi(v.size(),vi(20));Lma=vvi(v.size(),vi(20));Rmi=vvi(v.size(),vi(20));Rma=vvi(v.size(),vi(20));rep(i,v.size()){Lmi[i][0]=v[i];Lma[i][0]=v[i];Rmi[i][0]=v[i];Rma[i][0]=v[i];}rep(c,19)rep(i,v.size()){ll ni=i+(1<<c);if(ni<v.size()){Lmi[i][c+1]=min(Lmi[i][c],Lmi[ni][c]);Lma[i][c+1]=max(Lma[i][c],Lma[ni][c]);}ni=i-(1<<c);if(ni>=0){Rmi[i][c+1]=min(Rmi[i][c],Rmi[ni][c]);Rma[i][c+1]=max(Rma[i][c],Rma[ni][c]);}}}ll mi(ll l,ll r){if(l>=r)return inf;return min(Lmi[l][rng[r-l]],Rmi[r-1][rng[r-l]]);}ll ma(ll l,ll r){if(l>=r)return -inf;return max(Lma[l][rng[r-l]],Rma[r-1][rng[r-l]]);}};int main(){cin.tie(0);ios::sync_with_stdio(false);ll L,n,q;cin>>L>>n>>q;vi difpoint(n+3);rep(i,n)cin>>difpoint[i+1];difpoint[n+1]=inf/2;difpoint[n+2]=inf;n+=3;vvi tablema(n,vi(20)),tablemi(n,vi(20));rep(i,n)tablema[i][0]=tablemi[i][0]=0;vi v(n);rep(i,n-1){if(i%2)v[i+1]=v[i]-difpoint[i+1]+difpoint[i];else v[i+1]=v[i]+difpoint[i+1]-difpoint[i];}sparsetable sp(v);rep(c,19)rep(i,n){ll ni=i+(1<<c);tablema[i][c+1]=tablema[i][c];tablemi[i][c+1]=tablemi[i][c];if(ni<n){chmax(tablema[i][c+1],tablema[ni][c]);chmin(tablemi[i][c+1],tablemi[ni][c]);ll nni=min(ni+(1<<c),n);chmax(tablema[i][c+1],sp.ma(ni,nni)-sp.mi(i,ni));chmin(tablemi[i][c+1],sp.mi(ni,nni)-sp.ma(i,ni));}}auto val=[&](ll t){ll l=lb(difpoint,t);if(l%2)return v[l]-difpoint[l]+t;return v[l]+difpoint[l]-t;};ll ans=0;rep(qq,q){ll x,t;cin>>x>>t;x+=ans;t+=ans;x%=L;t%=cons;// outp(P(x,t));ll idx=lb(difpoint,t);ll cur=val(t);ll ok=n,ng=idx-1;while(ok-ng>1){ll md=(ok+ng)/2;if(sp.ma(idx,md+1)-cur>=x||sp.mi(idx,md+1)-cur<=x-L)ok=md;else ng=md;}// out(ok);ll d=max(v[ok]-cur-x,x-L-v[ok]+cur);assert(d>=0);ans=difpoint[ok]-d;// out(ans);ll r=idx;for(int c=19;c>=0;c--){// out(r);ll nr=r+(1<<c);ll ma=max(tablema[r][c],sp.ma(r,min(nr,n))-sp.mi(idx,r));ll mi=min(tablemi[r][c],sp.mi(r,min(nr,n))-sp.ma(idx,r));if(ma>=x||mi<=x-L)continue;r=nr;}d=max(v[r]-sp.mi(idx,r+1)-x,x-L-v[r]+sp.ma(idx,r+1));assert(d>=0);chmin(ans,difpoint[r]-d);ans-=t;out(ans);}}