# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
310780 | Fischer | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 0 ms | 0 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 <bits/stdc++.h>
#include "treasure.h"
using namespace std;
const int maxn = 110;
int acc[maxn][maxn];
bool mat[maxn][maxn];
void findTreasure(int n) {
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (i <= n/2 && j <= n/2) acc[i][j] = countTreasure(1, 1, i, n) - acc[i][j-1];
else if (i <= n/2) acc[i][j] = countTreasure(1, 1, i, j);
else if (j <= n/2) acc[i][j] = countTreasure(1, 1, i, j);
else acc[i][j] = countTreasure(1, 1, i, j);
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
mat[i][j] = acc[i][j] - acc[i-1][j] - acc[i][j-1] + acc[i-1][j-1];
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (mat[i][j]) report(i, j);
}
}
}