| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 9211 |
2014-09-28T04:44:33 Z |
kcm1700 |
On grid (kriii2_O) |
C++14 |
|
48 ms |
1804 KB |
#include <algorithm>
#include <climits>
#include <cstdio>
using namespace std;
int n,m;
int dat[303][303];
int dt[303][303];
int cursum[303];
int main(){
scanf("%d%d",&n,&m);
for(int i = 0; i < n; i++) {
for(int j = 0; j < m; j++) {
scanf("%d",&dat[i][j]);
}
}
for(int i = 1; i <= n; i++) {
for(int j = 0; j < m; j++) {
dt[i][j] = INT_MIN/2;
}
}
for(int i = 0; i < n; i++) {
for(int k = 0; k < m; k++) cursum[k] = 0;
for(int j = i; j < n; j++) {
for(int k = 0; k < m; k++) {
cursum[k] += dat[j][k];
}
int best = INT_MIN/2-10002;
if (i == 0) best = 0;
for(int k = 0; k < m; k++) {
if (k > 0 && i > 0) best = max(best, dt[i][k-1]);
best += cursum[k];
dt[j+1][k] = max(dt[j+1][k], best);
}
}
}
printf("%d\n", dt[n][m-1]);
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 21 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 22 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 23 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 24 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 25 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 26 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 27 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 28 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 29 |
Correct |
0 ms |
1804 KB |
Output is correct |
| 30 |
Correct |
0 ms |
1804 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
1804 KB |
Output is correct |
| 2 |
Correct |
4 ms |
1804 KB |
Output is correct |
| 3 |
Correct |
20 ms |
1804 KB |
Output is correct |
| 4 |
Correct |
12 ms |
1804 KB |
Output is correct |
| 5 |
Correct |
4 ms |
1804 KB |
Output is correct |
| 6 |
Correct |
20 ms |
1804 KB |
Output is correct |
| 7 |
Correct |
12 ms |
1804 KB |
Output is correct |
| 8 |
Correct |
28 ms |
1804 KB |
Output is correct |
| 9 |
Correct |
44 ms |
1804 KB |
Output is correct |
| 10 |
Correct |
44 ms |
1804 KB |
Output is correct |
| 11 |
Correct |
8 ms |
1804 KB |
Output is correct |
| 12 |
Correct |
16 ms |
1804 KB |
Output is correct |
| 13 |
Correct |
8 ms |
1804 KB |
Output is correct |
| 14 |
Correct |
40 ms |
1804 KB |
Output is correct |
| 15 |
Correct |
16 ms |
1804 KB |
Output is correct |
| 16 |
Correct |
8 ms |
1804 KB |
Output is correct |
| 17 |
Correct |
24 ms |
1804 KB |
Output is correct |
| 18 |
Correct |
16 ms |
1804 KB |
Output is correct |
| 19 |
Correct |
16 ms |
1804 KB |
Output is correct |
| 20 |
Correct |
8 ms |
1804 KB |
Output is correct |
| 21 |
Correct |
8 ms |
1804 KB |
Output is correct |
| 22 |
Correct |
8 ms |
1804 KB |
Output is correct |
| 23 |
Correct |
8 ms |
1804 KB |
Output is correct |
| 24 |
Correct |
40 ms |
1804 KB |
Output is correct |
| 25 |
Correct |
4 ms |
1804 KB |
Output is correct |
| 26 |
Correct |
4 ms |
1804 KB |
Output is correct |
| 27 |
Correct |
40 ms |
1804 KB |
Output is correct |
| 28 |
Correct |
16 ms |
1804 KB |
Output is correct |
| 29 |
Correct |
8 ms |
1804 KB |
Output is correct |
| 30 |
Correct |
8 ms |
1804 KB |
Output is correct |
| 31 |
Correct |
16 ms |
1804 KB |
Output is correct |
| 32 |
Correct |
48 ms |
1804 KB |
Output is correct |
| 33 |
Correct |
24 ms |
1804 KB |
Output is correct |
| 34 |
Correct |
8 ms |
1804 KB |
Output is correct |
| 35 |
Correct |
12 ms |
1804 KB |
Output is correct |
| 36 |
Correct |
44 ms |
1804 KB |
Output is correct |
| 37 |
Correct |
8 ms |
1804 KB |
Output is correct |
| 38 |
Correct |
8 ms |
1804 KB |
Output is correct |
| 39 |
Correct |
8 ms |
1804 KB |
Output is correct |
| 40 |
Correct |
8 ms |
1804 KB |
Output is correct |
