# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
56358 | leejseo | 배열 탈출 (GA8_array) | C++98 | 971 ms | 66560 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 <stdio.h>
#include <algorithm>
using namespace std;
int A[2230][2230], D[2230][2230], N;
inline bool valid(int i, int j) {
return 0<=i && i<N && 0<=j && j<N;
}
void input(){
scanf("%d", &N);
for (int i=0; i<N; i++){
for (int j=0; j<N; j++){
scanf("%d", &A[i][j]);
}
}
}
void DP(){
D[0][0] = 0;
for (int i=0; i<N; i++){
for (int j=0; j<N; j++){
if (i == 0 && j == 0) continue;
D[i][j] = (int)1e9;
if (valid(i-1, j)) D[i][j] = min(D[i][j], D[i-1][j] + max(0, A[i][j] - A[i-1][j] + 1));
if (valid(i, j-1)) D[i][j] = min(D[i][j], D[i][j-1] + max(0, A[i][j] - A[i][j-1] + 1));
}
}
}
int main(void){
input();
DP();
printf("%d\n", D[N-1][N-1]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |