結果

問題 No.2169 To Arithmetic
ユーザー snukesnuke
提出日時 2022-12-21 01:04:46
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 201 ms / 2,000 ms
コード長 4,367 bytes
コンパイル時間 2,446 ms
コンパイル使用メモリ 220,760 KB
実行使用メモリ 9,308 KB
最終ジャッジ日時 2024-11-18 02:27:40
合計ジャッジ時間 7,050 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 1 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 3 ms
5,248 KB
testcase_05 AC 3 ms
5,248 KB
testcase_06 AC 3 ms
5,248 KB
testcase_07 AC 3 ms
5,248 KB
testcase_08 AC 3 ms
5,248 KB
testcase_09 AC 41 ms
5,248 KB
testcase_10 AC 109 ms
5,764 KB
testcase_11 AC 96 ms
6,864 KB
testcase_12 AC 82 ms
5,620 KB
testcase_13 AC 141 ms
6,740 KB
testcase_14 AC 75 ms
5,248 KB
testcase_15 AC 99 ms
5,864 KB
testcase_16 AC 73 ms
5,248 KB
testcase_17 AC 106 ms
7,792 KB
testcase_18 AC 57 ms
5,456 KB
testcase_19 AC 192 ms
9,052 KB
testcase_20 AC 192 ms
9,056 KB
testcase_21 AC 187 ms
9,056 KB
testcase_22 AC 201 ms
9,056 KB
testcase_23 AC 200 ms
9,052 KB
testcase_24 AC 119 ms
9,308 KB
testcase_25 AC 117 ms
8,460 KB
testcase_26 AC 152 ms
9,308 KB
testcase_27 AC 177 ms
9,208 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
using namespace std;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>;
int geti(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<typename T>void operator--(vc<T>&a,int){for(T&x:a)x--;}
template<typename T>void operator++(vc<T>&a,int){for(T&x:a)x++;}
template<typename T>void operator+=(vc<T>&a,T b){for(T&x:a)x+=b;}
template<typename T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}
template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;}
template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const vv<T>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<typename T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yes { puts("Yes"); return;}
#define no { puts("No"); return;}
#define ret(x) { cout<<(x)<<endl; return;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;

// Convex Hull Trick
using LT = ll;
using LP = pair<LT,LT>;
struct CHT {
  deque<LP> d;
  LT get(LT x) { // asc x (both)
    while (sz(d) >= 2) {
      LT a = d[0].fi*x + d[0].se;
      LT b = d[1].fi*x + d[1].se;
      if (a <= b) break; // (min)
      d.pop_front();
    }
    return d[0].fi*x + d[0].se;
  }
  void add(LP x) { // desc x.fi (min)
    while (sz(d) >= 2) {
      LP y = d[sz(d) - 1];
      LP z = d[sz(d) - 2];
      if ((x.se-y.se)*(z.fi-y.fi) > (y.fi-x.fi)*(y.se-z.se)) break; // both
      d.pop_back();
    }
    d.pb(x);
  }
};
//

struct Solver {
  void solve() {
    int n,qs;
    scanf("%d%d",&n,&qs);
    vi a(n);
    cin>>a;
    drep(i,n-1) a[i+1] -= a[i];
    a[0] = 0;
    CHT cht;
    {
      vl sa(n);
      rep(i,n-1) sa[i+1] = sa[i]+a[i+1];
      drep(i,n) if (i) cht.add(LP(i,-sa[i]));
    }
    ll sum = suma(a), num = n-1, tot = sum;
    PQ<int> q;
    srep(i,1,n) q.push(a[i]);

    vp ds;
    rep(i,qs) {
      int d;
      scanf("%d",&d);
      ds.eb(d,i);
    }
    sort(rng(ds));
    vl ans(qs);

    for (auto [d,qi] : ds) {
      while (sz(q) && q.top() < d) {
        sum -= q.top(); num--;
        q.pop();
      }
      ll ls = d*(n-1-num)-(tot-sum);
      ans[qi] = ls-min(0ll,cht.get(d));
    }
    for (ll x : ans) printf("%lld\n",x);
  }
};

int main() {
  // cin.tie(nullptr); ios::sync_with_stdio(false);
  int ts = 1;
  // scanf("%d",&ts);
  rep1(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}
0