結果
問題 | No.1297 銅像 |
ユーザー | ei1333333 |
提出日時 | 2020-11-20 22:45:53 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,587 bytes |
コンパイル時間 | 2,473 ms |
コンパイル使用メモリ | 214,264 KB |
実行使用メモリ | 13,888 KB |
最終ジャッジ日時 | 2024-07-23 13:31:08 |
合計ジャッジ時間 | 7,258 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
13,888 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,940 KB |
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 | -- | - |
コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:64, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/specfun.h:45, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/cmath:1935, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:41, from main.cpp:1: In member function 'std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::__conditional_t<std::__and_<std::is_move_assignable<_Tp>, std::is_move_assignable<_T2> >::value, std::pair<_T1, _T2>&&, std::__nonesuch&&>) [with _T1 = int; _T2 = long int]', inlined from 'monotone_minima<long int, std::less<long int> >(int, int, const std::function<long int(int, int)>&, const std::less<long int>&)::<lambda(int, int, int, int)>' at main.cpp:108:14, inlined from 'constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = monotone_minima<long int, std::less<long int> >(int, int, const std::function<long int(int, int)>&, const std::less<long int>&)::<lambda(int, int, int, int)>&; _Args = {int, int, int, int}]' at /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/invoke.h:61:36, inlined from 'constexpr std::enable_if_t<is_invocable_r_v<_Res, _Callable, _Args ...>, _Res> std::__invoke_r(_Callable&&, _Args&& ...) [with _Res = void; _Callable = monotone_minima<long int, std::less<long int> >(int, int, const std::function<long int(int, int)>&, const std::less<long int>&)::<lambda(int, int, int, int)>&; _Args = {int, int, int, int}]' at /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/invoke.h:111:28, inlined from 'static _Res std::_Function_handler<_Res(_ArgTypes ...), _Functor>::_M_invoke(const std::_Any_data&, _ArgTypes&& ...) [with _Res = void; _Functor = monotone_minima<long int, std::less<long int> >(int, int, const std::function<l
ソースコード
#include <bits/stdc++.h> using namespace std; using int64 = long long; // const int mod = 1e9 + 7; const int mod = 998244353; const int64 infll = (1LL << 62) - 1; const int inf = (1 << 30) - 1; struct IoSetup { IoSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); } } iosetup; template< typename T1, typename T2 > ostream &operator<<(ostream &os, const pair< T1, T2 > &p) { os << p.first << " " << p.second; return os; } template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; } template< typename T > ostream &operator<<(ostream &os, const vector< T > &v) { for(int i = 0; i < (int) v.size(); i++) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; } template< typename T > istream &operator>>(istream &is, vector< T > &v) { for(T &in : v) is >> in; return is; } template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); } template< typename T = int64 > vector< T > make_v(size_t a) { return vector< T >(a); } template< typename T, typename... Ts > auto make_v(size_t a, Ts... ts) { return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...)); } template< typename T, typename V > typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) { t = v; } template< typename T, typename V > typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e, v); } template< typename F > struct FixPoint : F { FixPoint(F &&f) : F(forward< F >(f)) {} template< typename... Args > decltype(auto) operator()(Args &&... args) const { return F::operator()(*this, forward< Args >(args)...); } }; template< typename F > inline decltype(auto) MFP(F &&f) { return FixPoint< F >{forward< F >(f)}; } /** * @brief Monotone-Minima * @docs docs/monotone-minima.md */ template< typename T, typename Compare = less< T > > vector< pair< int, T > > monotone_minima(int H, int W, const function< T(int, int) > &f, const Compare &comp = Compare()) { vector< pair< int, T > > dp(H); function< void(int, int, int, int) > dfs = [&](int top, int bottom, int left, int right) { if(top > bottom) return; int line = (top + bottom) / 2; T ma; int mi = -1; for(int i = left; i <= right; i++) { T cst = f(line, i); if(mi == -1 || comp(cst, ma)) { ma = cst; mi = i; } } dp[line] = make_pair(mi, ma); dfs(top, line - 1, left, mi); dfs(line + 1, bottom, mi, right); }; dfs(0, H - 1, 0, W - 1); return dp; } /** * @brief Online-Offline-DP(オンライン・オフライン変換) * @docs docs/online-offline-dp.md */ template< typename T, typename Compare = less< T > > vector< T > online_offline_dp(int W, const function< T(int, int) > &f, const Compare &comp = Compare()) { vector< T > dp(W + 1); vector< int > isset(W + 1); int y_base = -1, x_base = -1; function< T(int, int) > get_cost = [&](int y, int x) { // return dp[0, x+x_base)+f[x+x_base, y+y_base) return dp[x + x_base] + f(x + x_base, y + y_base); }; function< void(int, int, int) > induce = [&](int l, int m, int r) { // dp[l, m) -> dp[m, r) x_base = l, y_base = m; auto ret = monotone_minima(r - m, m - l, get_cost, comp); for(int i = 0; i < ret.size(); i++) { if(!isset[m + i] || comp(ret[i].second, dp[m + i])) { isset[m + i] = true; dp[m + i] = ret[i].second; } } }; function< void(int, int) > dfs = [&](int l, int r) { if(l + 1 == r) { x_base = l, y_base = l; T cst = l ? get_cost(0, -1) : 0; if(!isset[l] || comp(cst, dp[l])) { isset[l] = true; dp[l] = cst; } } else { int mid = (l + r) / 2; dfs(l, mid); induce(l, mid, r); dfs(mid, r); } }; dfs(0, W + 1); return dp; }; int main() { int N, C; cin >> N >> C; vector< int64 > A(N), B(N); for(int i = 0; i < N; i++) { cin >> A[i] >> B[i]; } function< int64_t(int, int) > dist = [&](int x, int y) { --y; int64 ret = infll; for(int p = x; p <= y; p++) { int top = p - x; int bottom = y - p; chmin(ret, A[p] * (y - x + 1) + B[p] + top * (top + 1) / 2 * C + bottom * (bottom + 1) / 2 * C); } return ret; }; cout << online_offline_dp(N, dist).back() << "\n"; }