# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
999315 | MilosMilutinovic | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 1 ms | 600 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 <bits/stdc++.h>
using namespace std;
const int MAX = 111;
int val[MAX][MAX];
void findTreasure(int N) {
int mid = (N + 1) / 2;
for (int i = N; i >= 1; i--) {
for (int j = N; j >= 1; j--) {
if (i >= mid && j >= mid) {
val[i][j] = countTreasure(1, 1, i, j);
} else if (i >= mid && j < mid) {
val[i][j] = val[i][N] - countTreasure(1, j + 1, i, N);
} else if (i < mid && j >= mid) {
val[i][j] = val[N][j] - countTreasure(i + 1, 1, N, j);
} else {
val[i][j] = -(val[N][N] - val[i][N] - val[N][j] - countTreasure(i + 1, j + 1, N, N));
}
}
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
int c = val[i][j] - val[i - 1][j] - val[i][j - 1] + val[i - 1][j - 1];
if (c == 1) {
Report(i, j);
}
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |