結果
問題 | No.2139 K Consecutive Sushi |
ユーザー | maspy |
提出日時 | 2022-12-03 00:40:01 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 32 ms / 2,000 ms |
コード長 | 17,193 bytes |
コンパイル時間 | 3,135 ms |
コンパイル使用メモリ | 230,052 KB |
実行使用メモリ | 10,632 KB |
最終ジャッジ日時 | 2024-05-05 19:21:59 |
合計ジャッジ時間 | 4,528 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 24 ms
10,632 KB |
testcase_04 | AC | 32 ms
10,372 KB |
testcase_05 | AC | 25 ms
10,372 KB |
testcase_06 | AC | 21 ms
10,460 KB |
testcase_07 | AC | 25 ms
10,468 KB |
testcase_08 | AC | 24 ms
10,504 KB |
testcase_09 | AC | 28 ms
10,460 KB |
testcase_10 | AC | 30 ms
10,504 KB |
testcase_11 | AC | 31 ms
10,504 KB |
testcase_12 | AC | 22 ms
10,508 KB |
testcase_13 | AC | 1 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 2 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 2 ms
5,376 KB |
testcase_18 | AC | 2 ms
5,376 KB |
testcase_19 | AC | 2 ms
5,376 KB |
testcase_20 | AC | 2 ms
5,376 KB |
testcase_21 | AC | 2 ms
5,376 KB |
testcase_22 | AC | 2 ms
5,376 KB |
testcase_23 | AC | 4 ms
5,376 KB |
testcase_24 | AC | 10 ms
5,376 KB |
testcase_25 | AC | 23 ms
9,360 KB |
testcase_26 | AC | 3 ms
5,376 KB |
testcase_27 | AC | 9 ms
5,376 KB |
testcase_28 | AC | 8 ms
5,376 KB |
testcase_29 | AC | 5 ms
5,376 KB |
testcase_30 | AC | 11 ms
6,424 KB |
testcase_31 | AC | 28 ms
10,064 KB |
testcase_32 | AC | 5 ms
5,376 KB |
testcase_33 | AC | 27 ms
10,508 KB |
ソースコード
#line 1 "/home/maspy/compro/library/my_template.hpp" #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; using ll = long long; using pi = pair<ll, ll>; using vi = vector<ll>; using u32 = unsigned int; using u64 = unsigned long long; using i128 = __int128; template <class T> using vc = vector<T>; template <class T> using vvc = vector<vc<T>>; template <class T> using vvvc = vector<vvc<T>>; template <class T> using vvvvc = vector<vvvc<T>>; template <class T> using vvvvvc = vector<vvvvc<T>>; template <class T> using pq = priority_queue<T>; template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>; #define vec(type, name, ...) vector<type> name(__VA_ARGS__) #define vv(type, name, h, ...) \ vector<vector<type>> name(h, vector<type>(__VA_ARGS__)) #define vvv(type, name, h, w, ...) \ vector<vector<vector<type>>> name( \ h, vector<vector<type>>(w, vector<type>(__VA_ARGS__))) #define vvvv(type, name, a, b, c, ...) \ vector<vector<vector<vector<type>>>> name( \ a, vector<vector<vector<type>>>( \ b, vector<vector<type>>(c, vector<type>(__VA_ARGS__)))) // https://trap.jp/post/1224/ #define FOR1(a) for (ll _ = 0; _ < ll(a); ++_) #define FOR2(i, a) for (ll i = 0; i < ll(a); ++i) #define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i) #define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c)) #define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i) #define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i) #define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i) #define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c)) #define overload4(a, b, c, d, e, ...) e #define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__) #define FOR_R(...) \ overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__) #define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s)) #define all(x) x.begin(), x.end() #define len(x) ll(x.size()) #define elif else if #define eb emplace_back #define mp make_pair #define mt make_tuple #define fi first #define se second #define stoi stoll template <typename T, typename U> T SUM(const vector<U> &A) { T sum = 0; for (auto &&a: A) sum += a; return sum; } #define MIN(v) *min_element(all(v)) #define MAX(v) *max_element(all(v)) #define LB(c, x) distance((c).begin(), lower_bound(all(c), (x))) #define UB(c, x) distance((c).begin(), upper_bound(all(c), (x))) #define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end()) int popcnt(int x) { return __builtin_popcount(x); } int popcnt(u32 x) { return __builtin_popcount(x); } int popcnt(ll x) { return __builtin_popcountll(x); } int popcnt(u64 x) { return __builtin_popcountll(x); } // (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2) int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); } int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); } int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); } int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); } // (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2) int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); } int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); } int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); } int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); } template <typename T> T pick(deque<T> &que) { T a = que.front(); que.pop_front(); return a; } template <typename T> T pick(pq<T> &que) { T a = que.top(); que.pop(); return a; } template <typename T> T pick(pqg<T> &que) { assert(que.size()); T a = que.top(); que.pop(); return a; } template <typename T> T pick(vc<T> &que) { assert(que.size()); T a = que.back(); que.pop_back(); return a; } template <typename T, typename U> T ceil(T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); } template <typename T, typename U> T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); } template <typename T, typename U> pair<T, T> divmod(T x, U y) { T q = floor(x, y); return {q, x - q * y}; } template <typename F> ll binary_search(F check, ll ok, ll ng) { assert(check(ok)); while (abs(ok - ng) > 1) { auto x = (ng + ok) / 2; tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x)); } return ok; } template <typename F> double binary_search_real(F check, double ok, double ng, int iter = 100) { FOR(iter) { double x = (ok + ng) / 2; tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x)); } return (ok + ng) / 2; } template <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); } template <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); } vc<int> s_to_vi(const string &S, char first_char) { vc<int> A(S.size()); FOR(i, S.size()) { A[i] = S[i] - first_char; } return A; } template <typename T, typename U> vector<T> cumsum(vector<U> &A, int off = 1) { int N = A.size(); vector<T> B(N + 1); FOR(i, N) { B[i + 1] = B[i] + A[i]; } if (off == 0) B.erase(B.begin()); return B; } template <typename CNT, typename T> vc<CNT> bincount(const vc<T> &A, int size) { vc<CNT> C(size); for (auto &&x: A) { ++C[x]; } return C; } // stable template <typename T> vector<int> argsort(const vector<T> &A) { vector<int> ids(A.size()); iota(all(ids), 0); sort(all(ids), [&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); }); return ids; } // A[I[0]], A[I[1]], ... template <typename T> vc<T> rearrange(const vc<T> &A, const vc<int> &I) { int n = len(I); vc<T> B(n); FOR(i, n) B[i] = A[I[i]]; return B; } #line 1 "/home/maspy/compro/library/other/io.hpp" // based on yosupo's fastio #include <unistd.h> namespace fastio { // クラスが read(), print() を持っているかを判定するメタ関数 struct has_write_impl { template <class T> static auto check(T &&x) -> decltype(x.write(), std::true_type{}); template <class T> static auto check(...) -> std::false_type; }; template <class T> class has_write : public decltype(has_write_impl::check<T>(std::declval<T>())) { }; struct has_read_impl { template <class T> static auto check(T &&x) -> decltype(x.read(), std::true_type{}); template <class T> static auto check(...) -> std::false_type; }; template <class T> class has_read : public decltype(has_read_impl::check<T>(std::declval<T>())) {}; struct Scanner { FILE *fp; char line[(1 << 15) + 1]; size_t st = 0, ed = 0; void reread() { memmove(line, line + st, ed - st); ed -= st; st = 0; ed += fread(line + ed, 1, (1 << 15) - ed, fp); line[ed] = '\0'; } bool succ() { while (true) { if (st == ed) { reread(); if (st == ed) return false; } while (st != ed && isspace(line[st])) st++; if (st != ed) break; } if (ed - st <= 50) { bool sep = false; for (size_t i = st; i < ed; i++) { if (isspace(line[i])) { sep = true; break; } } if (!sep) reread(); } return true; } template <class T, enable_if_t<is_same<T, string>::value, int> = 0> bool read_single(T &ref) { if (!succ()) return false; while (true) { size_t sz = 0; while (st + sz < ed && !isspace(line[st + sz])) sz++; ref.append(line + st, sz); st += sz; if (!sz || st != ed) break; reread(); } return true; } template <class T, enable_if_t<is_integral<T>::value, int> = 0> bool read_single(T &ref) { if (!succ()) return false; bool neg = false; if (line[st] == '-') { neg = true; st++; } ref = T(0); while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); } if (neg) ref = -ref; return true; } template <typename T, typename enable_if<has_read<T>::value>::type * = nullptr> inline bool read_single(T &x) { x.read(); return true; } bool read_single(double &ref) { string s; if (!read_single(s)) return false; ref = std::stod(s); return true; } bool read_single(char &ref) { string s; if (!read_single(s) || s.size() != 1) return false; ref = s[0]; return true; } template <class T> bool read_single(vector<T> &ref) { for (auto &d: ref) { if (!read_single(d)) return false; } return true; } template <class T, class U> bool read_single(pair<T, U> &p) { return (read_single(p.first) && read_single(p.second)); } template <size_t N = 0, typename T> void read_single_tuple(T &t) { if constexpr (N < std::tuple_size<T>::value) { auto &x = std::get<N>(t); read_single(x); read_single_tuple<N + 1>(t); } } template <class... T> bool read_single(tuple<T...> &tpl) { read_single_tuple(tpl); return true; } void read() {} template <class H, class... T> void read(H &h, T &... t) { bool f = read_single(h); assert(f); read(t...); } Scanner(FILE *fp) : fp(fp) {} }; struct Printer { Printer(FILE *_fp) : fp(_fp) {} ~Printer() { flush(); } static constexpr size_t SIZE = 1 << 15; FILE *fp; char line[SIZE], small[50]; size_t pos = 0; void flush() { fwrite(line, 1, pos, fp); pos = 0; } void write(const char &val) { if (pos == SIZE) flush(); line[pos++] = val; } template <class T, enable_if_t<is_integral<T>::value, int> = 0> void write(T val) { if (pos > (1 << 15) - 50) flush(); if (val == 0) { write('0'); return; } if (val < 0) { write('-'); val = -val; // todo min } size_t len = 0; while (val) { small[len++] = char(0x30 | (val % 10)); val /= 10; } for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; } pos += len; } void write(const string &s) { for (char c: s) write(c); } void write(const char *s) { size_t len = strlen(s); for (size_t i = 0; i < len; i++) write(s[i]); } void write(const double &x) { ostringstream oss; oss << fixed << setprecision(15) << x; string s = oss.str(); write(s); } void write(const long double &x) { ostringstream oss; oss << fixed << setprecision(15) << x; string s = oss.str(); write(s); } template <typename T, typename enable_if<has_write<T>::value>::type * = nullptr> inline void write(T x) { x.write(); } template <class T> void write(const vector<T> &val) { auto n = val.size(); for (size_t i = 0; i < n; i++) { if (i) write(' '); write(val[i]); } } template <class T, class U> void write(const pair<T, U> &val) { write(val.first); write(' '); write(val.second); } template <size_t N = 0, typename T> void write_tuple(const T &t) { if constexpr (N < std::tuple_size<T>::value) { if constexpr (N > 0) { write(' '); } const auto &x = std::get<N>(t); write(x); write_tuple<N + 1>(t); } } template <class... T> bool write(tuple<T...> &tpl) { write_tuple(tpl); return true; } template <class T, size_t S> void write(const array<T, S> &val) { auto n = val.size(); for (size_t i = 0; i < n; i++) { if (i) write(' '); write(val[i]); } } void write(i128 val) { string s; bool negative = 0; if (val < 0) { negative = 1; val = -val; } while (val) { s += '0' + int(val % 10); val /= 10; } if (negative) s += "-"; reverse(all(s)); if (len(s) == 0) s = "0"; write(s); } }; Scanner scanner = Scanner(stdin); Printer printer = Printer(stdout); void flush() { printer.flush(); } void print() { printer.write('\n'); } template <class Head, class... Tail> void print(Head &&head, Tail &&... tail) { printer.write(head); if (sizeof...(Tail)) printer.write(' '); print(forward<Tail>(tail)...); } void read() {} template <class Head, class... Tail> void read(Head &head, Tail &... tail) { scanner.read(head); read(tail...); } } // namespace fastio using fastio::print; using fastio::flush; using fastio::read; #define INT(...) \ int __VA_ARGS__; \ read(__VA_ARGS__) #define LL(...) \ ll __VA_ARGS__; \ read(__VA_ARGS__) #define STR(...) \ string __VA_ARGS__; \ read(__VA_ARGS__) #define CHAR(...) \ char __VA_ARGS__; \ read(__VA_ARGS__) #define DBL(...) \ double __VA_ARGS__; \ read(__VA_ARGS__) #define VEC(type, name, size) \ vector<type> name(size); \ read(name) #define VV(type, name, h, w) \ vector<vector<type>> name(h, vector<type>(w)); \ read(name) void YES(bool t = 1) { print(t ? "YES" : "NO"); } void NO(bool t = 1) { YES(!t); } void Yes(bool t = 1) { print(t ? "Yes" : "No"); } void No(bool t = 1) { Yes(!t); } void yes(bool t = 1) { print(t ? "yes" : "no"); } void no(bool t = 1) { yes(!t); } #line 2 "/home/maspy/compro/library/ds/segtree/segtree.hpp" template <class Monoid> struct SegTree { using X = typename Monoid::value_type; using value_type = X; vector<X> dat; int n, log, size; SegTree() : SegTree(0) {} SegTree(int n) : SegTree(vector<X>(n, Monoid::unit())) {} SegTree(vector<X> v) : n(v.size()) { log = 1; while ((1 << log) < n) ++log; size = 1 << log; dat.assign(size << 1, Monoid::unit()); for (int i = 0; i < n; ++i) dat[size + i] = v[i]; for (int i = size - 1; i >= 1; --i) update(i); } template <typename F> SegTree(int n, F f) : n(n) { log = 1; while ((1 << log) < n) ++log; size = 1 << log; dat.assign(size << 1, Monoid::unit()); for (int i = 0; i < n; ++i) dat[size + i] = f(i); for (int i = size - 1; i >= 1; --i) update(i); } void reset() { fill(all(dat), Monoid::unit()); } void set_all(const vector<X>& v) { dat.assign(size << 1, Monoid::unit()); for (int i = 0; i < n; ++i) dat[size + i] = v[i]; for (int i = size - 1; i >= 1; --i) update(i); } X operator[](int i) { return dat[size + i]; } void update(int i) { dat[i] = Monoid::op(dat[2 * i], dat[2 * i + 1]); } void set(int i, const X& x) { assert(i < n); dat[i += size] = x; while (i >>= 1) update(i); } void multiply(int i, const X& x) { assert(i < n); i += size; dat[i] = Monoid::op(dat[i], x); while (i >>= 1) update(i); } X prod(int L, int R) { assert(L <= R); assert(R <= n); X vl = Monoid::unit(), vr = Monoid::unit(); L += size, R += size; while (L < R) { if (L & 1) vl = Monoid::op(vl, dat[L++]); if (R & 1) vr = Monoid::op(dat[--R], vr); L >>= 1, R >>= 1; } return Monoid::op(vl, vr); } X prod_all() { return dat[1]; } template <class F> int max_right(F& check, int L) { assert(0 <= L && L <= n && check(Monoid::unit())); if (L == n) return n; L += size; X sm = Monoid::unit(); do { while (L % 2 == 0) L >>= 1; if (!check(Monoid::op(sm, dat[L]))) { while (L < size) { L = 2 * L; if (check(Monoid::op(sm, dat[L]))) { sm = Monoid::op(sm, dat[L]); L++; } } return L - size; } sm = Monoid::op(sm, dat[L]); L++; } while ((L & -L) != L); return n; } template <class F> int min_left(F& check, int R) { assert(0 <= R && R <= n && check(Monoid::unit())); if (R == 0) return 0; R += size; X sm = Monoid::unit(); do { --R; while (R > 1 && (R % 2)) R >>= 1; if (!check(Monoid::op(dat[R], sm))) { while (R < size) { R = 2 * R + 1; if (check(Monoid::op(dat[R], sm))) { sm = Monoid::op(dat[R], sm); R--; } } return R + 1 - size; } sm = Monoid::op(dat[R], sm); } while ((R & -R) != R); return 0; } // モノイドが可換なら、prod_{l<=i<r}A[i^x] が計算可能 // https://codeforces.com/contest/1401/problem/F X Xor_prod(int l, int r, int xor_val) { assert(Monoid::commute); X x = Monoid::unit(); for (int k = 0; k < log + 1; ++k) { if (l >= r) break; if (l & 1) { x = Monoid::op(x, dat[(size >> k) + ((l++) ^ xor_val)]); } if (r & 1) { x = Monoid::op(x, dat[(size >> k) + ((--r) ^ xor_val)]); } l /= 2, r /= 2, xor_val /= 2; } return x; } void debug() { print("segtree", dat); } }; #line 2 "/home/maspy/compro/library/alg/monoid/min.hpp" template <class X> struct Monoid_Min { using value_type = X; static constexpr X op(const X &x, const X &y) noexcept { return min(x, y); } static constexpr X unit() { return numeric_limits<X>::max(); } static constexpr bool commute = true; }; #line 5 "main.cpp" void solve() { LL(N, K); ll ANS = 0; VEC(ll, A, N); A.eb(0); ++N; using Mono = Monoid_Min<ll>; SegTree<Mono> seg(N); vi dp(N); FOR(i, N) { // i をとらない -> とっていないやつの和の min if (i < K) { dp[i] = A[i]; } else { dp[i] = A[i] + seg.prod(max<int>(0, i - K), i); } seg.set(i, dp[i]); } print(SUM<ll>(A) - dp.back()); } signed main() { int T = 1; // INT(T); FOR(T) solve(); return 0; }