# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41036 | haro199 | 보물 찾기 (CEOI13_treasure2) | C11 | 2 ms | 564 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.
int myMap[105][105];
void findTreasure(int N) {
//countTreasure(1, 1, N, N); SEARCH
//Report(2, 1); REPORT
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
myMap[i][j] = countTreasure(1, 1, i, j);
}
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (myMap[i-1][j]+myMap[i][j-1] - myMap[i-1][j-1] + 1 == myMap[i][j])
Report(i, j);
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |