Submission #1012414
Source Code Expand
#include <cstdio> #include <cstring> #include <algorithm> #include <queue> using namespace std; typedef long long ll; int n, m, k; ll a[111111]; ll dp[333][33]; ll dp2[2][333]; // dp[111111][333]; ll dp3[111111][333]; priority_queue<ll> q[333], dq[333]; int main(void) { scanf("%d%d%d", &n, &m, &k); for (int i = 0; i < n; i++) { scanf("%lld", a+i); } if (n == m && false) { ll res = 0; memset(dp2, -1, sizeof(dp2)); dp2[1][0] = 0; for (int i = 0; i < n; i++) { dp2[i%2][0] = 0; for (int j = 1; j <= k; j++) { if (dp2[i%2][j-1] >= 0) { dp2[(i+1)%2][j] = max({ dp2[(i+1)%2][j], dp2[i%2][j-1] + a[i]*j, dp2[i%2][j] }); } } for (int j = 0; j <= k; j++) { res = max(res, dp2[(i+1)%2][j]); if (dp2[i%2][j] >= 0) { dp2[i%2][j] = 0; } // printf("%5lld", dp2[(i+1)%2][j]); } // puts(""); } printf("%lld\n", res); } else if (n <= 300 && k <= 30 && false) { memset(dp, -1, sizeof(dp)); for (int i = 0; i <= n; i++) { dp[i][0] = 0; } for (int i = 1; i <= n; i++) { for (int j = 0; j < k; j++) { for (int l = 1; l <= m && i-l >= 0; l++) { if (dp[i-l][j] >= 0) { dp[i][j+1] = max(dp[i][j+1], dp[i-l][j]+a[i-1]*(j+1)); } } } } ll res = 0; for (int i = 0; i <= n+1; i++) { for (int j = 0; j <= k; j++) { // printf("%5lld", dp[i][j]); res = max(res, dp[i][j]); } // puts(""); } printf("%lld\n", res); } else if (k <= 30 || true) { q[0].push(0); memset(dp3, -1, sizeof(dp3)); for (int i = 1; i <= n; i++) { for (int j = k-1; j >= 0; j--) { if (q[j].size() == 0) continue; while (!dq[j].empty() && q[j].top() == dq[j].top()) { q[j].pop(); dq[j].pop(); } dp3[i][j+1] = q[j].top()+a[i-1]*(j+1); q[j+1].push(q[j].top()+a[i-1]*(j+1)); } if (i-m >= 0) { for (int j = 0; j < k; j++) { if (dp3[i-m][j] >= 0) { dq[j].push(dp3[i-m][j]); } } } } printf("%lld\n", q[k].top()); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Struck Out |
User | roxion1377 |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 2403 Byte |
Status | TLE |
Exec Time | 2132 ms |
Memory | 481668 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:20:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d%d", &n, &m, &k); ^ ./Main.cpp:22:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld", a+i); ^
Judge Result
Set Name | Sample | subtask1 | subtask2 | subtask3 | All | ||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | 200 / 200 | 300 / 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, 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 | 276 ms | 289280 KB |
sample_2.txt | AC | 278 ms | 289280 KB |
sample_3.txt | AC | 279 ms | 289280 KB |
subtask_1_1.txt | AC | 278 ms | 289408 KB |
subtask_1_2.txt | AC | 448 ms | 320896 KB |
subtask_1_3.txt | TLE | 2130 ms | 467092 KB |
subtask_1_4.txt | AC | 284 ms | 291200 KB |
subtask_1_5.txt | AC | 315 ms | 294284 KB |
subtask_1_6.txt | AC | 280 ms | 289536 KB |
subtask_1_7.txt | AC | 806 ms | 371164 KB |
subtask_1_8.txt | TLE | 2130 ms | 467604 KB |
subtask_1_9.txt | AC | 283 ms | 290432 KB |
subtask_2_1.txt | AC | 278 ms | 289536 KB |
subtask_2_2.txt | AC | 278 ms | 289408 KB |
subtask_2_3.txt | AC | 280 ms | 289408 KB |
subtask_2_4.txt | AC | 278 ms | 289408 KB |
subtask_2_5.txt | AC | 276 ms | 289280 KB |
subtask_2_6.txt | AC | 277 ms | 289280 KB |
subtask_2_7.txt | AC | 277 ms | 289536 KB |
subtask_2_8.txt | AC | 277 ms | 289536 KB |
subtask_2_9.txt | AC | 274 ms | 289408 KB |
subtask_3_1.txt | AC | 458 ms | 326232 KB |
subtask_3_2.txt | AC | 533 ms | 335820 KB |
subtask_3_3.txt | AC | 520 ms | 333976 KB |
subtask_3_4.txt | AC | 493 ms | 326732 KB |
subtask_3_5.txt | AC | 284 ms | 291072 KB |
subtask_3_6.txt | AC | 436 ms | 312268 KB |
subtask_3_7.txt | AC | 427 ms | 317036 KB |
subtask_3_8.txt | AC | 297 ms | 294784 KB |
subtask_3_9.txt | AC | 628 ms | 331892 KB |
subtask_4_1.txt | TLE | 2130 ms | 479344 KB |
subtask_4_10.txt | TLE | 2118 ms | 291704 KB |
subtask_4_11.txt | TLE | 2119 ms | 310908 KB |
subtask_4_12.txt | TLE | 2120 ms | 332636 KB |
subtask_4_13.txt | TLE | 2126 ms | 409584 KB |
subtask_4_2.txt | TLE | 2128 ms | 438560 KB |
subtask_4_3.txt | TLE | 2130 ms | 465940 KB |
subtask_4_4.txt | TLE | 2130 ms | 476016 KB |
subtask_4_5.txt | TLE | 2130 ms | 466256 KB |
subtask_4_6.txt | AC | 385 ms | 308328 KB |
subtask_4_7.txt | TLE | 2130 ms | 458032 KB |
subtask_4_8.txt | TLE | 2131 ms | 479216 KB |
subtask_4_9.txt | TLE | 2132 ms | 481668 KB |