# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94704 | tgc333 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 2 ms | 376 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 <iostream>
#include "treasure.h"
using namespace std;
int map[100][100] = { 0 };
void findTreasure(int N) {
int x = 1; int y = 1;
int cnt = countTreasure(y, x, N, N);
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (countTreasure(i, j, i, j)) map[i][j] = 1;
}
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (map[i][j] == 1)
Report(i, j);
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |