# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
234164 | qaws12 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++98 | 5 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"
#include <iostream>
#define MAP 101
int map[MAP][MAP];
void findTreasure(int N) {
for (int i = N; i > 0; i--) {
for (int j = N; j > 0; j--) {
if (i > N / 2 && j > N / 2) {
map[i][j] = countTreasure(1, 1, i, j);
}
else if (i > N / 2 && j <= N / 2) {
map[i][j] = map[i][N] - countTreasure(1, j + 1, i, N);
}
else if (i <= N / 2 && j > N / 2) {
map[i][j] = map[N][j] - countTreasure(i + 1, 1, N, j);
}
else if (i <= N / 2 && j <= N / 2) {
map[i][j] = map[N][j] + map[i][N] + countTreasure(i + 1, j + 1, N, N) - map[N][N];
}
}
}
for (int i = N; i > 0; i--) {
for (int j = N; j > 0; j--) {
int answer = map[i][j] - map[i - 1][j] - map[i][j - 1] + map[i - 1][j - 1];
if (answer == 1) {
Report(i, j);
}
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |