結果

問題 No.952 危険な火薬庫
ユーザー haruki_Kharuki_K
提出日時 2019-12-15 23:48:09
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 426 ms / 2,000 ms
コード長 5,533 bytes
コンパイル時間 1,784 ms
コンパイル使用メモリ 178,168 KB
実行使用メモリ 144,036 KB
最終ジャッジ日時 2023-09-15 15:54:39
合計ジャッジ時間 6,453 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 295 ms
96,236 KB
testcase_04 AC 289 ms
94,416 KB
testcase_05 AC 232 ms
76,460 KB
testcase_06 AC 354 ms
114,656 KB
testcase_07 AC 117 ms
39,984 KB
testcase_08 AC 404 ms
129,968 KB
testcase_09 AC 410 ms
131,892 KB
testcase_10 AC 159 ms
53,184 KB
testcase_11 AC 1 ms
4,384 KB
testcase_12 AC 170 ms
56,152 KB
testcase_13 AC 178 ms
58,732 KB
testcase_14 AC 40 ms
15,492 KB
testcase_15 AC 262 ms
85,368 KB
testcase_16 AC 52 ms
19,376 KB
testcase_17 AC 40 ms
15,412 KB
testcase_18 AC 72 ms
25,772 KB
testcase_19 AC 2 ms
4,380 KB
testcase_20 AC 3 ms
4,376 KB
testcase_21 AC 152 ms
50,768 KB
testcase_22 AC 32 ms
12,716 KB
testcase_23 AC 3 ms
4,380 KB
testcase_24 AC 14 ms
7,080 KB
testcase_25 AC 426 ms
144,036 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#ifdef LOCAL
#define dump(...) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl;
#define debug if (1)
void dump_impl(const char*) { cerr << endl; }
template <class T, class... U> void dump_impl(const char *s, T const& x, U const& ...y) { const char *o = "({[", *e = "]})"; for (int i = 0; *s != '\0'; cerr << *s++) { if (count(o,o+3,*s)) i++; if (count(e,e+3,*s)) i--; if (!i && *s == ',') break; } cerr << " = " << x; if (*s == ',') cerr << ", ", s++; dump_impl(s, y...); }
#else
#define dump(...)
#define say(x)
#define debug if (0)
#endif
using ll = long long;
using ld = long double;
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { os << "{"; for (auto const& x : v) os << " " << x; return os << " }"; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
template <size_t i, class T> typename enable_if<i >= tuple_size<T>::value>::type output_tuple(ostream&, T const&) { }
template <size_t i = 0, class T> typename enable_if<i < tuple_size<T>::value>::type
output_tuple(ostream& os, T const& t) { os << (i ? " " : "") << get<i>(t); output_tuple<i+1,T>(os,t); }
template <class... T> ostream& operator<<(ostream& os, tuple<T...> const& t) { return output_tuple(os,t), os; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
//#define int ll
#define double ld
template <class T> int sz(T const& x) { return x.size(); }
const ll INF = (1LL<<62)-1; // ~ 4.6e18
// <<<
#define int __int128

int32_t main() {
    int32_t n; cin >> n;
    vector<int32_t> a(n); cin >> a;
    vector<int> s(n+1);
    rep (i,n) s[i+1] = s[i] + a[i];

    auto dp = make_v<int,2>(n+1,n+1,INF);
    rep (i,n+1) dp[0][i] = s[i]*s[i];

    rep (j,n) {
        deque<pair<int,int> > q;
        auto add = [&](int a, int b) -> void {
            while (1) {
                if (sz(q) < 2) { q.eb(a,b); return; }
                auto q1 = q.back();
                auto q0 = *prev(q.end(),2);
                int x1 = q1.fst - q0.fst, y1 = q1.snd - q0.snd;
                int x2 =      a - q0.fst, y2 =      b - q0.snd;
                if (x1*y2-y1*x2 >= 0) q.pop_back();
                else { q.eb(a,b); return; }
            }
        };
        auto query = [&](int x) -> int {
            while (1) {
                assert(sz(q));
                if (sz(q) == 1) return q[0].fst * x + q[0].snd;
                if (q[0].fst * x + q[0].snd <=
                    q[1].fst * x + q[1].snd) {
                    q.pop_front();
                } else {
                    return q[0].fst * x + q[0].snd;
                }
            }
        };
        rep (i,n) {
            add(2*s[i+1], -(dp[j][i]+s[i+1]*s[i+1]));
            dp[j+1][i+1] = s[i+1]*s[i+1] - query(s[i+1]);
        }
    }
    rep1 (k,n) cout << (ll)dp[n-k][n] << "\n";
}
0