# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
39586 | cheater2k | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 0 ms | 2128 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"
#include <bits/stdc++.h>
using namespace std;
const int MAX = 105;
int a[MAX][MAX];
void findTreasure(int n) {
int mid = (n / 2);
for (int i = mid + 1; i <= n; ++i) {
for (int j = mid + 1; j <= n; ++j) {
a[i][j] = countTreasure(1, 1, i, j);
}
}
for (int i = mid + 1; i <= n; ++i) {
for (int j = 1; j <= mid; ++j) {
a[i][j] = a[i][n] - countTreasure(1, j + 1, i, n);
}
}
for (int i = 1; i <= mid; ++i) {
for (int j = mid + 1; j <= n; ++j) {
a[i][j] = a[n][j] - countTreasure(i + 1, 1, n, j);
}
}
for (int i = 1; i <= mid; ++i) {
for (int j = 1; j <= mid; ++j) {
a[i][j] = (a[i][n] + a[n][j] + countTreasure(i + 1, j + 1, n, n)) - a[n][n];
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (a[i][j] - a[i - 1][j] - a[i][j - 1] + a[i - 1][j - 1]) {
Report(i, j);
}
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |