# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
39437 | smu201111192 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 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"
#include <cstdio>
#include <iostream>
int dp[105][105];
int chk[105][105];
int g(int y1,int x1,int y2,int x2){
return dp[y2][x2] - dp[y1-1][x2] - dp[y2][x1-1] + dp[y1-1][x1-1];
}
void findTreasure (int N) {
if(cnt > 0) Report (1, 1);
if(N <= 5){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
int cnt = countTreasure(i, j, i, j);
if(cnt)Report(i,j);
}
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
int cnt = countTreasure(1,1,i,j);
dp[i][j] = cnt;
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(g(i,j,i,j)){
Report(1,1);
}
}
}
}