# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
9643 | jaehadad | On grid (kriii2_O) | C++14 | 1000 ms | 2812 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<cassert>
#include<cstring>
#include<map>
#include<set>
#include<time.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<utility>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int board[300][300];
bool seen[300][300];
int c[300][300];
int partial[300][300];
int rows, cols;
int psum(int y1, int y2, int x1, int x2) {
int ret = partial[y2][x2];
if(y1) ret -= partial[y1-1][x2];
if(x1) ret -= partial[y2][x1-1];
if(y1 && x1) ret += partial[y1-1][x1-1];
return ret;
}
int go(int y, int x) {
if(y == -1 && x == -1) return 0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |