# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
40798 | bysu | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 2 ms | 644 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 dp[101][101];
int func(int r, int c) {
if (dp[r][c] == -1) {
dp[r][c] = countTreasure(1, 1, r, c);
if (dp[r][c] == 0) {
for (int i = 1; i <= r; i++) {
for (int j = 1; j <= c; j++) {
dp[i][j] = 0;
}
}
}
}
else if (dp[r][c] == r*c) {
for (int i = 1; i <= r; i++) {
for (int j = 1; j <= c; j++) {
dp[i][j] = dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]+1;
}
}
}
return dp[r][c];
}
void findTreasure(int N) {
for (int i = 1; i < 101; i++) {
for (int j = 1; j < 101; j++) {
dp[i][j] = -1;
}
}
for (int i = N; i > 0; i--) {
for (int j = N; j > 0; j--) {
func(i, j);
}
}
for (int i = N; i > 0; i--) {
for (int j = N; j > 0; j--) {
if (dp[i][j] - dp[i - 1][j] - dp[i][j - 1] + dp[i - 1][j - 1]) {
Report(i, j);
}
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |