# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94715 | newyear | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 2 ms | 504 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 "treasure.h"
int map[101][101], sum[101][101];
int mycount(int r, int c) {
if (sum[r][c]) return sum[r][c];
sum[r][c] = countTreasure(1, 1, r, c);
return sum[r][c];
}
void findTreasure(int N) {
map[1][1] = countTreasure(1, 1, 1, 1);
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (i == 1 && j == 1) continue;
if (i == 1) {
map[i][j] = mycount(i, j) - mycount(i, j - 1);
continue;
}
if (j == 1) {
map[i][j] = mycount(i, j) - mycount(i - 1, j);
continue;
}
map[i][j] = mycount(i, j) - mycount(i - 1, j) - mycount(i, j - 1) + mycount(i - 1, j - 1);
}
}
for (int i = 1; i <= N; i++)
for (int j = 1; j <= N; j++)
if (map[i][j]) Report(i, j);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |