結果
問題 | No.2169 To Arithmetic |
ユーザー | tko919 |
提出日時 | 2022-12-21 03:12:29 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 8,365 bytes |
コンパイル時間 | 3,014 ms |
コンパイル使用メモリ | 225,140 KB |
実行使用メモリ | 26,696 KB |
最終ジャッジ日時 | 2024-04-29 03:09:23 |
合計ジャッジ時間 | 8,659 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 4 ms
5,376 KB |
testcase_05 | AC | 4 ms
5,376 KB |
testcase_06 | AC | 4 ms
5,376 KB |
testcase_07 | AC | 4 ms
5,376 KB |
testcase_08 | AC | 3 ms
5,376 KB |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
ソースコード
#line 1 "library/Template/template.hpp" #include <bits/stdc++.h> using namespace std; #define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++) #define ALL(v) (v).begin(),(v).end() using ll=long long int; const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;} template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;} #line 2 "library/Utility/fastio.hpp" #include <unistd.h> class FastIO{ static constexpr int L=1<<16; char rdbuf[L]; int rdLeft=0,rdRight=0; inline void reload(){ int len=rdRight-rdLeft; memmove(rdbuf,rdbuf+rdLeft,len); rdLeft=0,rdRight=len; rdRight+=fread(rdbuf+len,1,L-len,stdin); } inline bool skip(){ for(;;){ while(rdLeft!=rdRight and rdbuf[rdLeft]<=' ')rdLeft++; if(rdLeft==rdRight){ reload(); if(rdLeft==rdRight)return false; } else break; } return true; } template<typename T,enable_if_t<is_integral<T>::value,int> =0>inline bool _read(T& x){ if(!skip())return false; if(rdLeft+20>=rdRight)reload(); bool neg=false; if(rdbuf[rdLeft]=='-'){ neg=true; rdLeft++; } x=0; while(rdbuf[rdLeft]>='0' and rdLeft<rdRight){ x=x*10+(neg?-(rdbuf[rdLeft++]^48):(rdbuf[rdLeft++]^48)); } return true; } template<typename T,enable_if_t<is_floating_point<T>::value,int> =0>inline bool _read(T& x){ if(!skip())return false; if(rdLeft+20>=rdRight)reload(); bool neg=false; if(rdbuf[rdLeft]=='-'){ neg=true; rdLeft++; } x=0; while(rdbuf[rdLeft]>='0' and rdbuf[rdLeft]<='9' and rdLeft<rdRight){ x=x*10+(rdbuf[rdLeft++]^48); } if(rdbuf[rdLeft]!='.')return true; rdLeft++; T base=.1; while(rdbuf[rdLeft]>='0' and rdbuf[rdLeft]<='9' and rdLeft<rdRight){ x+=base*(rdbuf[rdLeft++]^48); base*=.1; } if(neg)x=-x; return true; } inline bool _read(char& x){ if(!skip())return false; if(rdLeft+1>=rdRight)reload(); x=rdbuf[rdLeft++]; return true; } inline bool _read(string& x){ if(!skip())return false; for(;;){ int pos=rdLeft; while(pos<rdRight and rdbuf[pos]>' ')pos++; x.append(rdbuf+rdLeft,pos-rdLeft); if(rdLeft==pos)break; rdLeft=pos; if(rdLeft==rdRight)reload(); else break; } return true; } template<typename T>inline bool _read(vector<T>& v){ for(auto& x:v){ if(!_read(x))return false; } return true; } char wtbuf[L],tmp[50]; int wtRight=0; inline void flush(){ fwrite(wtbuf,1,wtRight,stdout); wtRight=0; } inline void _write(const char& x){ if(wtRight>L-32)flush(); wtbuf[wtRight++]=x; } inline void _write(const string& x){ for(auto& c:x)_write(c); } template<typename T,enable_if_t<is_integral<T>::value,int> =0>inline void _write(T x){ if(wtRight>L-32)flush(); if(x==0){ _write('0'); return; } else if(x<0){ _write('-'); if (__builtin_expect(x == std::numeric_limits<T>::min(), 0)) { switch (sizeof(x)) { case 2: _write("32768"); return; case 4: _write("2147483648"); return; case 8: _write("9223372036854775808"); return; } } x=-x; } int pos=0; while(x!=0){ tmp[pos++]=char((x%10)|48); x/=10; } rep(i,0,pos)wtbuf[wtRight+i]=tmp[pos-1-i]; wtRight+=pos; } template<typename T>inline void _write(const vector<T>& v){ rep(i,0,v.size()){ if(i)_write(' '); _write(v[i]); } } public: FastIO(){} ~FastIO(){flush();} inline void read(){} template <typename Head, typename... Tail>inline void read(Head& head,Tail&... tail){ assert(_read(head)); read(tail...); } template<bool ln=true,bool space=false>inline void write(){if(ln)_write('\n');} template <bool ln=true,bool space=false,typename Head, typename... Tail>inline void write(const Head& head,const Tail&... tail){ if(space)_write(' '); _write(head); write<ln,true>(tail...); } }; /** * @brief Fast IO */ #line 3 "sol.cpp" #line 2 "library/DataStructure/bit.hpp" template<typename T>struct BIT{ int n; T all=0; vector<T> val; BIT(int _n=0):n(_n),val(_n+10){} void clear(){val.assign(n+10,0); all=T();} void add(int i,T x){ for(i++;i<=n;i+=(i&-i))val[i]=val[i]+x; all+=x; } T sum(int i){ T res=0; for(;i;i-=(i&-i))res+=val[i]; return res; } T sum(int L,int R){return sum(R)-sum(L);} // [L,R) int lower_bound(T x){ int ret=0,len=1; while(2*len<=n)len<<=1; for(;len>=1;len>>=1){ if(ret+len<=n and val[ret+len]<x){ ret+=len; x-=val[ret]; } } return ret; } }; /** * @brief Binary Indexed Tree */ #line 2 "library/DataStructure/lichaotree.hpp" template<typename T,T MX>struct CHT{ using Line=pair<T,T>; int n; vector<T> xs; vector<Line> ls; CHT(vector<T>& ps):xs(ps){ n=1; while(n<(int)xs.size())n<<=1; xs.resize(n,xs.back()); ls.resize(2*n-1,Line(0,MX)); } T eval(Line& f,T x){return f.first*x+f.second;} void add(T a,T b,int k=0,int L=0,int R=-1){ if(R==-1)R=n; Line f={a,b}; while(L!=R){ int mid=(L+R)>>1; T lx=xs[L],mx=xs[mid],rx=xs[R-1]; Line& g=ls[k]; if(eval(f,lx)<eval(g,lx) and eval(f,rx)<eval(g,rx)){ g=f; return; } if(eval(f,lx)>=eval(g,lx) and eval(f,rx)>=eval(g,rx))return; if(eval(f,mx)<eval(g,mx))swap(f,g); if(eval(f,lx)<eval(g,lx)){ k=k*2+1; R=mid; } else{ k=k*2+2; L=mid; } } } void add_segment(T a,T b,T L,T R){ int l=lower_bound(ALL(xs),L)-xs.begin(),r=lower_bound(ALL(xs),R)-xs.begin(); int a0=l,b0=r; l+=n,r+=n; int sz=1; while(l<r){ if(r&1){ r--; b0-=sz; add(a,b,r-1,b0,b0+sz); } if(l&1){ add(a,b,l-1,a0,a0+sz); l++; a0+=sz; } l>>=1; r>>=1; sz<<=1; } } T getmin(T x){ int k=lower_bound(ALL(xs),x)-xs.begin()+n-1; T res=eval(ls[k],x); while(k){ k=(k-1)>>1; chmin(res,eval(ls[k],x)); } return res; } }; /** * @brief Convex Hull Trick (Li Chao Tree) * @docs docs/lichaotree.md */ #line 6 "sol.cpp" FastIO io; int main(){ int n,q; io.read(n,q); vector<int> a(n); io.read(a); vector<int> d(q); io.read(d); vector<ll> xs; rep(i,0,q)xs.push_back(d[i]); sort(ALL(xs)); xs.erase(unique(ALL(xs)),xs.end()); CHT<ll,inf> cht(xs); vector<int> vals; rep(i,0,n-1)vals.push_back(a[i+1]-a[i]); rep(i,0,q)vals.push_back(d[i]); sort(ALL(vals)); vals.erase(unique(ALL(vals)),vals.end()); BIT<ll> cnt(vals.size()),sum(vals.size()); rep(i,0,n-1){ int x=a[i+1]-a[i]; int id=lower_bound(ALL(vals),x)-vals.begin(); cnt.add(id,1); sum.add(id,x); } rep(i,0,n)cht.add(i,-a[i]); rep(i,0,q){ ll x=-cht.getmin(d[i]); ll ret=0; ret+=abs(a.front()-x); ret+=abs(a.back()-(x+d[i]*(n-1))); int id=lower_bound(ALL(vals),d[i])-vals.begin(); ret+=(cnt.sum(id)*d[i])-sum.sum(id); ret+=(sum.all-sum.sum(id))-(cnt.all-cnt.sum(id))*d[i]; io.write(ret/2); } return 0; }