#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;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
8148 KB |
Output is correct |
2 |
Correct |
3 ms |
8148 KB |
Output is correct |
3 |
Correct |
4 ms |
8148 KB |
Output is correct |
4 |
Correct |
3 ms |
8148 KB |
Output is correct |
5 |
Correct |
3 ms |
8148 KB |
Output is correct |
6 |
Correct |
3 ms |
8148 KB |
Output is correct |
7 |
Correct |
3 ms |
8136 KB |
Output is correct |
8 |
Correct |
3 ms |
8148 KB |
Output is correct |
9 |
Correct |
5 ms |
8148 KB |
Output is correct |
10 |
Correct |
5 ms |
8280 KB |
Output is correct |
11 |
Correct |
5 ms |
8276 KB |
Output is correct |
12 |
Correct |
5 ms |
8148 KB |
Output is correct |
13 |
Correct |
5 ms |
8276 KB |
Output is correct |
14 |
Correct |
5 ms |
8276 KB |
Output is correct |
15 |
Correct |
5 ms |
8152 KB |
Output is correct |
16 |
Correct |
5 ms |
8276 KB |
Output is correct |
17 |
Correct |
5 ms |
8184 KB |
Output is correct |
18 |
Correct |
3 ms |
8148 KB |
Output is correct |
19 |
Correct |
3 ms |
8148 KB |
Output is correct |
20 |
Correct |
3 ms |
8148 KB |
Output is correct |
21 |
Correct |
4 ms |
8140 KB |
Output is correct |
22 |
Correct |
3 ms |
8204 KB |
Output is correct |
23 |
Correct |
4 ms |
8272 KB |
Output is correct |
24 |
Correct |
3 ms |
8148 KB |
Output is correct |
25 |
Correct |
3 ms |
8148 KB |
Output is correct |
26 |
Correct |
3 ms |
8140 KB |
Output is correct |
27 |
Correct |
3 ms |
8148 KB |
Output is correct |
28 |
Correct |
3 ms |
8136 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
8148 KB |
Output is correct |
2 |
Correct |
4 ms |
8148 KB |
Output is correct |
3 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
8148 KB |
Output is correct |
2 |
Correct |
3 ms |
8148 KB |
Output is correct |
3 |
Correct |
4 ms |
8148 KB |
Output is correct |
4 |
Correct |
3 ms |
8148 KB |
Output is correct |
5 |
Correct |
3 ms |
8148 KB |
Output is correct |
6 |
Correct |
3 ms |
8148 KB |
Output is correct |
7 |
Correct |
3 ms |
8136 KB |
Output is correct |
8 |
Correct |
3 ms |
8148 KB |
Output is correct |
9 |
Correct |
5 ms |
8148 KB |
Output is correct |
10 |
Correct |
5 ms |
8280 KB |
Output is correct |
11 |
Correct |
5 ms |
8276 KB |
Output is correct |
12 |
Correct |
5 ms |
8148 KB |
Output is correct |
13 |
Correct |
5 ms |
8276 KB |
Output is correct |
14 |
Correct |
5 ms |
8276 KB |
Output is correct |
15 |
Correct |
5 ms |
8152 KB |
Output is correct |
16 |
Correct |
5 ms |
8276 KB |
Output is correct |
17 |
Correct |
5 ms |
8184 KB |
Output is correct |
18 |
Correct |
3 ms |
8148 KB |
Output is correct |
19 |
Correct |
3 ms |
8148 KB |
Output is correct |
20 |
Correct |
3 ms |
8148 KB |
Output is correct |
21 |
Correct |
4 ms |
8140 KB |
Output is correct |
22 |
Correct |
3 ms |
8204 KB |
Output is correct |
23 |
Correct |
4 ms |
8272 KB |
Output is correct |
24 |
Correct |
3 ms |
8148 KB |
Output is correct |
25 |
Correct |
3 ms |
8148 KB |
Output is correct |
26 |
Correct |
3 ms |
8140 KB |
Output is correct |
27 |
Correct |
3 ms |
8148 KB |
Output is correct |
28 |
Correct |
3 ms |
8136 KB |
Output is correct |
29 |
Correct |
3 ms |
8148 KB |
Output is correct |
30 |
Correct |
4 ms |
8148 KB |
Output is correct |
31 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
32 |
Halted |
0 ms |
0 KB |
- |