Submission #2423421
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define INF_LL (int64)1e18 #define INF (int32)1e9 #define REP(i, n) for(int i = 0;i < (n);i++) #define FOR(i, a, b) for(int i = (a);i < (b);i++) #define all(x) x.begin(),x.end() #define fs first #define sc second using int32 = int_fast32_t; using uint32 = uint_fast32_t; using int64 = int_fast64_t; using uint64 = uint_fast64_t; using PII = pair<int32, int32>; using PLL = pair<int64, int64>; const double eps = 1e-6; template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;} template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;} const int64 mod = 1e9+7; /* int main(void){ int32 N; cin >> N; vector<int64> v(N); REP(i, N) cin >> v[i]; int64 maxi = 0; int64 res = 0; REP(i, N){ int64 cnt = (v[i]-1)/(maxi+1); if(cnt){ res += cnt; chmax(maxi, 1); } else maxi = v[i]; } cout << res << endl; } */ int main(void){ int32 M, N, K; cin >> N >> M >> K; vector<int64> A(N); deque<PLL> deq[301]; REP(i, N) cin >> A[i]; REP(i, N){ for(int32 j = K-1;j >= 1;j--){ while(i-deq[j-1].front().sc > M) deq[j-1].pop_front(); int64 val = deq[j-1].front().fs+A[i]*(j+1); while(deq[j].size() && val > deq[j].back().fs) deq[j].pop_back(); deq[j].push_back(PLL(val, i)); } while(deq[0].size() && A[i] > deq[0].back().fs) deq[0].pop_back(); deq[0].push_back(PLL(A[i], i)); } cout << deq[K-1].front().fs << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Struck Out |
User | maze1230 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1497 Byte |
Status | WA |
Exec Time | 393 ms |
Memory | 1280 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 | 384 KB |
sample_2.txt | AC | 1 ms | 384 KB |
sample_3.txt | AC | 1 ms | 384 KB |
subtask_1_1.txt | AC | 1 ms | 384 KB |
subtask_1_2.txt | AC | 32 ms | 512 KB |
subtask_1_3.txt | AC | 311 ms | 1280 KB |
subtask_1_4.txt | AC | 5 ms | 512 KB |
subtask_1_5.txt | AC | 45 ms | 1280 KB |
subtask_1_6.txt | WA | 2 ms | 384 KB |
subtask_1_7.txt | AC | 125 ms | 1280 KB |
subtask_1_8.txt | AC | 311 ms | 1280 KB |
subtask_1_9.txt | WA | 3 ms | 384 KB |
subtask_2_1.txt | AC | 1 ms | 384 KB |
subtask_2_2.txt | AC | 1 ms | 512 KB |
subtask_2_3.txt | AC | 1 ms | 512 KB |
subtask_2_4.txt | AC | 1 ms | 384 KB |
subtask_2_5.txt | WA | 1 ms | 384 KB |
subtask_2_6.txt | WA | 1 ms | 384 KB |
subtask_2_7.txt | AC | 1 ms | 384 KB |
subtask_2_8.txt | AC | 1 ms | 512 KB |
subtask_2_9.txt | AC | 1 ms | 512 KB |
subtask_3_1.txt | AC | 67 ms | 1280 KB |
subtask_3_2.txt | AC | 68 ms | 1280 KB |
subtask_3_3.txt | AC | 66 ms | 1280 KB |
subtask_3_4.txt | AC | 55 ms | 1152 KB |
subtask_3_5.txt | AC | 5 ms | 512 KB |
subtask_3_6.txt | AC | 64 ms | 1280 KB |
subtask_3_7.txt | AC | 67 ms | 1280 KB |
subtask_3_8.txt | AC | 8 ms | 512 KB |
subtask_3_9.txt | AC | 74 ms | 1280 KB |
subtask_4_1.txt | AC | 311 ms | 1280 KB |
subtask_4_10.txt | AC | 349 ms | 1280 KB |
subtask_4_11.txt | AC | 389 ms | 1280 KB |
subtask_4_12.txt | AC | 392 ms | 1280 KB |
subtask_4_13.txt | AC | 393 ms | 1280 KB |
subtask_4_2.txt | AC | 379 ms | 1280 KB |
subtask_4_3.txt | AC | 311 ms | 1280 KB |
subtask_4_4.txt | AC | 311 ms | 1280 KB |
subtask_4_5.txt | AC | 275 ms | 1280 KB |
subtask_4_6.txt | AC | 61 ms | 1280 KB |
subtask_4_7.txt | AC | 216 ms | 1280 KB |
subtask_4_8.txt | AC | 307 ms | 1280 KB |
subtask_4_9.txt | AC | 172 ms | 1280 KB |