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>
typedef long long ll;
using namespace std;
ll ans[1001][1001];
ll BIG = 1e18 + 9;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w;
cin >> h >> w;
vector<ll> a(h), b(w);
for(int i = 0; i < h; i++) {
cin >> a[i];
}
for(int i = 0; i < w; i++) {
cin >> b[i];
}
for(int i = 0; i < h; i++) {
for(int j = 0; j < w; j++) {
if(max(i, j)) {
if(i == 0) ans[i][j] = ans[i][j-1] + a[i];
else if(j == 0) ans[i][j] = ans[i-1][j] + b[j];
else ans[i][j] = min(ans[i][j-1] + a[i], ans[i-1][j] + b[j]);
}
else ans[i][j] = 0;
}
}
cout << ans[h-1][w-1] << '\n';
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |