Submission #2365976
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------------
// Description: スライド最小値.minを取る区間が広義単調増加のとき使える.全体O(N).
// ## Compare: min -> std::less<T>, max -> std::greater<T>
template<class T, class Compare>
struct SlideMinimum {
std::deque<size_t> deq;
std::vector<T> a;
Compare cmp;
signed L, R;
SlideMinimum(const std::vector<T>& a) : a(a), cmp(Compare()), L(0), R(0) {}
// ++L
inline void incL() {
if (deq.front() == L++) deq.pop_front();
}
// slide [L, R) to [l, R)
inline void slideL(signed l) {
while (L < l) incL();
}
// ++R
inline void incR() {
while (!deq.empty() && !cmp(a[deq.back()], a[R])) deq.pop_back();
deq.push_back(R++);
}
// slide [L, R) to [L, r)
inline void slideR(signed r) {
while (R < r) incR();
}
// slide [L, R) to [l, r)
inline void slide(signed l, signed r) {
if (R <= l) {
deq.clear();
L = R = l;
}
slideR(r);
slideL(l);
}
// reset deque ( slide [L, R) to [0, 0) )
inline void clear() {
deq.clear();
L = R = 0;
}
inline size_t getIndex() const {
return deq.front();
}
};
// dp[i][j] = i回投げて最後にj番目に当たったときの最大値
signed main() {
INIT;
VAR(int, n, m, k);
VEC(int, a, n);
std::vector<std::vector<int>> dp(k + 1, std::vector<int>(n + 1, 0));
REP(i, n) dp[1][i + 1] = a[i];
FOR(i, 1, k) {
SlideMinimum<int, std::greater<>> sm(dp[i]);
sm.slide(std::max(0LL, i - m + 1), i);
FOR(j, i, n) {
sm.slide(std::max(0LL, j - m + 1), j + 1);
int t = dp[i][sm.getIndex()];
dp[i + 1][j + 1] = t + (i + 1)*a[j];
}
}
int ans = 0;
REP(i, n + 1) CHMAX(ans, dp[k][i]);
OUT(ans)BR;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Struck Out |
User |
satanic0258 |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
6895 Byte |
Status |
AC |
Exec Time |
640 ms |
Memory |
237824 KB |
Judge Result
Set Name |
Sample |
subtask1 |
subtask2 |
subtask3 |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
200 / 200 |
300 / 300 |
100 / 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 |
256 KB |
subtask_1_2.txt |
AC |
55 ms |
24064 KB |
subtask_1_3.txt |
AC |
562 ms |
237824 KB |
subtask_1_4.txt |
AC |
5 ms |
1664 KB |
subtask_1_5.txt |
AC |
20 ms |
6528 KB |
subtask_1_6.txt |
AC |
2 ms |
640 KB |
subtask_1_7.txt |
AC |
195 ms |
81024 KB |
subtask_1_8.txt |
AC |
562 ms |
237824 KB |
subtask_1_9.txt |
AC |
3 ms |
1408 KB |
subtask_2_1.txt |
AC |
1 ms |
384 KB |
subtask_2_2.txt |
AC |
1 ms |
256 KB |
subtask_2_3.txt |
AC |
1 ms |
384 KB |
subtask_2_4.txt |
AC |
1 ms |
256 KB |
subtask_2_5.txt |
AC |
1 ms |
256 KB |
subtask_2_6.txt |
AC |
1 ms |
256 KB |
subtask_2_7.txt |
AC |
1 ms |
384 KB |
subtask_2_8.txt |
AC |
1 ms |
384 KB |
subtask_2_9.txt |
AC |
1 ms |
384 KB |
subtask_3_1.txt |
AC |
68 ms |
26112 KB |
subtask_3_2.txt |
AC |
69 ms |
26112 KB |
subtask_3_3.txt |
AC |
67 ms |
25344 KB |
subtask_3_4.txt |
AC |
56 ms |
21004 KB |
subtask_3_5.txt |
AC |
4 ms |
1536 KB |
subtask_3_6.txt |
AC |
41 ms |
14336 KB |
subtask_3_7.txt |
AC |
66 ms |
26112 KB |
subtask_3_8.txt |
AC |
8 ms |
2944 KB |
subtask_3_9.txt |
AC |
73 ms |
26112 KB |
subtask_4_1.txt |
AC |
591 ms |
237824 KB |
subtask_4_10.txt |
AC |
395 ms |
237824 KB |
subtask_4_11.txt |
AC |
640 ms |
237824 KB |
subtask_4_12.txt |
AC |
640 ms |
237824 KB |
subtask_4_13.txt |
AC |
635 ms |
237824 KB |
subtask_4_2.txt |
AC |
627 ms |
237824 KB |
subtask_4_3.txt |
AC |
568 ms |
237824 KB |
subtask_4_4.txt |
AC |
594 ms |
237824 KB |
subtask_4_5.txt |
AC |
506 ms |
201728 KB |
subtask_4_6.txt |
AC |
53 ms |
20608 KB |
subtask_4_7.txt |
AC |
335 ms |
126464 KB |
subtask_4_8.txt |
AC |
582 ms |
234240 KB |
subtask_4_9.txt |
AC |
271 ms |
106112 KB |