# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
40618 | baactree | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 2 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"
using namespace std;
int sum[105][105];
void findTreasure (int N) {
for(int i=N;i>=1;i--)
for (int j = N; j >=1; j--) {
if (i <= N / 2 && j <= N / 2)
sum[i][j] = sum[N][j] + sum[i][N] + countTreasure(i + 1, j + 1, N, N) - sum[N][N];
if (i <= N / 2 && j > N / 2)
sum[i][j] = sum[N][j] - countTreasure(i + 1, 1, N, j);
if (i > N / 2 && j <= N / 2)
sum[i][j] = sum[i][N] - countTreasure(1, j + 1, i, N);
if (i > N / 2 && j > N / 2)
sum[i][j] = countTreasure(1, 1, i, j);
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
int now = sum[i][j] - sum[i - 1][j] - sum[i][j - 1] + sum[i - 1][j - 1];
if (now)
Report(i, j);
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |