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>
#define int long long
using namespace std;
const int N = 1e5 + 5;
int n, m, A[N], B[N];
signed main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> A[i];
}
for (int i = 1; i <= m; i++) {
cin >> B[i];
}
if (max(n, m) <= 1000) {
static int dp[1005][1005];
memset(dp, 0x3f, sizeof dp);
dp[1][1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (i > 1 || j > 1) {
dp[i][j] = min(dp[i - 1][j] + B[j], dp[i][j - 1] + A[i]);
}
}
}
cout << dp[n][m] << "\n";
return 0;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |