oj.uz

Submission #994217

# Submission time Handle Problem Language Result Execution time Memory
994217 2024-06-07T09:16:54 Z vjudge1 Sightseeing in Kyoto (JOI22_kyoto) C++17
0 / 100
 1 ms 4700 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int MAXN = 1001;

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 = 1; i <= n; i++) {
        for (int j = 1; j <= m; 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] + b[i]);
            dp[i+1][j] = min(dp[i+1][j], dp[i][j] + a[j]);
        }
    }
    cout << dp[n][m] << "\n";
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 4700 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -