# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
40775 | bysu | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 2 ms | 584 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 arr[10001][2];
int idx;
void solve(int sr, int sc, int er, int ec, int total) {
if (sr == er&&sc == ec) {
if (total == 0)
return;
else {
arr[idx][0] = sr, arr[idx++][1] = sc;
return;
}
}
if (total == (er - sr + 1)*(ec - sc + 1)) {
for (int i = sr; i <= er; i++) {
for (int j = sc; j <= ec; j++) {
arr[idx][0] = i;
arr[idx++][1] = j;
}
}
return;
}
int sum = 0;
int mr = (sr + er) >> 1;
int mc = (sc + ec) >> 1;
int a = countTreasure(sr, sc, mr, mc);
int b = countTreasure(sr, sc, er, mc);
int c = countTreasure(sr, sc, mr, ec);
int a1 = a;
int a2 = c - a;
int b1 = b - a;
int b2 = total - b - c + a;
if (a1 != 0)solve(sr, sc, mr, mc, a1);
if (a2 != 0)solve(sr, mc + 1, mr, ec, a2);
if (b1 != 0) solve(mr + 1, sc, er, mc, b1);
if (b2 != 0) solve(mr + 1, mc + 1, er, ec, b2);
}
void findTreasure (int N) {
int cnt = countTreasure(1, 1, N, N);
solve(1, 1, N, N, cnt);
for (int i = 0; i < idx; i++) {
Report(arr[i][0], arr[i][1]);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |