# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41092 | tkqlzz | 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"
#define MAX(A, B) ((A) > (B) ? (A) : (B))
int sum[101][101];
void findTreasure (int N) {
int i, j;
i = j = N / 2;
for (int i = N/2 + 1; i <= N; i++)
for (int j = N/2 + 1; j <= N; j++)
sum[i][j] = countTreasure(1, 1, i, j);
for (int i = N / 2 + 1; i <= N; i++)
for (int j = 1; j <= N / 2; j++)
sum[i][j] = sum[i][N] - countTreasure(1, j + 1, i, N);
for (int i = 1; i <= N / 2; i++)
for (int j = N / 2 + 1; j <= N; j++)
sum[i][j] = sum[N][j] - countTreasure(i + 1, 1, N, j);
for (int i = 1; i <= N / 2; i++)
for (int j = 1; j <= N / 2; j++)
sum[i][j] = sum[i][N] + sum[N][j] + countTreasure(i+1, j+1, N, N) - sum[N][N];
if (sum[1][1] == 1)
Report(1, 1);
for (int i = 2; i <= N; i++) {
if (sum[i][1] - sum[i - 1][1] == 1)
Report(i, 1);
if (sum[1][i] - sum[1][i - 1] == 1)
Report(1, i);
}
for (int i = 2; i <= N; i++)
for (int j = 2; j <= N; j++)
if (sum[i][j] - sum[i - 1][j] - sum[i][j - 1] + sum[i-1][j-1] == 1)
Report(i, j);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |