# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
40812 | hsb154 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 21 ms | 612 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 r1,int c1,int r2, int c2) {
int cnt = 0;
for (int i = r1; i <= r2; i++)
for (int j = c1; j <= c2; 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 (i + j < 2*N/3) {
if (cnt != count(i, 1, i, j) + countTreasure(i + 1, 1, N, N) + (j == N ? 0 : countTreasure(i, j + 1, N, N)) - (j == N||i==N ? 0 : countTreasure(i + 1, j + 1, N, N))) {
map[i][j] = 1;
}
}
else {
if (countTreasure(1, 1, i, j) != count(1, 1, i, j)) {
map[i][j] = 1;
}
}
}
cnt -= count(i, 1, i, N);
}
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... |