# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
264856 | sjimed | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 1 ms | 384 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 sum[111][111];
void findTreasure (int N) {
int n = N;
for(int i=n; i>=1; i--) {
for(int j=n; j>=1; j--) {
if(i > n/2 && j > n/2) sum[i][j] = countTreasure(1, 1, i, j);
else if(i > n/2 && j <= n/2) sum[i][j] = sum[i][n] - countTreasure(1, j+1, i, n);
else if(j > n/2 && i <= n/2) sum[i][j] = sum[n][j] - countTreasure(i+1, 1, n, j);
else sum[i][j] = sum[i][n] + sum[n][j] - sum[n][n] + countTreasure(i+1, j+1, n, n);
}
}
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
if(sum[i][j] - sum[i-1][j] - sum[i][j-1] + sum[i-1][j-1]) Report(i, j);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |