# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94713 | wodlf1212 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 2 ms | 380 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 MAP[128][128];
void findTreasure (int N) {
for(int i=1; i<=N; i++){
for(int j=1; j<=N; j++){
if(countTreasure(i,j,i,j))
MAP[i][j] = 1;
}
}
for(int i=1; i<=N; i++){
for(int j=1; j<=N; j++){
if(MAP[i][j] == 1)
Report(i,j);
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |