| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 9713 | corea | On grid (kriii2_O) | C++14 | 184 ms | 225880 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 <iostream>
#include <cstring>
#include <tuple>
#include <cassert>
#include <vector>
#include <algorithm>
using namespace std;
#define REP(i, n) for(int i=0; i < n; ++i)
int n, m;
int a[305][305];
long long S[305][305];
long long V[305][305];
long long C[305][305];
long long M[305][305][305];
long long compute_M(int i, int j, int k) {
if(j == 1) {
int l = 0;
return C[k][l] - S[i][l] - S[k][j] + S[k][l];
}
else {
long long left = M[i][j - 1][k] - S[k][j] + S[k][j - 1];
int l = j - 1;
long long right = C[k][l] - S[i][l] - S[k][j] + S[k][l];
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||