Submission #42281

#TimeUsernameProblemLanguageResultExecution timeMemory
42281rlqja2222Treasure (different grader from official contest) (CEOI13_treasure2)C++14
0 / 100
2 ms804 KiB
#include "treasure.h" int row[101]; int col[101]; int n, c; void div_col(int i, int j, int r) { if (c == n) return; int rest = countTreasure(r, i, r, j); if (rest) { if (i == j) { row[c] = r, col[c] = i, c++; } else { int mid = (i + j) / 2; div_col(i, mid, r); div_col(mid + 1, j, r); } } } void div_row(int i, int j, int N) { if (c == n) return; if (i != j) { int mid = (i + j) / 2; int rest1 = countTreasure(i, 1, mid, N); if (rest1) div_row(i, mid, N); int rest2 = countTreasure(mid, 1, j, N); if (rest2) div_row(mid + 1, j, N); } else { div_col(1, N, i); } } void findTreasure(int N) { n = countTreasure(1, 1, N, N); if (n == 0) return; c = 0; div_row(1, N, N); while (--c >= 0) Report(row[c], col[c]); }

Compilation message (stderr)

grader.c: In function 'int main()':
grader.c:63:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         my_assert(strlen(A[i]+1) == N, "each line of the map must contain N zeroes or ones (before loop)");
                                  ^
#Verdict Execution timeMemoryGrader output
Fetching results...