# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
8920 | xhae | On grid (kriii2_O) | C++14 | 1000 ms | 1876 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 <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int dp[300][300];
bool isVisited[300][300];
int sum[300][300];
int r, c;
int getSum(int sy, int sx, int ey, int ex)
{
int ret = sum[ey][ex];
if(sy > 0) ret -= sum[sy - 1][ex];
if(sx > 0) ret -= sum[ey][sx - 1];
if(sy > 0 and sx > 0) ret += sum[sy - 1][sx - 1];
return ret;
}
int getAns(int y, int x)
{
if(y == r and x == c) return 0;
else if(y == r or x == c) return -(1 << 29);
int &ret = dp[y][x];
if(isVisited[y][x]) return ret;
isVisited[y][x] = true;
ret = -(1 << 29);
for(int cy = y; cy < r; cy++)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |