# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41219 | wzy | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 2 ms | 676 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"
char ans[110][110];
void solve(int x1 , int x2 , int y1 , int y2){
int p = countTreasure(x1, y1 , x2 , y2);
if(p == 0){
for(int i = x1 ; i <= x2 ; i++){
for(int j = y1 ; j <= y2 ; j++) ans[i][j] = '0';
}
return;
}
else{
if(p == (x2 - x1 + 1)*(y2 - y1 + 1)){
for(int i = x1 ; i <= x2 ; i++){
for(int j = y1 ; j <= y2 ; j++) ans[i][j] = '1';
}
return;
}
else{
solve(x1 , (x1+x2)/2 , y1 , (y1+y2)/2);
solve(x1 , (x1 + x2)/2 , (y1 + y2)/2 + 1 , y2);
solve((x1 + x2)/2 + 1 , x2 , y1 , (y1 + y2)/2);
solve((x1 + x2)/2 + 1 , x2 , (y1 + y2)/2 + 1 , y2);
}
}
}
void findTreasure (int N) {
solve(1 , N , 1 , N);
for(int i = 1 ; i <= N ; i++){
for(int j = 1 ; j <= N ; j++){
if(ans[i][j] == '1') Report(i,j);
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |