結果
問題 | No.1297 銅像 |
ユーザー | satashun |
提出日時 | 2021-01-02 23:22:17 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,385 bytes |
コンパイル時間 | 2,241 ms |
コンパイル使用メモリ | 209,708 KB |
実行使用メモリ | 15,488 KB |
最終ジャッジ日時 | 2024-10-12 14:09:24 |
合計ジャッジ時間 | 6,013 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
10,496 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | TLE | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;using pii = pair<int, int>;template <class T>using V = vector<T>;template <class T>using VV = V<V<T>>;#define pb push_back#define eb emplace_back#define mp make_pair#define fi first#define se second#define rep(i, n) rep2(i, 0, n)#define rep2(i, m, n) for (int i = m; i < (n); i++)#define per(i, b) per2(i, 0, b)#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)#define ALL(c) (c).begin(), (c).end()#define SZ(x) ((int)(x).size())constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }template <class T, class U>void chmin(T& t, const U& u) {if (t > u) t = u;}template <class T, class U>void chmax(T& t, const U& u) {if (t < u) t = u;}template <class T, class U>ostream& operator<<(ostream& os, const pair<T, U>& p) {os << "(" << p.first << "," << p.second << ")";return os;}template <class T>ostream& operator<<(ostream& os, const vector<T>& v) {os << "{";rep(i, v.size()) {if (i) os << ",";os << v[i];}os << "}";return os;}#ifdef LOCALvoid debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << " " << H;debug_out(T...);}#define debug(...) \cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl#else#define debug(...) (void(0))#define dump(x) (void(0))#endifstruct Line {mutable ll k, m, p;bool operator<(const Line& o) const { return k < o.k; }bool operator<(ll x) const { return p < x; }};struct LineContainer : multiset<Line, less<>> {// (for doubles, use inf = 1/.0, div(a,b) = a/b)static const ll inf = LLONG_MAX;ll div(ll a, ll b) { // floored divisionreturn a / b - ((a ^ b) < 0 && a % b);}bool isect(iterator x, iterator y) {if (y == end()) return x->p = inf, 0;if (x->k == y->k)x->p = x->m > y->m ? inf : -inf;elsex->p = div(y->m - x->m, x->k - y->k);return x->p >= y->p;}void add(ll k, ll m) {auto z = insert({k, m, 0}), y = z++, x = y;while (isect(y, z)) z = erase(z);if (x != begin() && isect(--x, y)) isect(x, y = erase(y));while ((y = x) != begin() && (--x)->p >= y->p) isect(x, erase(y));}ll query(ll x) {assert(!empty());auto l = *lower_bound(x);return l.k * x + l.m;}};const ll INF = TEN(18);int main() {cin.tie(nullptr);ios::sync_with_stdio(false);int N;ll C;cin >> N >> C;V<ll> a(N), b(N);rep(i, N) cin >> a[i] >> b[i];V<ll> dp(N + 1, INF), sub(N + 1, INF);dp[0] = 0;LineContainer ls, ld;rep(i, N) {ls.add(i * 2, i * C - C * i * i - dp[i]);sub[i + 1] = -ls.query(i + a[i]);for (int j = 0; j <= i; ++j) {if (j) {chmin(dp[i + 1], sub[j] + a[j - 1] * (i + 1 - j) +ll(i - j + 1) * (i - j + 2) / 2 * C);}}sub[i + 1] =sub[i + 1] / 2 + b[i] + a[i] * (i + 1) + C * i * (i + 1) / 2;chmin(dp[i + 1], sub[i + 1]);}debug(dp);debug(sub);cout << dp[N] << endl;return 0;}