# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94703 | pica4500 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++98 | 2 ms | 420 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 treasure[101][101];
void findTreasure(int N) {
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (countTreasure(i, j, i, j)) {
treasure[i][j] = true;
}
}
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (treasure[i][j]) Report(i, j);
}
}
//int cnt = countTreasure(1, 1, N, N);
//if (cnt > 0) Report(1, 1);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |