#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = (int) 1e3 + 7;
const ll INF = (ll) 1e18;
ll dp[N][N], a[N], b[N];
int w, h;
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
/// freopen("input", "r", stdin);
cin >> w >> h;
for (int i = 1; i <= w; i++) {
cin >> a[i];
}
for (int i = 1; i <= h; i++) {
cin >> b[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
dp[i][j] = INF;
}
}
dp[1][1] = 0;
for (int i = 1; i <= w; i++) {
for (int j = 1; j <= h; j++) {
if (i == 1 && j == 1) {
continue;
}
dp[i][j] = min(dp[i - 1][j] + b[j], dp[i][j - 1] + a[i]);
}
}
cout << dp[w][h];
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
8148 KB |
Output is correct |
2 |
Correct |
3 ms |
8148 KB |
Output is correct |
3 |
Correct |
3 ms |
8148 KB |
Output is correct |
4 |
Correct |
4 ms |
8276 KB |
Output is correct |
5 |
Correct |
4 ms |
8276 KB |
Output is correct |
6 |
Correct |
3 ms |
8148 KB |
Output is correct |
7 |
Correct |
3 ms |
8148 KB |
Output is correct |
8 |
Correct |
3 ms |
8148 KB |
Output is correct |
9 |
Correct |
7 ms |
8276 KB |
Output is correct |
10 |
Correct |
7 ms |
8276 KB |
Output is correct |
11 |
Correct |
7 ms |
8276 KB |
Output is correct |
12 |
Correct |
7 ms |
8276 KB |
Output is correct |
13 |
Correct |
7 ms |
8276 KB |
Output is correct |
14 |
Correct |
7 ms |
8276 KB |
Output is correct |
15 |
Correct |
8 ms |
8276 KB |
Output is correct |
16 |
Correct |
7 ms |
8276 KB |
Output is correct |
17 |
Correct |
7 ms |
8276 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 |
3 ms |
8176 KB |
Output is correct |
22 |
Correct |
3 ms |
8148 KB |
Output is correct |
23 |
Correct |
4 ms |
8148 KB |
Output is correct |
24 |
Correct |
4 ms |
8268 KB |
Output is correct |
25 |
Correct |
3 ms |
8148 KB |
Output is correct |
26 |
Correct |
3 ms |
8264 KB |
Output is correct |
27 |
Correct |
4 ms |
8148 KB |
Output is correct |
28 |
Correct |
4 ms |
8148 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
8148 KB |
Output is correct |
2 |
Correct |
3 ms |
8148 KB |
Output is correct |
3 |
Incorrect |
5 ms |
8268 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 |
3 ms |
8148 KB |
Output is correct |
4 |
Correct |
4 ms |
8276 KB |
Output is correct |
5 |
Correct |
4 ms |
8276 KB |
Output is correct |
6 |
Correct |
3 ms |
8148 KB |
Output is correct |
7 |
Correct |
3 ms |
8148 KB |
Output is correct |
8 |
Correct |
3 ms |
8148 KB |
Output is correct |
9 |
Correct |
7 ms |
8276 KB |
Output is correct |
10 |
Correct |
7 ms |
8276 KB |
Output is correct |
11 |
Correct |
7 ms |
8276 KB |
Output is correct |
12 |
Correct |
7 ms |
8276 KB |
Output is correct |
13 |
Correct |
7 ms |
8276 KB |
Output is correct |
14 |
Correct |
7 ms |
8276 KB |
Output is correct |
15 |
Correct |
8 ms |
8276 KB |
Output is correct |
16 |
Correct |
7 ms |
8276 KB |
Output is correct |
17 |
Correct |
7 ms |
8276 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 |
3 ms |
8176 KB |
Output is correct |
22 |
Correct |
3 ms |
8148 KB |
Output is correct |
23 |
Correct |
4 ms |
8148 KB |
Output is correct |
24 |
Correct |
4 ms |
8268 KB |
Output is correct |
25 |
Correct |
3 ms |
8148 KB |
Output is correct |
26 |
Correct |
3 ms |
8264 KB |
Output is correct |
27 |
Correct |
4 ms |
8148 KB |
Output is correct |
28 |
Correct |
4 ms |
8148 KB |
Output is correct |
29 |
Correct |
3 ms |
8148 KB |
Output is correct |
30 |
Correct |
3 ms |
8148 KB |
Output is correct |
31 |
Incorrect |
5 ms |
8268 KB |
Output isn't correct |
32 |
Halted |
0 ms |
0 KB |
- |