# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14818 | eaststar | Treasure (different grader from official contest) (CEOI13_treasure2) | C++98 | 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 "treasure.h"
int s[110][110];
void findTreasure(int N){
int i,j;
for(i=N;i>0;--i){
for(j=N;j>0;--j){
if(i>N/2){
if(j>N/2)s[i][j]=count(1,1,i,j);
else s[i][j]=s[i][N]-count(1,j+1,i,N);
}
else{
if(j>N/2)s[i][j]=s[N][j]-count(i+1,1,N,j);
else s[i][j]=-s[N][N]+s[i][N]+s[N][j]+count(i+1,j+1,N,N);
}
}
}
for(i=1;i<=N;++i){
for(j=1;j<=N;++j)result(i,j,s[i][j]-s[i-1][j]-s[i][j-1]+s[i-1][j-1]? '1':'0');
}
}