結果
問題 | No.2889 Rusk |
ユーザー | 👑 binap |
提出日時 | 2024-09-13 21:58:25 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 288 ms / 2,000 ms |
コード長 | 2,880 bytes |
コンパイル時間 | 4,511 ms |
コンパイル使用メモリ | 266,776 KB |
実行使用メモリ | 9,600 KB |
最終ジャッジ日時 | 2024-09-13 21:58:42 |
合計ジャッジ時間 | 11,911 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 3 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,944 KB |
testcase_06 | AC | 2 ms
6,940 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,944 KB |
testcase_11 | AC | 3 ms
6,944 KB |
testcase_12 | AC | 2 ms
6,940 KB |
testcase_13 | AC | 2 ms
6,940 KB |
testcase_14 | AC | 11 ms
6,940 KB |
testcase_15 | AC | 45 ms
6,944 KB |
testcase_16 | AC | 112 ms
6,940 KB |
testcase_17 | AC | 32 ms
6,940 KB |
testcase_18 | AC | 94 ms
6,940 KB |
testcase_19 | AC | 183 ms
7,424 KB |
testcase_20 | AC | 223 ms
8,448 KB |
testcase_21 | AC | 183 ms
7,424 KB |
testcase_22 | AC | 156 ms
6,944 KB |
testcase_23 | AC | 125 ms
6,940 KB |
testcase_24 | AC | 225 ms
8,320 KB |
testcase_25 | AC | 122 ms
6,944 KB |
testcase_26 | AC | 177 ms
7,424 KB |
testcase_27 | AC | 231 ms
8,576 KB |
testcase_28 | AC | 136 ms
6,944 KB |
testcase_29 | AC | 141 ms
6,940 KB |
testcase_30 | AC | 139 ms
6,944 KB |
testcase_31 | AC | 228 ms
8,576 KB |
testcase_32 | AC | 98 ms
6,944 KB |
testcase_33 | AC | 28 ms
6,940 KB |
testcase_34 | AC | 271 ms
9,472 KB |
testcase_35 | AC | 267 ms
9,472 KB |
testcase_36 | AC | 265 ms
9,472 KB |
testcase_37 | AC | 268 ms
9,472 KB |
testcase_38 | AC | 267 ms
9,472 KB |
testcase_39 | AC | 110 ms
8,960 KB |
testcase_40 | AC | 86 ms
7,680 KB |
testcase_41 | AC | 116 ms
9,344 KB |
testcase_42 | AC | 80 ms
7,296 KB |
testcase_43 | AC | 38 ms
6,940 KB |
testcase_44 | AC | 103 ms
8,576 KB |
testcase_45 | AC | 79 ms
7,296 KB |
testcase_46 | AC | 23 ms
6,940 KB |
testcase_47 | AC | 42 ms
6,940 KB |
testcase_48 | AC | 93 ms
8,064 KB |
testcase_49 | AC | 2 ms
6,940 KB |
testcase_50 | AC | 2 ms
6,940 KB |
testcase_51 | AC | 2 ms
6,940 KB |
testcase_52 | AC | 2 ms
6,944 KB |
testcase_53 | AC | 2 ms
6,944 KB |
testcase_54 | AC | 288 ms
9,600 KB |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> #define rep(i,n) for(int i=0;i<n;i++) using namespace std; using namespace atcoder; typedef long long ll; typedef vector<int> vi; typedef vector<long long> vl; typedef vector<vector<int>> vvi; typedef vector<vector<long long>> vvl; typedef long double ld; typedef pair<int, int> P; ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;} template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;} template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;} template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;} template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;} template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename T> void chmin(T& a, T b){a = min(a, b);} template<typename T> void chmax(T& a, T b){a = max(a, b);} const long long INF = 1001001001001001001; int main(){ int n; cin >> n; vector<vector<long long>> dp(3, vector<long long>(3, -INF)); dp[0][0] = 0; vector<vector<long long>> a(3, vector<long long>(n)); cin >> a; rep(i, n){ vector<vector<long long>> dp_old(3, vector<long long>(3, -INF)); swap(dp, dp_old); rep(j, 3) rep(k, 3){ if(dp_old[j][k] == -INF) continue; chmax(dp[j][k], dp_old[j][k] + a[k][i]); if(k > 0) chmax(dp[j][k - 1], dp_old[j][k] + a[k - 1][i]); if(j < 1 and k < 1) chmax(dp[j + 2][k + 2], dp_old[j][k] + a[k + 2][i]); if(j < 2 and k < 2) chmax(dp[j + 1][k + 1], dp_old[j][k] + a[k + 1][i]); } // cout << dp; } long long ans = 0; rep(j, 3) rep(k, 3) chmax(ans, dp[j][k]); cout << ans << "\n"; return 0; }