Submission #41226

#TimeUsernameProblemLanguageResultExecution timeMemory
41226wzyTreasure (different grader from official contest) (CEOI13_treasure2)C++14
41 / 100
2 ms504 KiB
#include "treasure.h" using namespace std; #define min(a,b) a < b ? a : b #define max(a,b) a > b ? a : b bool ans[110][110]; int n; int solve(int x1 , int x2 , int y1 , int y2){ int p = countTreasure(x1, y1 , x2 , y2); int pz = p; if(p == 0){ return p ; } 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 p; } else{ int midx = (x1+x2)/2 , midy = (y1 + y2)/2; if(x1 <= midx){ if(y1 <= midy ) pz -= solve(x1 , midx , y1 , midy); if(y2 > midy && pz) pz -=solve(x1, midx , midy + 1 , y2); } if(x2 > midx){ if(p == (x2 - x1 + 1)*(y2 - y1 + 1)){ for(int i = midx + 1 ; i <= x2 ; i++){ for(int j = y1 ; j <= y2 ; j++) ans[i][j]=1; } return p; } if(y1 <= midy && pz) pz -= solve(midx + 1 , x2, y1 , midy); if(y2 > midy && pz){ pz-= solve(midx + 1 , x2 , midy + 1 , y2); if(pz == (x2 - midx)*(y2 - midy)){ for(int i =midx + 1 ; i<= x2 ; i++) for(int j = midy + 1 ; j <= y2; j++) ans[i][j] = true; } return p; } } } } return p; } void findTreasure (int N) { n = 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)

grader.c: In function 'int main()':
grader.c:63:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         my_assert(strlen(A[i]+1) == N, "each line of the map must contain N zeroes or ones (before loop)");
                                  ^
#Verdict Execution timeMemoryGrader output
Fetching results...