Submission #1693765
Source Code Expand
#include <cstdio>
#include <iostream>
using namespace std;
typedef long long LL;
const int N = 5007;
const int M = 202;
LL G[N][N], D[N];
int b[M][N], pre[N], suf[N], ip[N], is[N];
int n, m;
inline void add(int l, int m, int r, int val) {
G[l][m] += val;
G[l][r + 1] -= val;
G[m + 1][m] -= val;
G[m + 1][r + 1] += val;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 2; i <= n; i ++) {
scanf("%lld", &D[i]);
D[i] += D[i - 1];
}
for (int i = 1; i <= n; i ++)
for (int j = 1; j <= m; j ++) scanf("%d", &b[j][i]);
for (int j = 1; j <= m; j ++) {
for (int i = 1; i <= n; i ++) {
if (b[j][i] > pre[i - 1]) {pre[i] = b[j][i]; ip[i] = i;}
else {pre[i] = pre[i - 1]; ip[i] = ip[i - 1];}
}
for (int i = n; i >= 1; i --) {
if (b[j][i] >= suf[i + 1]) {suf[i] = b[j][i]; is[i] = i;}
else {suf[i] = suf[i + 1]; is[i] = is[i + 1];}
}
for (int i = 1, l, r; i <= n; i ++) {
if (ip[i] != i) l = ip[i] + 1;
else l = 1;
if (is[i] != i) r = is[i] - 1;
else r = n;
add(l, i, r, b[j][i]);
}
}
LL ans = 0;
for (int i = 1; i <= n; i ++)
for (int j = 1; j <= n; j ++) {
G[i][j] += G[i - 1][j] + G[i][j - 1] - G[i - 1][j - 1];
if (i <= j) ans = max(ans, D[i] - D[j] + G[i][j]);
}
printf("%lld\n", ans);
return 0;
}
Submission Info
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:21:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &n, &m);
^
./Main.cpp:23:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld", &D[i]);
^
./Main.cpp:27:56: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
for (int j = 1; j <= m; j ++) scanf("%d", &b[j][i]);
^
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 1000 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt |
All |
sample_01.txt, sample_02.txt, subtask_1_dense_max_01.txt, subtask_1_dense_max_02.txt, subtask_1_dense_max_03.txt, subtask_1_dense_max_04.txt, subtask_1_dense_rand_01.txt, subtask_1_dense_rand_02.txt, subtask_1_dense_rand_03.txt, subtask_1_dense_rand_04.txt, subtask_1_max_01.txt, subtask_1_max_02.txt, subtask_1_max_03.txt, subtask_1_max_04.txt, subtask_1_min_01.txt, subtask_1_min_02.txt, subtask_1_rand_01.txt, subtask_1_rand_02.txt, subtask_1_rand_03.txt, subtask_1_rand_04.txt, subtask_1_widemax_01.txt, subtask_1_widemax_02.txt, subtask_1_widemax_03.txt, subtask_1_widemax_04.txt, subtask_1_widemax_05.txt, subtask_1_widemax_06.txt, subtask_1_widemax_07.txt, subtask_1_widemax_08.txt, subtask_1_widemax_09.txt, subtask_1_widemax_10.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
2 ms |
4352 KB |
sample_02.txt |
AC |
2 ms |
4352 KB |
subtask_1_dense_max_01.txt |
WA |
250 ms |
199936 KB |
subtask_1_dense_max_02.txt |
WA |
247 ms |
199936 KB |
subtask_1_dense_max_03.txt |
WA |
247 ms |
199936 KB |
subtask_1_dense_max_04.txt |
WA |
247 ms |
199936 KB |
subtask_1_dense_rand_01.txt |
WA |
148 ms |
141312 KB |
subtask_1_dense_rand_02.txt |
WA |
163 ms |
149632 KB |
subtask_1_dense_rand_03.txt |
WA |
12 ms |
33280 KB |
subtask_1_dense_rand_04.txt |
WA |
47 ms |
81024 KB |
subtask_1_max_01.txt |
WA |
248 ms |
199936 KB |
subtask_1_max_02.txt |
WA |
247 ms |
199936 KB |
subtask_1_max_03.txt |
WA |
247 ms |
199936 KB |
subtask_1_max_04.txt |
WA |
247 ms |
199936 KB |
subtask_1_min_01.txt |
AC |
2 ms |
4352 KB |
subtask_1_min_02.txt |
AC |
2 ms |
4352 KB |
subtask_1_rand_01.txt |
WA |
33 ms |
41984 KB |
subtask_1_rand_02.txt |
WA |
36 ms |
76544 KB |
subtask_1_rand_03.txt |
WA |
41 ms |
60672 KB |
subtask_1_rand_04.txt |
WA |
124 ms |
187392 KB |
subtask_1_widemax_01.txt |
WA |
248 ms |
199936 KB |
subtask_1_widemax_02.txt |
WA |
247 ms |
199936 KB |
subtask_1_widemax_03.txt |
WA |
247 ms |
199936 KB |
subtask_1_widemax_04.txt |
WA |
247 ms |
199936 KB |
subtask_1_widemax_05.txt |
WA |
247 ms |
199936 KB |
subtask_1_widemax_06.txt |
WA |
247 ms |
199936 KB |
subtask_1_widemax_07.txt |
WA |
247 ms |
199936 KB |
subtask_1_widemax_08.txt |
WA |
249 ms |
199936 KB |
subtask_1_widemax_09.txt |
WA |
250 ms |
199936 KB |
subtask_1_widemax_10.txt |
WA |
249 ms |
199936 KB |