oj.uz

답안 #994226

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
994226 2024-06-07T09:28:53 Z vjudge1 Sightseeing in Kyoto (JOI22_kyoto) C++17
0 / 100
 27 ms 64512 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int MAXN = 2010;

ll dp[MAXN][MAXN], a[MAXN], b[MAXN], idxa[MAXN], idxb[MAXN], timera = 1, timerb = 1;
bool hva[MAXN], hvb[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;
        }
    }
    for (int i = 1; i <= n; i++) {
        if (!hva[a[i]]) {
            hva[a[i]] = 1;
            idxa[timera++] = i;
        }
    }
    for (int i = 1; i <= m; i++) {
        if (!hvb[b[i]]) {
            hvb[b[i]] = 1;
            idxb[timerb++] = i;
        }
    }
    dp[1][1] = 0;
    for (int i = 1; i < timera; i++) {
        for (int j = 1; j < timerb; j++) {
            dp[i][j+1] = min(dp[i][j+1], dp[i][j] + a[i] * (idxb[j+1] - idxb[j]));
            dp[i+1][j] = min(dp[i+1][j], dp[i][j] + b[j] * (idxa[i+1] - idxa[i]));
        }
    }
    cout << dp[timera-1][timerb-1] << "\n";
    return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 32092 KB Output is correct
2 Correct 5 ms 32092 KB Output is correct
3 Runtime error 27 ms 64512 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 32092 KB Output is correct
2 Correct 7 ms 32092 KB Output is correct
3 Incorrect 5 ms 32092 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 32092 KB Output is correct
2 Correct 5 ms 32092 KB Output is correct
3 Runtime error 27 ms 64512 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -