結果

問題 No.2889 Rusk
ユーザー fuppy_kyoprofuppy_kyopro
提出日時 2024-09-13 21:44:47
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 145 ms / 2,000 ms
コード長 5,158 bytes
コンパイル時間 2,422 ms
コンパイル使用メモリ 210,728 KB
実行使用メモリ 31,400 KB
最終ジャッジ日時 2024-09-13 21:45:07
合計ジャッジ時間 7,628 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 3 ms
6,944 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 3 ms
6,940 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 2 ms
6,944 KB
testcase_07 AC 2 ms
6,944 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 2 ms
6,940 KB
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 2 ms
6,940 KB
testcase_12 AC 2 ms
6,944 KB
testcase_13 AC 2 ms
6,940 KB
testcase_14 AC 6 ms
6,944 KB
testcase_15 AC 21 ms
7,600 KB
testcase_16 AC 51 ms
14,816 KB
testcase_17 AC 15 ms
6,940 KB
testcase_18 AC 42 ms
13,056 KB
testcase_19 AC 80 ms
22,148 KB
testcase_20 AC 99 ms
26,572 KB
testcase_21 AC 83 ms
22,368 KB
testcase_22 AC 70 ms
19,596 KB
testcase_23 AC 56 ms
16,064 KB
testcase_24 AC 98 ms
26,332 KB
testcase_25 AC 55 ms
15,708 KB
testcase_26 AC 81 ms
21,852 KB
testcase_27 AC 103 ms
27,212 KB
testcase_28 AC 60 ms
17,304 KB
testcase_29 AC 64 ms
17,916 KB
testcase_30 AC 63 ms
17,760 KB
testcase_31 AC 103 ms
27,020 KB
testcase_32 AC 44 ms
13,424 KB
testcase_33 AC 13 ms
6,940 KB
testcase_34 AC 120 ms
31,400 KB
testcase_35 AC 145 ms
31,276 KB
testcase_36 AC 119 ms
31,272 KB
testcase_37 AC 121 ms
31,400 KB
testcase_38 AC 121 ms
31,272 KB
testcase_39 AC 81 ms
28,784 KB
testcase_40 AC 62 ms
22,936 KB
testcase_41 AC 83 ms
29,968 KB
testcase_42 AC 59 ms
21,464 KB
testcase_43 AC 27 ms
11,716 KB
testcase_44 AC 75 ms
27,160 KB
testcase_45 AC 57 ms
21,320 KB
testcase_46 AC 17 ms
8,172 KB
testcase_47 AC 30 ms
12,568 KB
testcase_48 AC 67 ms
24,508 KB
testcase_49 AC 2 ms
6,944 KB
testcase_50 AC 2 ms
6,940 KB
testcase_51 AC 2 ms
6,940 KB
testcase_52 AC 2 ms
6,940 KB
testcase_53 AC 2 ms
6,944 KB
testcase_54 AC 127 ms
31,400 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/

// #include <atcoder/all>
#include <bits/stdc++.h>

using namespace std;
// using namespace atcoder;

// #define _GLIBCXX_DEBUG

#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v)                                        \
    cerr << #v << ":";                                      \
    for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \
        cerr << " " << v[iiiiiiii];                         \
    cerr << endl;
#define DEBUG_MAT(v)                                \
    cerr << #v << endl;                             \
    for (int iv = 0; iv < v.size(); iv++) {         \
        for (int jv = 0; jv < v[iv].size(); jv++) { \
            cerr << v[iv][jv] << " ";               \
        }                                           \
        cerr << endl;                               \
    }
typedef long long ll;
// #define int ll

#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
    return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template <class S, class T>
ostream &operator<<(ostream &os, pair<S, T> p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}
#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 rrep(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
void YES(bool t = true) {
    cout << (t ? "YES" : "NO") << endl;
}
void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }
void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }
void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }
void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }
void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }
template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T, class U>
T ceil_div(T a, U b) {
    return (a + b - 1) / b;
}
template <class T>
T safe_mul(T a, T b) {
    if (a == 0 || b == 0) return 0;
    if (numeric_limits<T>::max() / a < b) return numeric_limits<T>::max();
    return a * b;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
vector<int> gen_perm(int n) {
    vector<int> ret(n);
    iota(all(ret), 0);
    return ret;
}
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 0, -1, 1}, dy = {-1, 1, 0, 0};
vi dx2 = {1, 1, 0, -1, -1, -1, 0, 1}, dy2 = {0, 1, 1, 1, 0, -1, -1, -1};
struct Setup_io {
    Setup_io() {
        ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        cout << fixed << setprecision(25);
        cerr << fixed << setprecision(25);
    }
} setup_io;
// constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;
// #define mp make_pair

ll solve1(int n, vl a, vl b, vl c) {
    vll dp(n + 1, vl(5, -INF));
    dp[0][0] = 0;

    rep(i, n) {
        rep(j, 5) {
            if (dp[i][j] == -INF) continue;

            for (int nj = j; nj < 5; nj++) {
                ll add;
                if (nj == 0 || nj == 4) {
                    add = a[i];
                } else if (nj == 1 || nj == 3) {
                    add = b[i];
                } else {
                    add = c[i];
                }

                chmax(dp[i + 1][nj], dp[i][j] + add);
            }
        }
    }

    return *max_element(all(dp[n]));
}

ll solve2(int n, vl a, vl b, vl c) {
    vll dp(n + 1, vl(5, -INF));
    dp[0][0] = 0;

    rep(i, n) {
        rep(j, 5) {
            if (dp[i][j] == -INF) continue;

            for (int nj = j; nj < 5; nj++) {
                ll add;
                if (nj == 0 || nj == 2 || nj == 4) {
                    add = a[i];
                } else if (nj == 1 || nj == 3) {
                    add = b[i];
                }

                chmax(dp[i + 1][nj], dp[i][j] + add);
            }
        }
    }

    return *max_element(all(dp[n]));
}

signed main() {
    int n;
    cin >> n;
    vl a(n), b(n), c(n);

    rep(i, n) {
        cin >> a[i];
    }
    rep(i, n) {
        cin >> b[i];
    }
    rep(i, n) {
        cin >> c[i];
    }

    cout << max({solve1(n, a, b, c), solve2(n, a, b, c)}) << endl;
}
0