# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
40788 | hsb154 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 22 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"
int countTreasure(int r1, int c1, int r2, int c2);
void Report(int r, int c);
bool map[101][101];
int count(int r, int c) {
int cnt = 0;
for (int i = 1; i <= r; i++)
for (int j = 1; j <= c; j++)
if (map[i][j])
cnt++;
return cnt;
}
void findTreasure(int N) {
int cnt = countTreasure(1, 1, N, N);
int myCnt = 0;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (countTreasure(1, 1, i, j) != count(i, j)) {
map[i][j] = 1;
myCnt++;
}
if (myCnt == cnt) {
i = N + 1;
break;
}
}
}
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... |