# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41044 | bgh2982 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 2 ms | 684 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 sum[101][101];
void findTreasure(int N) {
int i, j;
for (i = N; i >= 1; i--)
for (j = N; j >= 1; j--) {
if (i > N / 2) {
if (j > N / 2) //4사분면
sum[i][j] = countTreasure(1, 1, i, j);
else //3사분면
sum[i][j] = sum[i][N] - countTreasure(1, j + 1, i, N);
}
else {
if (j > N / 2) //2사분면
sum[i][j] = sum[N][j] - countTreasure(i + 1, 1, N, j);
else //1사분면
sum[i][j] = -(sum[N][N] - sum[i][N] - sum[N][j] - countTreasure(i + 1, j + 1, N, N));
}
}
for(i=1 ; i<=N ; i++)
for(j=1 ; j<=N ; j++)
if (sum[i][j] - sum[i - 1][j] - sum[i][j - 1] + sum[i - 1][j - 1])
Report(i, j);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |