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;
int main(){
int H, W;
cin >> H >> W;
vector <unsigned long long> A(H), B(W);
for(auto &x : A){
cin >> x;
}
for(auto &x : B){
cin >> x;
}
unsigned long long dp[H][W] = {0};
for(int i = 1; i < H; i++){
dp[i][0] = B[0] * i;
}
for(int j = 1; j < W; j++){
dp[0][j] = A[0] * j;
}
for(int i = 1; i < H; i++){
for(int j = 1; j < W; j++){
cerr << (dp[i][j] = min(dp[i][j - 1] + A[i], dp[i - 1][j] + B[j])) << " ";
}
cerr << "\n";
}
cout << dp[H - 1][W - 1];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |