結果

問題 No.704 ゴミ拾い Medium
ユーザー NyaanNyaanNyaanNyaan
提出日時 2019-10-24 20:41:13
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 492 ms / 1,500 ms
コード長 5,999 bytes
コンパイル時間 1,883 ms
コンパイル使用メモリ 178,520 KB
実行使用メモリ 24,776 KB
最終ジャッジ日時 2023-09-25 05:53:04
合計ジャッジ時間 15,202 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 1 ms
4,376 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 1 ms
4,376 KB
testcase_08 AC 2 ms
4,380 KB
testcase_09 AC 1 ms
4,376 KB
testcase_10 AC 2 ms
4,380 KB
testcase_11 AC 1 ms
4,380 KB
testcase_12 AC 2 ms
4,376 KB
testcase_13 AC 2 ms
4,380 KB
testcase_14 AC 5 ms
4,380 KB
testcase_15 AC 5 ms
4,376 KB
testcase_16 AC 5 ms
4,384 KB
testcase_17 AC 6 ms
4,376 KB
testcase_18 AC 5 ms
4,376 KB
testcase_19 AC 6 ms
4,380 KB
testcase_20 AC 5 ms
4,380 KB
testcase_21 AC 5 ms
4,380 KB
testcase_22 AC 6 ms
4,376 KB
testcase_23 AC 5 ms
4,376 KB
testcase_24 AC 483 ms
24,624 KB
testcase_25 AC 484 ms
24,716 KB
testcase_26 AC 489 ms
24,448 KB
testcase_27 AC 483 ms
24,444 KB
testcase_28 AC 486 ms
24,776 KB
testcase_29 AC 492 ms
24,440 KB
testcase_30 AC 487 ms
24,616 KB
testcase_31 AC 488 ms
24,440 KB
testcase_32 AC 489 ms
24,628 KB
testcase_33 AC 485 ms
24,576 KB
testcase_34 AC 272 ms
12,540 KB
testcase_35 AC 271 ms
12,496 KB
testcase_36 AC 265 ms
12,492 KB
testcase_37 AC 272 ms
12,424 KB
testcase_38 AC 265 ms
12,608 KB
testcase_39 AC 264 ms
12,540 KB
testcase_40 AC 272 ms
12,608 KB
testcase_41 AC 270 ms
12,432 KB
testcase_42 AC 269 ms
12,488 KB
testcase_43 AC 271 ms
12,608 KB
testcase_44 AC 1 ms
4,376 KB
testcase_45 AC 2 ms
4,376 KB
testcase_46 AC 374 ms
12,548 KB
testcase_47 AC 397 ms
12,540 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i,N) for(int i = 0; i < (N); i++)
#define repr(i,N) for(int i = (N) - 1; i >= 0; i--)
#define rep1(i,N) for(int i = 1; i <= (N) ; i++)
#define repr1(i,N) for(int i = (N) ; i > 0 ; i--)
#define each(x,v) for(auto& x : v)
#define all(v) (v).begin(),(v).end()
#define sz(v) ((int)(v).size())
#define vrep(v,it) for(auto it = v.begin(); it != v.end(); it++)
#define vrepr(v,it) for(auto it = v.rbegin(); it != v.rend(); it++)
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
using namespace std; void solve();
using ll = long long; using vl = vector<ll>;
using vi = vector<int>; using vvi = vector< vector<int> >;
constexpr int inf = 1001001001;
constexpr ll infLL = (1LL << 61) - 1;
struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);} } iosetupnya;
template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }
template<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; }
template<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; }
template<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); rep(i,s) os << (i ? " " : "") << v[i]; return os; }
template<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; }
void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}
template<typename T>void die(T x){out(x); exit(0);}
#ifdef NyaanDebug
  #include "NyaanDebug.h"
  #define trc(...) do { cerr << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0)
  #define trca(v,N) do { cerr << #v << " = "; array_out(v , N);cout << endl;} while(0)
#else
  #define trc(...)
  #define trca(...)
  int main(){solve();}
#endif

using P = pair<int,int>; using vp = vector<P>;
constexpr int MOD = /** 1000000007; //*/ 998244353;
////////////////

template<typename T , T INF>
struct DynamicLiChaoTree{
 
  struct Line{
    T slope , intercept;
    Line() : slope(0),intercept(INF){}
    Line(T slope,T intercept) : slope(slope),intercept(intercept){}
    inline T get(T x) const{
      return slope * x + intercept;
    }
    inline bool over(const Line& other , const T &x) const{
      return get(x) < other.get(x);
    }
  };
 
  // remind セグ木は1-indexedの実装
  T xmin, xmax, _size;
  unordered_map<T, Line> seg;
 
  // [l , r]におけるLi Chao Tree
  DynamicLiChaoTree(T xmin, T xmax) : xmin(xmin), xmax(xmax){
    _size = 1; while(_size < xmax - xmin + 1) _size <<= 1;
  }
  
  // 内部用の関数
  void update(T a,T b,T left,T right,T seg_idx){
    Line line(a , b);
    while(1){
      int mid = (left + right) >> 1;
      bool l_over = line.over(seg[seg_idx], min(xmax , left   + xmin) );
      bool r_over = line.over(seg[seg_idx], min(xmax , right-1+ xmin) );
      if(l_over == r_over){
        if(l_over) swap(seg[seg_idx] , line);
        return;
      }
      bool m_over = line.over(seg[seg_idx], min(xmax , mid + xmin) );
      if(m_over) swap(seg[seg_idx], line);
      if(l_over != m_over) seg_idx = (seg_idx << 1) , right = mid;
      else seg_idx = (seg_idx<<1) | 1 , left = mid;
    }
  }
  // 内部用の関数
  void update(T a, T b, T seg_idx){ 
    T left , right;
    T upper_bit =  63 - __builtin_clzll(seg_idx);
    left = (_size >> upper_bit) * (seg_idx - (1 << upper_bit) );
    right = left + (_size >> upper_bit);
    update(a , b , left , right , seg_idx);
  }
  /*
  void update(T a,T b,T left,T right){
    T lower_bit = (left | right) & (- (left | right) );
    T seg_idx = ( _size + left ) / lower_bit;
    update(a , b , left , right , seg_idx);
  }
  */
  // y = ax + bなる直線を追加
  void update(T a, T b){
    update(a , b , 0 , _size , 1);
  }

  // 閉区間x in [left , right]に線分y = ax + bを追加するクエリ
  void update_line_segment(T a,T b,T left,T right){
    left -= xmin - _size, right -= xmin - _size - 1;
    for( ; left < right; left >>= 1 , right >>= 1){
      if(left & 1) update(a , b , left++);
      if(right& 1) update(a , b , --right); 
    }
  }

  // xにおける最小値クエリ
  T query(T x) {
    T left = 0 , right = _size , seg_idx = 1 , idx = x - xmin , ret = INF;
    while(1){
      T cur = seg[seg_idx].get(x);
      //if(cur == INF) break;
      ret = min(ret , cur);
      if(left + 1 >= right) break;
      int mid = (left + right) >> 1;
      if(idx < mid) seg_idx = (seg_idx << 1) , right = mid;
      else seg_idx = (seg_idx << 1) | 1 , left = mid; 
    }
    return ret;
  }
 
  void merge(DynamicLiChaoTree<T,INF> &other){
    if(seg.size() < other.seg.size()) seg.swap(other.seg);
    for(auto &x : other.seg){
      if(x.second.intercept == INF) continue;
      update(x.second.slope , x.second.intercept , x.first);
    }
  }
 
};

void solve(){
  ini(N);
  vl a(N) , x(N) , y(N); in(a , x , y);
  vl dp(N , 0);
  DynamicLiChaoTree<ll , infLL> lichao(0 , 100000);
  lichao.update_line_segment(1 , y[0] - x[0] , x[0] , 100000);
  lichao.update_line_segment(-1, y[0] + x[0] , 0 , x[0]);
  each(x , lichao.seg) trc(x.first, x.second.slope , x.second.intercept);
  rep(i,N){
    if(i){
      lichao.update_line_segment(1 , dp[i-1] + y[i] - x[i] , x[i] , 100000);
      lichao.update_line_segment(-1, dp[i-1] + y[i] + x[i] , 0 , x[i]);
    }
    dp[i] = lichao.query(a[i]);
  }
  trc(dp);
  out(dp[N - 1]);
}
0