| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 86168 | faceless | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 2 ms | 640 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"
bool c[120][120];
int dp[120][120];
void findTreasure (int N) {
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
int cnt = countTreasure (1, 1, i, j);
dp[i][j] = cnt;
if (cnt - dp[i - 1][j] - dp[i][j - 1] + dp[i - 1][j - 1] == 1)
c[i][j] = 1;
}
}
for (int i = 1; i <= N; i++)
for (int j = 1; j <= N; j++)
if (c[i][j])
Report (i, j);
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||