Submission #2297070
Source Code Expand
// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
//#include <deque>
#include <valarray>
// stream
//#include <istream>
//#include <sstream>
//#include <ostream>
#include <fstream>
// etc
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;
// output
#define OUT(d) std::cout<<(d);
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<(d);
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<(d);
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(i, n) std::cout<<(i + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define SHOW(d) {std::cerr << #d << "\t:" << (d) << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
// utility
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns (" << res / (1.0e9) << "s)]\n"; }
// test
template<class T> std::vector<std::vector<T>> VV(int n, int m, T init = T()) {
return std::vector<std::vector<T>>(n, std::vector<T>(m, init));
}
template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
os << "(" << p.first << ", " << p.second << ")"; return os;
}
// type/const
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = 1 << 30; // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60; // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18
constexpr double EPS = 1e-9;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
template<class T, size_t N> void FILL(T(&a)[N], const T& val) { for (auto& x : a) x = val; }
template<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T& val) { for (auto& b : a) FILL(b, val); }
template<class T> void FILL(std::vector<T>& a, const T& val) { for (auto& x : a) x = val; }
template<class ARY, class T> void FILL(std::vector<std::vector<ARY>>& a, const T& val) { for (auto& b : a) FILL(b, val); }
// ------------>8------------------------------------->8------------
// ------------>8------------ SegmentTree ------------>8------------
// -- Query Type enum.
enum QUERY { SUM, MAX, MIN };
template <class T = int>
class SegmentTree {
private:
int ARY_SIZE;
T init_val;
std::vector<T> ary;
std::function<T(T, T)> func;
public:
SegmentTree(int n, QUERY qtype) : ARY_SIZE(1) { init(n, qtype); }
SegmentTree(int n, T init_val, QUERY qtype) : ARY_SIZE(1) { init(n, init_val, qtype); }
void init(int n, QUERY qtype) {
T init_val;
switch (qtype) {
case SUM: init_val = 0; break;
case MAX: init_val = std::numeric_limits<T>::lowest(); break;
case MIN: init_val = std::numeric_limits<T>::max(); break;
default: struct INVALID_QUERY_TYPE_ERROR {}; throw INVALID_QUERY_TYPE_ERROR(); break;
}
init(n, init_val, qtype);
}
void init(int n, T init_val, QUERY qtype) {
std::function<T(T, T)> f;
switch (qtype) {
case SUM: f = [](T l, T r) {return l + r; }; break;
case MAX: f = [](T l, T r) {return std::max(l, r); }; break;
case MIN: f = [](T l, T r) {return std::min(l, r); }; break;
default: struct INVALID_QUERY_TYPE_ERROR {}; throw INVALID_QUERY_TYPE_ERROR(); break;
}
init(n, init_val, f);
}
void init(int n, T init_val, std::function<T(T, T)> f) {
while (ARY_SIZE < n) ARY_SIZE <<= 1;
ARY_SIZE = ARY_SIZE * 2 - 1;
ary.resize(ARY_SIZE, init_val);
this->init_val = init_val;
func = f;
}
// -- a[i] = val;
void update(int i, T val) {
i += ARY_SIZE / 2;
ary[i] = val;
while (i > 0) {
i = (i - 1) / 2;
ary[i] = func(ary[2 * i + 1], ary[2 * i + 2]);
}
}
// -- a[i] += val;
void add(int i, T val) {
i += ARY_SIZE / 2;
ary[i] += val;
while (i > 0) {
i = (i - 1) / 2;
ary[i] = func(ary[2 * i + 1], ary[2 * i + 2]);
}
}
// -- 区間[a, b)のfuncの返す値を返す (query_(a, b, 0, 0, n)と呼び出す)
T query_(int a, int b, int i, int l, int r) {
if (r <= a || b <= l) return init_val;
if (a <= l && r <= b) return ary[i];
else {
T vl = query_(a, b, 2 * i + 1, l, (l + r) / 2);
T vr = query_(a, b, 2 * i + 2, (l + r) / 2, r);
return func(vl, vr);
}
}
// -- [a, b)
T query(int a, int b) { return query_(a, b, 0, 0, ARY_SIZE / 2 + 1); }
T operator[](int i) { return ary[i + ARY_SIZE / 2]; }
void debug_show() {
for (int i = ARY_SIZE / 2; i < ARY_SIZE; ++i) std::cerr << ary[i] << " ";
std::cerr << "\n";
}
};
using ST = SegmentTree<int>;
// ------------8<------------ SegmentTree ------------8<------------
// dp[i][j] = i回投げて最後にj番目に当たったときの最大値
signed main() {
INIT;
VAR(int, n, m, k);
VEC(int, a, n);
std::vector<ST> dp(k + 1, ST(n + 1, MAX));
dp[0].update(0, 0);
REP(i, k) FOR(j, i, n) {
int t = dp[i].query(std::max(0LL, j - m), j + 1);
dp[i + 1].update(j + 1, t + (i + 1)*a[j]);
}
OUT(dp[k].query(0, n + 1))BR;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Struck Out |
User |
satanic0258 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
8126 Byte |
Status |
WA |
Exec Time |
2144 ms |
Memory |
620928 KB |
Judge Result
Set Name |
Sample |
subtask1 |
subtask2 |
subtask3 |
All |
Score / Max Score |
0 / 0 |
0 / 100 |
0 / 200 |
0 / 300 |
0 / 100 |
Status |
|
|
|
|
|
Set Name |
Test Cases |
Sample |
sample_1.txt, sample_2.txt, sample_3.txt |
subtask1 |
sample_2.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
subtask2 |
sample_1.txt, sample_2.txt, sample_3.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt |
subtask3 |
sample_1.txt, sample_2.txt, sample_3.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt |
All |
sample_1.txt, sample_2.txt, sample_3.txt, sample_1.txt, sample_2.txt, sample_3.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt, subtask_4_1.txt, subtask_4_10.txt, subtask_4_11.txt, subtask_4_12.txt, subtask_4_13.txt, subtask_4_2.txt, subtask_4_3.txt, subtask_4_4.txt, subtask_4_5.txt, subtask_4_6.txt, subtask_4_7.txt, subtask_4_8.txt, subtask_4_9.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_1.txt |
AC |
1 ms |
256 KB |
sample_2.txt |
AC |
1 ms |
256 KB |
sample_3.txt |
AC |
1 ms |
256 KB |
subtask_1_1.txt |
AC |
1 ms |
384 KB |
subtask_1_2.txt |
AC |
506 ms |
78848 KB |
subtask_1_3.txt |
TLE |
2143 ms |
620800 KB |
subtask_1_4.txt |
AC |
28 ms |
4736 KB |
subtask_1_5.txt |
AC |
114 ms |
15360 KB |
subtask_1_6.txt |
AC |
3 ms |
1024 KB |
subtask_1_7.txt |
TLE |
2022 ms |
210304 KB |
subtask_1_8.txt |
TLE |
2143 ms |
620800 KB |
subtask_1_9.txt |
AC |
12 ms |
2688 KB |
subtask_2_1.txt |
AC |
2 ms |
512 KB |
subtask_2_2.txt |
WA |
2 ms |
384 KB |
subtask_2_3.txt |
AC |
2 ms |
384 KB |
subtask_2_4.txt |
AC |
2 ms |
384 KB |
subtask_2_5.txt |
AC |
1 ms |
256 KB |
subtask_2_6.txt |
AC |
1 ms |
256 KB |
subtask_2_7.txt |
AC |
2 ms |
512 KB |
subtask_2_8.txt |
AC |
2 ms |
512 KB |
subtask_2_9.txt |
AC |
2 ms |
512 KB |
subtask_3_1.txt |
AC |
736 ms |
66688 KB |
subtask_3_2.txt |
AC |
863 ms |
66688 KB |
subtask_3_3.txt |
AC |
841 ms |
64640 KB |
subtask_3_4.txt |
WA |
696 ms |
66560 KB |
subtask_3_5.txt |
AC |
26 ms |
4480 KB |
subtask_3_6.txt |
WA |
402 ms |
35968 KB |
subtask_3_7.txt |
AC |
650 ms |
66688 KB |
subtask_3_8.txt |
AC |
72 ms |
8704 KB |
subtask_3_9.txt |
WA |
783 ms |
66688 KB |
subtask_4_1.txt |
TLE |
2143 ms |
620800 KB |
subtask_4_10.txt |
TLE |
2143 ms |
620800 KB |
subtask_4_11.txt |
TLE |
2143 ms |
620800 KB |
subtask_4_12.txt |
TLE |
2144 ms |
620800 KB |
subtask_4_13.txt |
TLE |
2144 ms |
620800 KB |
subtask_4_2.txt |
TLE |
2142 ms |
620800 KB |
subtask_4_3.txt |
TLE |
2144 ms |
620800 KB |
subtask_4_4.txt |
TLE |
2143 ms |
620928 KB |
subtask_4_5.txt |
TLE |
2138 ms |
526336 KB |
subtask_4_6.txt |
AC |
479 ms |
52352 KB |
subtask_4_7.txt |
TLE |
2126 ms |
329344 KB |
subtask_4_8.txt |
TLE |
2143 ms |
620800 KB |
subtask_4_9.txt |
TLE |
2121 ms |
275968 KB |