# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
40614 | pce913 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 2 ms | 568 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 M[105][105]; //누적합
void findTreasure(int N) {
int mid = N / 2;
for (int i = N; i >= 1; i--) {
for (int j = N; j >= 1; j--) {
if (i <= mid){
if (j <= mid){ //왼쪽 위
M[i][j] = M[i][N] + M[j][N] + countTreasure(i + 1, j + 1, N, N) - M[N][N];
}
else{ //오른쪽 위
M[i][j] = M[N][j] - countTreasure(i + 1, 1, N, j);
}
}
else{
if (j <= mid){ //왼쪽 아래
M[i][j] = M[i][N] - countTreasure(1, j + 1, i, N);
}
else{ //오른쪽 아래
M[i][j] = countTreasure(1, 1, i, j);
}
}
}
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (M[i][j] - M[i][j - 1] - M[i - 1][j] + M[i - 1][j - 1] == 1){
Report(i, j);
}
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |