結果

問題 No.409 ダイエット
ユーザー HaarHaar
提出日時 2019-01-25 14:49:21
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,304 bytes
コンパイル時間 1,827 ms
コンパイル使用メモリ 180,400 KB
実行使用メモリ 12,288 KB
最終ジャッジ日時 2024-09-16 04:47:45
合計ジャッジ時間 16,853 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge6
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 WA -
testcase_10 AC 1 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 2 ms
5,376 KB
testcase_14 AC 2 ms
5,376 KB
testcase_15 AC 2 ms
5,376 KB
testcase_16 AC 2 ms
5,376 KB
testcase_17 AC 2 ms
5,376 KB
testcase_18 AC 1 ms
5,376 KB
testcase_19 AC 1 ms
5,376 KB
testcase_20 AC 2 ms
5,376 KB
testcase_21 AC 2 ms
5,376 KB
testcase_22 AC 1 ms
5,376 KB
testcase_23 AC 2 ms
5,376 KB
testcase_24 AC 1 ms
5,376 KB
testcase_25 AC 2 ms
5,376 KB
testcase_26 AC 2 ms
5,376 KB
testcase_27 AC 1 ms
5,376 KB
testcase_28 AC 2 ms
5,376 KB
testcase_29 AC 2 ms
5,376 KB
testcase_30 AC 1 ms
5,376 KB
testcase_31 WA -
testcase_32 AC 1 ms
5,376 KB
testcase_33 AC 2 ms
5,376 KB
testcase_34 AC 1 ms
5,376 KB
testcase_35 WA -
testcase_36 AC 7 ms
5,376 KB
testcase_37 AC 6 ms
5,376 KB
testcase_38 AC 6 ms
5,376 KB
testcase_39 AC 6 ms
5,376 KB
testcase_40 WA -
testcase_41 AC 6 ms
5,376 KB
testcase_42 AC 7 ms
5,376 KB
testcase_43 AC 6 ms
5,376 KB
testcase_44 AC 6 ms
5,376 KB
testcase_45 AC 5 ms
5,376 KB
testcase_46 AC 7 ms
5,376 KB
testcase_47 AC 6 ms
5,376 KB
testcase_48 AC 6 ms
5,376 KB
testcase_49 AC 6 ms
5,376 KB
testcase_50 WA -
testcase_51 AC 7 ms
5,376 KB
testcase_52 AC 6 ms
5,376 KB
testcase_53 AC 7 ms
5,376 KB
testcase_54 AC 7 ms
5,376 KB
testcase_55 AC 251 ms
7,680 KB
testcase_56 AC 325 ms
12,028 KB
testcase_57 AC 469 ms
12,288 KB
testcase_58 AC 206 ms
6,912 KB
testcase_59 AC 319 ms
8,704 KB
testcase_60 AC 185 ms
6,656 KB
testcase_61 AC 398 ms
11,136 KB
testcase_62 AC 433 ms
11,724 KB
testcase_63 AC 431 ms
11,132 KB
testcase_64 AC 229 ms
7,424 KB
testcase_65 AC 499 ms
11,520 KB
testcase_66 AC 496 ms
12,068 KB
testcase_67 AC 376 ms
9,984 KB
testcase_68 AC 333 ms
8,704 KB
testcase_69 WA -
testcase_70 AC 399 ms
10,484 KB
testcase_71 AC 213 ms
7,296 KB
testcase_72 AC 516 ms
12,032 KB
testcase_73 AC 514 ms
11,392 KB
testcase_74 AC 273 ms
8,320 KB
testcase_75 AC 439 ms
11,520 KB
testcase_76 AC 287 ms
9,088 KB
testcase_77 AC 246 ms
7,168 KB
testcase_78 AC 212 ms
7,808 KB
testcase_79 AC 202 ms
6,784 KB
testcase_80 AC 438 ms
11,648 KB
testcase_81 AC 471 ms
11,264 KB
testcase_82 AC 331 ms
9,300 KB
testcase_83 AC 367 ms
9,728 KB
testcase_84 AC 310 ms
8,576 KB
testcase_85 AC 36 ms
5,376 KB
testcase_86 AC 311 ms
8,448 KB
testcase_87 AC 420 ms
10,500 KB
testcase_88 AC 168 ms
6,144 KB
testcase_89 AC 385 ms
9,252 KB
testcase_90 AC 174 ms
6,016 KB
testcase_91 AC 434 ms
9,728 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define FOR(v, a, b) for(int v = (a); v < (b); ++v)
#define FORE(v, a, b) for(int v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(int v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define LLI long long int
#define fst first
#define snd second
#ifndef M_PI
#define M_PI 3.14159265358979323846
#endif
#ifndef M_E
#define M_E 2.71828182845904523536
#endif
#ifdef DEBUG
#include <boost/core/demangle.hpp>
#define dump(x) cerr << "L" << __LINE__ << ": in " << __PRETTY_FUNCTION__ << " \e[32;1m" << boost::core::demangle(typeid(x).name()) << "\e[37m" << " " << (#x) << " = " << (x) << "\e[m" << endl;
#else
#define dump(x)
#endif
using namespace std;
#define gcd __gcd
template <class T> constexpr T lcm(T m, T n){return m*n/gcd(m,n);}

template <typename T> using V = vector<T>;
template <typename T, typename U> using P = pair<T,U>;
template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}
template <typename T, typename U> istream& operator>>(istream &is, pair<T,U> &p){is >> p.first >> p.second; return is;}

template <typename Iter> ostream& out_container(ostream &os, Iter first, Iter last){
  os << "{"; auto itr = first; while(itr != last){if(itr != first) os << ","; os << *itr; ++itr;} os << "}"; return os;
}

template <typename T> ostream& operator<<(ostream &os, const vector<T> &c){return out_container(os,ALL(c));}
template <typename T> ostream& operator<<(ostream &os, const deque<T> &c){return out_container(os,ALL(c));}
template <typename T> ostream& operator<<(ostream &os, const set<T> &c){return out_container(os,ALL(c));}
template <typename T> ostream& operator<<(ostream &os, const unordered_set<T> &c){return out_container(os,ALL(c));}
template <typename T, typename U> ostream& operator<<(ostream &os, const map<T,U> &c){return out_container(os,ALL(c));}
template <typename T, typename U> ostream& operator<<(ostream &os, const unordered_map<T,U> &c){return out_container(os,ALL(c));}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T,U> &p){os << "(" << p.first << "," << p.second << ")"; return os;}

template <typename T> T& chmin(T &a, const T &b){return a = min(a,b);}
template <typename T> T& chmax(T &a, const T &b){return a = max(a,b);}


// 追加直線の傾きが単調減少、minクエリの値が単調増加
template <typename T> class ConvexHullTrick{
public:
  deque<pair<T,T>> lines;

  bool is_needless(pair<T,T> a, pair<T,T> b, pair<T,T> c){
    return (a.snd-b.snd)*(a.fst-c.fst) >= (a.snd-c.snd)*(a.fst-b.fst);
  }
  
  void add(T a, T b){
    if(!lines.empty()){
      auto l = lines.back();
      if(l.fst == a){
	if(l.snd < b) return;
	else lines.pop_back();
      }
    }
    while(lines.size()>=2 && is_needless(make_pair(a,b), lines.back(), *(lines.end()-2))){
      lines.pop_back();
    }
    lines.push_back(make_pair(a,b));
  }

  T apply(pair<T,T> f, T x){
    return f.fst*x + f.snd;
  }

  T query(T x){
    while(lines.size()>=2 && apply(lines[0],x)>apply(lines[1],x)){
      lines.pop_front();
    }
    return apply(lines[0],x);
  }
};

class Rational{
public:
  int64_t nume, deno;
  Rational(): nume(0), deno(1){}
  Rational(int64_t num): nume(num), deno(1){} 
  Rational(int64_t num, int64_t den){
    int64_t g = gcd(num,den);
    nume = num/g;
    deno = den/g;
  }
  Rational& operator+=(const Rational &a);
  Rational& operator-=(const Rational &a);
  Rational& operator*=(const Rational &a);
  Rational& operator/=(const Rational &a);
};

ostream& operator<<(ostream &os, const Rational &r){os << r.nume << "/" << r.deno; return os;}
istream& operator>>(istream &is, Rational &r){is >> r.nume; r.deno = 1; return is;}

Rational operator-(const Rational &a){return Rational(-a.nume, a.deno);}

Rational operator+(const Rational &a, const Rational &b){int64_t l = lcm(a.deno,b.deno); return Rational(a.nume*l/a.deno + b.nume*l/b.deno, l);}
Rational operator-(const Rational &a, const Rational &b){int64_t l = lcm(a.deno,b.deno); return Rational(a.nume*l/a.deno - b.nume*l/b.deno, l);}
Rational operator*(const Rational &a, const Rational &b){return Rational(a.nume*b.nume, a.deno*b.deno);}
Rational operator/(const Rational &a, const Rational &b){return Rational(a.nume*b.deno, a.deno*b.nume);}

bool operator==(const Rational &a, const Rational &b){return a.nume == b.nume && a.deno == b.deno;}
bool operator!=(const Rational &a, const Rational &b){return !(a==b);}
bool operator<(const Rational &a, const Rational &b){return a.nume*b.deno < b.nume*a.deno;}
bool operator<=(const Rational &a, const Rational &b){return a.nume*b.deno <= b.nume*a.deno;}
bool operator>(const Rational &a, const Rational &b){return !(a<=b);}
bool operator>=(const Rational &a, const Rational &b){return !(a<b);}

double to_double(const Rational &a){return (double)a.nume/a.deno;}

Rational& Rational::operator+=(const Rational &a){*this = *this+a; return *this;}
Rational& Rational::operator-=(const Rational &a){*this = *this-a; return *this;}
Rational& Rational::operator*=(const Rational &a){*this = *this*a; return *this;}
Rational& Rational::operator/=(const Rational &a){*this = *this/a; return *this;}

Rational abs(const Rational &a){return Rational(abs(a.nume), abs(a.deno));}



int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  LLI N;
  Rational A,B,W;
  while(cin >> N >> A >> B >> W){
    vector<Rational> D(N); cin >> D;

    vector<Rational> dp(N);

    ConvexHullTrick<Rational> cht;
    dp[0] = W+D[0];
    cht.add(-B/2,dp[0]+A*0+B*0*(0+1)/2);
    
    FOR(i,1,N){
      Rational t = cht.query(Rational(i));
      //dump(t);
      dp[i] = D[i]-A*(i-1)+B*i*i/2+t;
      chmin(dp[i], D[i]+W-A*i+B*i*(i+1)/2);

      cht.add(-B*(2*i+1)/2,dp[i]+A*i+B*i*(i+1)/2);
    }
    
    //dump(dp);

    Rational ans = -A*(N-1)+B*N*N/2+cht.query(N);
    chmin(ans, W-A*N+B*N*(N+1)/2);
    
    cout << ans.nume << endl;
  }
  
  return 0;
}
0