Submission #2024579
Source Code Expand
#include <iostream> #include <fstream> #include <cstdio> #include <cmath> #include <vector> #include <cstring> #include <string> #include <set> #include <map> #include <stack> #include <queue> #include <deque> #include <bitset> #include <algorithm> using namespace std; #define REP(i,n) for(int i=0; i<n; ++i) #define FOR(i,a,b) for(int i=a; i<=b; ++i) #define FORR(i,a,b) for (int i=a; i>=b; --i) #define ALL(c) (c).begin(), (c).end() typedef long long ll; typedef vector<int> VI; typedef vector<ll> VL; typedef vector<VL> VVL; typedef vector<VI> VVI; typedef pair<int,int> P; typedef pair<ll,ll> PL; VL slide_max(VL a, int k){ VL ret; deque<int> dq; REP(i,a.size()){ while (!dq.empty() && a[dq.back()] <= a[i]) dq.pop_back(); dq.push_back(i); ret.push_back(a[dq.front()]); if (i - k + 1 >= 0){ if (dq.front() == i - k + 1) dq.pop_front(); } } return ret; } int main() { int n, m, k; cin >> n >> m >> k; VL a(n); REP(i,n) scanf("%lld", &a[i]); VL dp(n); REP(i,n) dp[i] = a[i]; REP(x,k-1){ VL ma = slide_max(dp, m); REP(i,n-1) dp[i+1] = ma[i] + a[i+1] * (x + 2); // REP(i,n) cout << dp[i] << " "; // cout << endl; } ll ma = 0; REP(i,n) ma = max(ma, dp[i]); cout << ma << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Struck Out |
User | TangentDay |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1424 Byte |
Status | WA |
Exec Time | 684 ms |
Memory | 4436 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:48:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] REP(i,n) scanf("%lld", &a[i]); ^
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 | 256 KB |
subtask_1_2.txt | AC | 57 ms | 748 KB |
subtask_1_3.txt | AC | 638 ms | 4436 KB |
subtask_1_4.txt | AC | 4 ms | 524 KB |
subtask_1_5.txt | AC | 22 ms | 4436 KB |
subtask_1_6.txt | WA | 2 ms | 256 KB |
subtask_1_7.txt | AC | 221 ms | 4436 KB |
subtask_1_8.txt | AC | 639 ms | 4436 KB |
subtask_1_9.txt | WA | 2 ms | 256 KB |
subtask_2_1.txt | AC | 1 ms | 256 KB |
subtask_2_2.txt | AC | 1 ms | 256 KB |
subtask_2_3.txt | AC | 1 ms | 256 KB |
subtask_2_4.txt | AC | 1 ms | 256 KB |
subtask_2_5.txt | WA | 1 ms | 256 KB |
subtask_2_6.txt | WA | 1 ms | 256 KB |
subtask_2_7.txt | AC | 1 ms | 256 KB |
subtask_2_8.txt | AC | 1 ms | 256 KB |
subtask_2_9.txt | AC | 1 ms | 256 KB |
subtask_3_1.txt | AC | 75 ms | 4436 KB |
subtask_3_2.txt | AC | 75 ms | 4436 KB |
subtask_3_3.txt | AC | 74 ms | 4436 KB |
subtask_3_4.txt | AC | 62 ms | 3836 KB |
subtask_3_5.txt | AC | 4 ms | 524 KB |
subtask_3_6.txt | AC | 45 ms | 4436 KB |
subtask_3_7.txt | AC | 75 ms | 4436 KB |
subtask_3_8.txt | AC | 8 ms | 744 KB |
subtask_3_9.txt | AC | 78 ms | 4436 KB |
subtask_4_1.txt | AC | 649 ms | 4436 KB |
subtask_4_10.txt | AC | 397 ms | 4436 KB |
subtask_4_11.txt | AC | 684 ms | 4436 KB |
subtask_4_12.txt | AC | 679 ms | 4436 KB |
subtask_4_13.txt | AC | 673 ms | 4436 KB |
subtask_4_2.txt | AC | 665 ms | 4436 KB |
subtask_4_3.txt | AC | 641 ms | 4436 KB |
subtask_4_4.txt | AC | 649 ms | 4436 KB |
subtask_4_5.txt | AC | 551 ms | 4436 KB |
subtask_4_6.txt | AC | 60 ms | 4436 KB |
subtask_4_7.txt | AC | 355 ms | 4436 KB |
subtask_4_8.txt | AC | 642 ms | 4416 KB |
subtask_4_9.txt | AC | 294 ms | 4436 KB |