# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
26952 | sgc109 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++11 | 0 ms | 1268 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 dp[103][103];
int exist[103][103];
void findTreasure (int N) {
for(int i = 1; i <= N; i++){
for(int j = 1 ; j <= N; j++){
int cnt = countTreasure(1, 1, i, j);
int know = dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1];
if(cnt != know) exist[i][j] = 1;
dp[i][j] = cnt;
}
}
for(int i = 1; i <= N; i++){
for(int j = 1; j <= N; j++){
if(exist[i][j]) Report(i, j);
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |