# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
656390 | RambaXGorilla | Treasure (different grader from official contest) (CEOI13_treasure2) | C++17 | 1 ms | 340 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"
using namespace std;
/*
int countTreasure(int r1, int c1, int r2, int c2);
void Report(int r, int c);
*/
int nums[110][110] = {};
void findTreasure(int N){
int half = N / 2;
for(int i = N;i > 0;i--){
for(int j = N;j > 0;j--){
if(i > half && j > half){
nums[i][j] = countTreasure(1, 1, i, j);
}
else if(i > half && j <= half){
nums[i][j] = nums[i][N] - countTreasure(1, j + 1, i, N);
}
else if(i <= half && j > half){
nums[i][j] = nums[N][j] - countTreasure(i + 1, 1, N, j);
}
else{
nums[i][j] = nums[i][N] + nums[N][j] + countTreasure(i + 1, j + 1, N, N) - nums[N][N];
}
}
}
for(int i = 1;i < N + 1;i++){
for(int j = 1;j < N + 1;j++){
if(nums[i][j] - nums[i - 1][j] - nums[i][j - 1] + nums[i - 1][j - 1]){
Report(i, j);
}
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |