# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
9388 | hodduc | On grid (kriii2_O) | C++98 | 48 ms | 2504 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<stdio.h>
int R, C;
int map[301][301];
int s[301][301];
int d[301][301];
int dd[301][301];
int tr[301];
int main()
{
scanf("%d %d", &R, &C);
for(int i = 1; i <= R; i++) for(int j = 1; j <= C; j++){
scanf("%d", &map[i][j]);
}
for(int i = 1; i <= R; i++){
int t = 0;
for(int j = 1; j <= C; j++){
t += map[i][j];
s[i][j] = s[i-1][j] + t;
}
}
for(int i = 1; i <= R; i++)
{
for(int kk = 1; kk < i; kk++)
tr[kk] = -1999999999;
for(int j = 1; j <= C; j++)
{
int tt = 0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |