| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 27230 | TAMREF | Treasure (different grader from official contest) (CEOI13_treasure2) | C11 | 0 ms | 1264 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 mark[101][101],psum[101][101];
void findTreasure(int N){
int i,j;
for(i=1;i<=2*N;i++){
for(j=i>N?i-N:1;j<(i>N?N+1:i);j++){
psum[i-j][j]=countTreasure(1,1,i-j,j);
mark[i-j][j]=psum[i-j][j]-psum[i-j-1][j]-psum[i-j][j-1]+psum[i-j-1][j-1];
}
}
for(i=1;i<=N;i++)
for(j=1;j<=N;j++)
if(mark[i][j]) Report(i,j);
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||