# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
258639 | dolphingarlic | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 1 ms | 384 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 pref[101][101];
void findTreasure(int N) {
for (int i = N; i; i--) for (int j = N; j; j--) {
if (i > N / 2) {
if (j > N / 2) pref[i][j] = countTreasure(1, 1, i, j);
else pref[i][j] = pref[i][N] - countTreasure(1, j + 1, i, N);
} else {
if (j > N / 2) pref[i][j] = pref[N][j] - countTreasure(i + 1, 1, N, j);
else pref[i][j] = countTreasure(1, 1, i, j);
}
}
for (int i = N; i; i--) for (int j = N; j; j--) {
if (pref[i][j] + pref[i - 1][j - 1] - pref[i - 1][j] - pref[i][j - 1]) Report(i, j);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |