結果
問題 | No.2139 K Consecutive Sushi |
ユーザー | sten_san |
提出日時 | 2022-12-06 11:31:57 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 166 ms / 2,000 ms |
コード長 | 3,115 bytes |
コンパイル時間 | 2,345 ms |
コンパイル使用メモリ | 202,692 KB |
実行使用メモリ | 21,584 KB |
最終ジャッジ日時 | 2024-04-21 04:56:54 |
合計ジャッジ時間 | 6,404 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 166 ms
21,304 KB |
testcase_04 | AC | 155 ms
14,320 KB |
testcase_05 | AC | 164 ms
21,028 KB |
testcase_06 | AC | 166 ms
21,584 KB |
testcase_07 | AC | 166 ms
21,112 KB |
testcase_08 | AC | 138 ms
14,056 KB |
testcase_09 | AC | 146 ms
13,952 KB |
testcase_10 | AC | 150 ms
14,096 KB |
testcase_11 | AC | 149 ms
13,896 KB |
testcase_12 | AC | 131 ms
14,068 KB |
testcase_13 | AC | 2 ms
6,940 KB |
testcase_14 | AC | 2 ms
6,940 KB |
testcase_15 | AC | 2 ms
6,940 KB |
testcase_16 | AC | 2 ms
6,944 KB |
testcase_17 | AC | 2 ms
6,940 KB |
testcase_18 | AC | 3 ms
6,940 KB |
testcase_19 | AC | 2 ms
6,944 KB |
testcase_20 | AC | 2 ms
6,940 KB |
testcase_21 | AC | 2 ms
6,944 KB |
testcase_22 | AC | 3 ms
6,944 KB |
testcase_23 | AC | 14 ms
6,940 KB |
testcase_24 | AC | 50 ms
7,936 KB |
testcase_25 | AC | 104 ms
12,576 KB |
testcase_26 | AC | 17 ms
6,944 KB |
testcase_27 | AC | 43 ms
7,808 KB |
testcase_28 | AC | 46 ms
7,936 KB |
testcase_29 | AC | 22 ms
6,940 KB |
testcase_30 | AC | 55 ms
8,192 KB |
testcase_31 | AC | 138 ms
13,824 KB |
testcase_32 | AC | 24 ms
6,940 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; struct iofast_t { iofast_t() { ios::sync_with_stdio(false); cin.tie(nullptr); } } iofast; struct uns_t {} uns; template <typename Element, typename Head, typename ...Args> auto vec(Element init, Head arg, Args ...args) { if constexpr (sizeof...(Args) == 0) return vector(arg, init); else return vector(arg, vec(init, args...)); } template <typename Element, typename Head, typename ...Args> auto vec(uns_t, Head arg, Args ...args) { return vec(Element(), arg, args...); } template <typename Container> auto distance(const Container &c, decltype(begin(c)) iter) { return distance(begin(c), iter); } template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>> auto isort(RIter first, RIter last, Compare comp = Compare()) { vector<int> i(distance(first, last)); iota(begin(i), end(i), 0); sort(begin(i), end(i), [&](auto x, auto y) { return comp(*(first + x), *(first + y)); }); return i; } template <typename, template <typename> typename, typename = void_t<>> struct detect : false_type {}; template <typename T, template <typename> typename Check> struct detect<T, Check, void_t<Check<T>>> : true_type {}; template <typename T, template <typename> typename Check> constexpr inline bool detect_v = detect<T, Check>::value; template <typename T> using has_member_sort = decltype(declval<T>().sort()); template <typename Container, typename Compare = less<typename Container::value_type>> auto sorted(Container c, Compare comp = Compare()) { if constexpr (detect_v<Container, has_member_sort>) { c.sort(comp); return c; } else { sort(begin(c), end(c), comp); return c; } } template <typename Container, typename Compare = equal_to<typename Container::value_type>> auto uniqued(Container c, Compare comp = Compare()) { c.erase(unique(begin(c), end(c), comp), end(c)); return c; } template <typename T, typename Compare = less<T>> T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); } template <typename T, typename Compare = less<T>> T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); } #include <atcoder/lazysegtree> auto op(int64_t a, int64_t b) { return max(a, b); } auto elem() { return INT64_MIN; } auto mapping(int64_t f, int64_t x) { return f + x; } auto composition(int64_t f, int64_t g) { return f + g; } auto id() { return int64_t(0); } using segtree = atcoder::lazy_segtree<int64_t, op, elem, int64_t, mapping, composition, id>; int main() { int n, k; cin >> n >> k; auto a = vec<int64_t>(uns, n); for (auto &e : a) cin >> e; auto dp = vec<int64_t>(uns, n + 1); segtree seg(vec<int64_t>(0, n + k + 1)); dp[0] = 0; for (int i = 1; i <= n; ++i) { int l = i - k; int r = i - 1; seg.apply(l + k, r + k, a[i - 1]); dp[i] = max( dp[i - 1], seg.prod(l + k, r + k) ); seg.set(i + k, dp[i]); } cout << dp[n] << endl; }