Submission #994220

# Submission time Handle Problem Language Result Execution time Memory
994220 2024-06-07T09:20:04 Z vjudge1 Sightseeing in Kyoto (JOI22_kyoto) C++17
10 / 100
47 ms 65032 KB
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int MAXN = 2010;

ll dp[MAXN][MAXN], a[MAXN], b[MAXN];

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int n, m; cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= m; i++) cin >> b[i];
    for (int i = 0; i < MAXN; i++) {
        for (int j = 0; j < MAXN; j++) {
            dp[i][j] = 1e18;
        }
    }
    dp[1][1] = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            dp[i][j+1] = min(dp[i][j+1], dp[i][j] + a[i]);
            dp[i+1][j] = min(dp[i+1][j], dp[i][j] + b[j]);
        }
    }
    cout << dp[n][m] << "\n";
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 31832 KB Output is correct
2 Correct 5 ms 31836 KB Output is correct
3 Correct 5 ms 31836 KB Output is correct
4 Correct 5 ms 31924 KB Output is correct
5 Correct 5 ms 32092 KB Output is correct
6 Correct 5 ms 32092 KB Output is correct
7 Correct 5 ms 32092 KB Output is correct
8 Correct 5 ms 31836 KB Output is correct
9 Correct 6 ms 32092 KB Output is correct
10 Correct 6 ms 32092 KB Output is correct
11 Correct 6 ms 31924 KB Output is correct
12 Correct 7 ms 32092 KB Output is correct
13 Correct 6 ms 32092 KB Output is correct
14 Correct 6 ms 32108 KB Output is correct
15 Correct 7 ms 32088 KB Output is correct
16 Correct 6 ms 31960 KB Output is correct
17 Correct 6 ms 32092 KB Output is correct
18 Correct 5 ms 32092 KB Output is correct
19 Correct 7 ms 31896 KB Output is correct
20 Correct 5 ms 32092 KB Output is correct
21 Correct 4 ms 31872 KB Output is correct
22 Correct 5 ms 32092 KB Output is correct
23 Correct 6 ms 31836 KB Output is correct
24 Correct 4 ms 31836 KB Output is correct
25 Correct 5 ms 31836 KB Output is correct
26 Correct 6 ms 31852 KB Output is correct
27 Correct 6 ms 31876 KB Output is correct
28 Correct 4 ms 31836 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 32088 KB Output is correct
2 Correct 5 ms 31864 KB Output is correct
3 Correct 5 ms 32088 KB Output is correct
4 Runtime error 47 ms 65032 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 5 ms 31832 KB Output is correct
2 Correct 5 ms 31836 KB Output is correct
3 Correct 5 ms 31836 KB Output is correct
4 Correct 5 ms 31924 KB Output is correct
5 Correct 5 ms 32092 KB Output is correct
6 Correct 5 ms 32092 KB Output is correct
7 Correct 5 ms 32092 KB Output is correct
8 Correct 5 ms 31836 KB Output is correct
9 Correct 6 ms 32092 KB Output is correct
10 Correct 6 ms 32092 KB Output is correct
11 Correct 6 ms 31924 KB Output is correct
12 Correct 7 ms 32092 KB Output is correct
13 Correct 6 ms 32092 KB Output is correct
14 Correct 6 ms 32108 KB Output is correct
15 Correct 7 ms 32088 KB Output is correct
16 Correct 6 ms 31960 KB Output is correct
17 Correct 6 ms 32092 KB Output is correct
18 Correct 5 ms 32092 KB Output is correct
19 Correct 7 ms 31896 KB Output is correct
20 Correct 5 ms 32092 KB Output is correct
21 Correct 4 ms 31872 KB Output is correct
22 Correct 5 ms 32092 KB Output is correct
23 Correct 6 ms 31836 KB Output is correct
24 Correct 4 ms 31836 KB Output is correct
25 Correct 5 ms 31836 KB Output is correct
26 Correct 6 ms 31852 KB Output is correct
27 Correct 6 ms 31876 KB Output is correct
28 Correct 4 ms 31836 KB Output is correct
29 Correct 5 ms 32088 KB Output is correct
30 Correct 5 ms 31864 KB Output is correct
31 Correct 5 ms 32088 KB Output is correct
32 Runtime error 47 ms 65032 KB Execution killed with signal 11
33 Halted 0 ms 0 KB -