제출 #593004

#제출 시각아이디문제언어결과실행 시간메모리
593004jhnah917Sightseeing in Kyoto (JOI22_kyoto)C++14
10 / 100
8 ms8344 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll N, M, A[1010], B[1010], D[1010][1010];

int main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    cin >> N >> M;
    for(int i=1; i<=N; i++) cin >> A[i];
    for(int i=1; i<=M; i++) cin >> B[i];
    memset(D, 0x3f, sizeof D);
    D[1][1] = 0;
    for(int i=1; i<=N; i++){
        for(int j=1; j<=M; j++){
            if(i > 1) D[i][j] = min(D[i][j], D[i-1][j] + B[j]);
            if(j > 1) D[i][j] = min(D[i][j], D[i][j-1] + A[i]);
        }
    }
    cout << D[N][M];
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...