Submission #7344

#TimeUsernameProblemLanguageResultExecution timeMemory
7344cki86201배열 탈출 (GA8_array)C++98
17 / 100
2000 ms20624 KiB
#include<stdio.h> int n, A[2224][2224]={0}; int cost(int r, int c){ if(r>n || c>n)return 1e8; int h,v; if(r==n && c==n) return 0; h=(A[r][c]>A[r][c+1] ? 0 : A[r][c+1]-A[r][c]+1); if(r==n) return h+cost(r,c+1); h+=cost(r,c+1); v=(A[r][c]>A[r+1][c] ? 0 : A[r+1][c]-A[r][c]+1); if(c==n) return v+cost(r+1,c); v+=cost(r+1,c); if(h>v) return v; return h; } int main(){ int i,j; scanf("%d", &n); for(i=1;i<=n;++i){ for(j=1;j<=n;++j){ scanf("%d", &A[i][j]); } } printf("%d\n", cost(1,1)); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...