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 <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mxn = 1010;
ll dp[mxn][mxn];
ll row[mxn],col[mxn];
ll n,m;
int main(){
cin>>n>>m;
if(n>mxn||m>mxn)return 0;
dp[1][1] = 0;
for(int i = 1;i<=n;i++)cin>>row[i];
for(int i= 1;i<=m;i++)cin>>col[i];
for(int i = 2;i<=n;i++){
dp[i][1] = dp[i-1][1]+col[1];
}
for(int i = 2;i<=m;i++){
dp[1][i] = dp[1][i-1]+row[1];
}
for(int i = 2;i<=n;i++){
for(int j = 2;j<=m;j++){
if(i == 1&&j == 1)continue;
dp[i][j] = min(dp[i-1][j]+col[j],dp[i][j-1]+row[i]);
}
}
// for(int i = 1;i<=n;i++){
// for(int j = 1;j<=m;j++){
// cout<<dp[i][j]<<' ';
// }
// cout<<endl;
// }
cout<<dp[n][m];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |