#926910 (C++23) No.952 危険な火薬庫

提出ソース

結果

問題	No.952 危険な火薬庫
ユーザー	ebi_fly
提出日時	2023-11-08 15:21:56
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	286 ms / 2,000 ms
コード長	7,676 bytes
コンパイル時間	1,903 ms
コンパイル使用メモリ	192,180 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-09-25 23:40:55
合計ジャッジ時間	5,347 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	205 ms 6,948 KB
testcase_04	AC	199 ms 6,940 KB
testcase_05	AC	156 ms 6,940 KB
testcase_06	AC	245 ms 6,944 KB
testcase_07	AC	85 ms 6,944 KB
testcase_08	AC	286 ms 6,940 KB
testcase_09	AC	282 ms 6,944 KB
testcase_10	AC	106 ms 6,940 KB
testcase_11	AC	2 ms 6,940 KB
testcase_12	AC	109 ms 6,940 KB
testcase_13	AC	116 ms 6,940 KB
testcase_14	AC	25 ms 6,940 KB
testcase_15	AC	176 ms 6,940 KB
testcase_16	AC	32 ms 6,944 KB
testcase_17	AC	24 ms 6,944 KB
testcase_18	AC	45 ms 6,940 KB
testcase_19	AC	3 ms 6,940 KB
testcase_20	AC	2 ms 6,944 KB
testcase_21	AC	96 ms 6,940 KB
testcase_22	AC	18 ms 6,944 KB
testcase_23	AC	3 ms 6,940 KB
testcase_24	AC	9 ms 6,940 KB
testcase_25	AC	228 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#line 1 "template/template.hpp"
#include <algorithm>
#include <bit>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdint>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <numbers>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <ranges>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, a, n) for (int i = ((int)(n)-1); i >= (int)(a); i--)
#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)
#define RRep(i, a, n) for (i64 i = ((i64)(n)-i64(1)); i >= (i64)(a); i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()

#line 2 "template/debug_template.hpp"

#line 4 "template/debug_template.hpp"

namespace ebi {

#ifdef LOCAL
#define debug(...)                                                      \
    std::cerr << "LINE: " << __LINE__ << "  [" << #__VA_ARGS__ << "]:", \
        debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif

void debug_out() {
    std::cerr << std::endl;
}

template <typename Head, typename... Tail> void debug_out(Head h, Tail... t) {
    std::cerr << " " << h;
    if (sizeof...(t) > 0) std::cerr << " :";
    debug_out(t...);
}

}  // namespace ebi
#line 2 "template/int_alias.hpp"

#line 4 "template/int_alias.hpp"

namespace ebi {

using std::size_t;
using i8 = std::int8_t;
using u8 = std::uint8_t;
using i16 = std::int16_t;
using u16 = std::uint16_t;
using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;

}  // namespace ebi
#line 2 "template/io.hpp"

#line 7 "template/io.hpp"

namespace ebi {

template <typename T1, typename T2>
std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {
    return os << pa.first << " " << pa.second;
}

template <typename T1, typename T2>
std::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {
    return os >> pa.first >> pa.second;
}

template <typename T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {
    for (std::size_t i = 0; i < vec.size(); i++)
        os << vec[i] << (i + 1 == vec.size() ? "" : " ");
    return os;
}

template <typename T>
std::istream &operator>>(std::istream &os, std::vector<T> &vec) {
    for (T &e : vec) std::cin >> e;
    return os;
}

template <typename T>
std::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {
    if (opt) {
        os << opt.value();
    } else {
        os << "invalid value";
    }
    return os;
}

void fast_io() {
    std::cout << std::fixed << std::setprecision(15);
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
}

}  // namespace ebi
#line 2 "template/utility.hpp"

#line 5 "template/utility.hpp"

#line 7 "template/utility.hpp"

namespace ebi {

template <class T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <class T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <class T> T safe_ceil(T a, T b) {
    if (a % b == 0)
        return a / b;
    else if (a >= 0)
        return (a / b) + 1;
    else
        return -((-a) / b);
}

template <class T> T safe_floor(T a, T b) {
    if (a % b == 0)
        return a / b;
    else if (a >= 0)
        return a / b;
    else
        return -((-a) / b) - 1;
}

constexpr i64 LNF = std::numeric_limits<i64>::max() / 4;

constexpr int INF = std::numeric_limits<int>::max() / 2;

const std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};
const std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};

}  // namespace ebi
#line 2 "algorithm/enumerate_monge_d_edge_shortest_path.hpp"

#line 6 "algorithm/enumerate_monge_d_edge_shortest_path.hpp"

#line 2 "algorithm/monotone_minima.hpp"

#line 6 "algorithm/monotone_minima.hpp"

namespace ebi {

template <class F,
          class T = decltype(std::declval<F>()(std::declval<int>(),
                                               std::declval<int>())),
          class Compare = std::less<T>>
std::pair<std::vector<int>, std::vector<T>> monotone_minima(
    int n, int m, F f, const Compare &compare = Compare()) {
    std::vector<int> argmin(n);
    std::vector<T> min_val(n);
    auto dfs = [&](auto &&self, int top, int bottom, int left,
                   int right) -> void {
        if (top > bottom) return;
        int mid = (top + bottom) >> 1;
        argmin[mid] = left;
        min_val[mid] = f(mid, left);
        for (int i = left + 1; i <= right; i++) {
            T val = f(mid, i);
            if (min_val[mid] == val || compare(val, min_val[mid])) {
                argmin[mid] = i;
                min_val[mid] = val;
            }
        }
        self(self, top, mid - 1, left, argmin[mid]);
        self(self, mid + 1, bottom, argmin[mid], right);
    };
    dfs(dfs, 0, n - 1, 0, m - 1);
    return {argmin, min_val};
}

template <class T, class F, class Compare = std::less<T>>
std::pair<std::vector<int>, std::vector<T>> slide_monotone_minima(
    int n, int m, F f, const Compare &compare = Compare()) {
    std::vector<int> argmin(n);
    std::vector<T> min_val(n);
    auto dfs = [&](auto &&self, int top, int bottom, int left, int right,
                   int depth) -> void {
        if (top > bottom) return;
        int mid = (top + bottom) >> 1;
        argmin[mid] = left;
        min_val[mid] = f(mid, left, depth);
        for (int i = left + 1; i <= right; i++) {
            T val = f(mid, i, depth);
            if (min_val[mid] == val || compare(val, min_val[mid])) {
                argmin[mid] = i;
                min_val[mid] = val;
            }
        }
        self(self, top, mid - 1, left, argmin[mid], depth + 1);
        self(self, mid + 1, bottom, argmin[mid], right, depth + 1);
    };
    dfs(dfs, 0, n - 1, 0, m - 1, 0);
    return {argmin, min_val};
}

}  // namespace ebi
#line 8 "algorithm/enumerate_monge_d_edge_shortest_path.hpp"

namespace ebi {

template <class F, class T = decltype(std::declval<F>()(std::declval<int>(),
                                                        std::declval<int>()))>
std::vector<T> enumerate_monge_d_edge_shortest_path(int n, F f) {
    const T max = std::numeric_limits<T>::max();
    std::vector<T> res(n, max);
    std::vector<T> dp(n, max);
    dp[0] = 0;
    auto g = [&](int j, int i) -> T {
        if(dp[i] == max || i >= j) return max;
        return dp[i] + f(i, j);
    };
    for(int d = 1; d < n; d++) {
        std::vector<int> argmin = monotone_minima(n, n, g).first;
        for(int i = n-1; i >= d; i--) dp[i] = g(i, argmin[i]);
        res[d] = dp[n-1];
    }
    return res;
}

}
#line 3 "a.cpp"

namespace ebi {

void main_() {
    int n;
    std::cin >> n;
    std::vector<i64> a(n);
    std::cin >> a;
    a.insert(a.begin(), 0);
    n++;
    std::vector<i64> sum(n+1, 0);
    rep(i,0,n) sum[i+1] = sum[i] + a[i];
    auto f = [&](int i, int j) -> i64 {
        return (sum[j] - sum[i+1]) * (sum[j] - sum[i+1]);
    };
    auto ans = enumerate_monge_d_edge_shortest_path(n+1, f);
    rep(i,1,n) {
        std::cout << ans[n-i] << '\n';
    }
}

}  // namespace ebi

int main() {
    ebi::fast_io();
    int t = 1;
    // std::cin >> t;
    while (t--) {
        ebi::main_();
    }
    return 0;
}

yukicoder

結果

テストケース

ソースコード