結果
問題 | No.324 落ちてた閉路グラフ |
ユーザー | Konton7 |
提出日時 | 2020-07-06 23:31:38 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 105 ms / 5,000 ms |
コード長 | 6,166 bytes |
コンパイル時間 | 2,440 ms |
コンパイル使用メモリ | 212,156 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-09-24 20:12:37 |
合計ジャッジ時間 | 4,328 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
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 | 2 ms
6,940 KB |
testcase_04 | AC | 41 ms
6,944 KB |
testcase_05 | AC | 105 ms
6,944 KB |
testcase_06 | AC | 34 ms
6,944 KB |
testcase_07 | AC | 94 ms
6,940 KB |
testcase_08 | AC | 36 ms
6,940 KB |
testcase_09 | AC | 16 ms
6,944 KB |
testcase_10 | AC | 37 ms
6,940 KB |
testcase_11 | AC | 17 ms
6,940 KB |
testcase_12 | AC | 2 ms
6,944 KB |
testcase_13 | AC | 2 ms
6,944 KB |
testcase_14 | AC | 2 ms
6,940 KB |
testcase_15 | AC | 17 ms
6,940 KB |
testcase_16 | AC | 2 ms
6,940 KB |
testcase_17 | AC | 2 ms
6,944 KB |
testcase_18 | AC | 2 ms
6,940 KB |
testcase_19 | AC | 2 ms
6,944 KB |
testcase_20 | AC | 2 ms
6,944 KB |
testcase_21 | AC | 2 ms
6,940 KB |
testcase_22 | AC | 2 ms
6,944 KB |
testcase_23 | AC | 2 ms
6,940 KB |
testcase_24 | AC | 2 ms
6,944 KB |
testcase_25 | AC | 2 ms
6,944 KB |
testcase_26 | AC | 2 ms
6,940 KB |
testcase_27 | AC | 2 ms
6,940 KB |
testcase_28 | AC | 2 ms
6,940 KB |
testcase_29 | AC | 2 ms
6,944 KB |
testcase_30 | AC | 2 ms
6,940 KB |
testcase_31 | AC | 2 ms
6,944 KB |
testcase_32 | AC | 105 ms
6,940 KB |
testcase_33 | AC | 84 ms
6,940 KB |
testcase_34 | AC | 37 ms
6,940 KB |
testcase_35 | AC | 2 ms
6,940 KB |
testcase_36 | AC | 10 ms
6,944 KB |
testcase_37 | AC | 2 ms
6,940 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using VI = vector<int>; using VL = vector<ll>; using VS = vector<string>; using VB = vector<bool>; using VVI = vector<VI>; using VVL = vector<VL>; using PII = std::pair<int, int>; using VPII = std::vector<std::pair<int, int>>; using PLL = std::pair<ll, ll>; using VPLL = std::vector<std::pair<ll, ll>>; using TI3 = std::tuple<int, int, int>; using TI4 = std::tuple<int, int, int, int>; using TL3 = std::tuple<ll, ll, ll>; using TL4 = std::tuple<ll, ll, ll, ll>; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--) #define rep2(i, s, n) for (int i = (s); i < (int)(n); i++) #define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d)) #define allpt(v) (v).begin(), (v).end() #define allpt_c(v) (v).cbegin(), (v).cend() #define allpt_r(v) (v).rbegin(), (v).rend() #define allpt_cr(v) (v).crbegin(), (v).crend() const int mod1 = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9; const int mod = mod1; const ll inf = 1e18; const string wsp = " "; const string tb = "\t"; const string rt = "\n"; template <typename T> void show1dvec(const vector<T> &v) { if (v.size() == 0) return; int n = v.size() - 1; rep(i, n) cout << v[i] << wsp; cout << v[n] << rt; return; } template <typename T> void show2dvec(const vector<vector<T>> &v) { int n = v.size(); rep(i, n) show1dvec(v[i]); } template <typename T, typename S> void show1dpair(const vector<pair<T, S>> &v) { int n = v.size(); rep(i, n) cout << v[i].first << wsp << v[i].second << rt; return; } template <typename T, typename S> void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s) { int n = v.size(); rep(i, n) { t.push_back(v[i].first); s.push_back(v[i].second); } return; } template <typename T> void maxvec(vector<T> &v) { T s = v[0]; int n = v.size(); rep(i, n - 1) { if (s > v[i + 1]) { v[i + 1] = s; } s = v[i + 1]; } } template <typename T, typename S> bool myfind(T t, S s) { return find(t.cbegin(), t.cend(), s) != t.cend(); } bool check(int y, int x, int h, int w) { return 0 <= y && y < h && 0 <= x && x < w; } template <typename T> vector<T> cumsum(const vector<T> &v) { T s = 0; vector<T> ret; rep(i, v.size()) { s += v[i]; s %= mod; ret.emplace_back(s); } return ret; } bool iskadomatsu(int a, int b, int c) { return (a != b && b != c && c != a) && ((a > b && b < c) || (a < b && b > c)); } VS split(string s, char c) { VS ret; string part; s += c; rep(i, s.length()) { if (s[i] == c) { ret.emplace_back(part); part = ""; } else if (s[i] != c) { part += s[i]; } } return ret; } string removezero(string &s) { string ret; for (auto z : s) if (z != '0') ret += z; return ret; } ll sumdigit(ll x) { ll ans{0}; while (x > 0) { ans += x % 10; x /= 10; } return ans; } template <typename T, typename S, typename R> ll pow_mod(T p, S q, R mod = 1ll) { ll ret = 1, r = p; while (q) { if (q % 2) ret *= r, ret %= mod; r = (r * r) % mod, q /= 2; } return ret % mod; } template <typename T, typename S> ll pow_no_mod(T p, S q) { ll ret = 1, r = p; while (q) { if (q % 2) ret *= r; r = (r * r), q /= 2; } return ret; } void make_frac_tables(VL &frac_list, VL &frac_inv_list) { rep(i, frac_list.size() - 1) { frac_list[i + 1] *= frac_list[i] * (i + 1); frac_list[i + 1] %= mod; frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod); frac_inv_list[i + 1] %= mod; } } ll comb(int a, int b, const VL &frac_list, const VL &frac_inv_list) { if (a < b) return 0; if (b < 0) return 0; ll ret = frac_list[a]; ret *= frac_inv_list[b]; ret %= mod; ret *= frac_inv_list[a - b]; ret %= mod; return ret; } int main() { cin.tie(0); ios::sync_with_stdio(false); #ifdef DEBUG cout << "DEBUG MODE" << endl; ifstream in("input.txt"); //for debug cin.rdbuf(in.rdbuf()); //for debug #endif int n, m, maxdp1, maxdp2; const int intmin = -1000000; cin >> n >> m; VI values(n); rep(i, n) cin >> values[i]; if (n == m) { cout << accumulate(allpt_c(values), 0) << rt; return 0; } if (m == 0) { cout << 0 << rt; return 0; } VVI dp00(m + 1, VI(2, intmin)), new_dp00(m + 1, VI(2, intmin)); VVI dp01(m + 2, VI(2, intmin)), new_dp01(m + 2, VI(2, intmin)); dp00[0][0] = dp01[1][1] = 0; rep(i, n - 1) { rep(j, m + 1) rep(k, 2) { new_dp00[j][k] = intmin; } rep(j, m + 1) { new_dp00[j][0] = max(dp00[j][0], dp00[j][1]); if (j < m) { if (dp00[j][1] != intmin) new_dp00[j + 1][1] = max(dp00[j][0], dp00[j][1] + values[i]); new_dp00[j + 1][1] = max(new_dp00[j + 1][1], dp00[j][0]); } } rep(j, m + 1) rep(k, 2) { dp00[j][k] = new_dp00[j][k]; } } rep(i, n) { rep(j, m + 2) rep(k, 2) { new_dp01[j][k] = intmin; } rep(j, m + 2) { new_dp01[j][0] = max(dp01[j][0], dp01[j][1]); if (j < m + 1) { if (dp01[j][1] != intmin) { new_dp01[j + 1][1] = max(dp01[j][0], dp01[j][1] + values[i]); } new_dp01[j + 1][1] = max(new_dp01[j + 1][1], dp01[j][0]); } } rep(j, m + 2) rep(k, 2) { dp01[j][k] = new_dp01[j][k]; } } maxdp1 = max(dp00[m][0], dp00[m][1]); maxdp2 = dp01[m + 1][1]; cout << max(maxdp1, maxdp2) << rt; return 0; }