Submission #914947

#	Time	Username	Problem	Language	Result	Execution time	Memory
914947		minhnhatnoe	Sightseeing in Kyoto (JOI22_kyoto)	C++17	0 / 100	2052 ms	1628 KiB

kyoto

#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MAXN = 100000;
alignas(1024) int a[MAXN], b[MAXN], dp[MAXN];

signed main(){
    cin.tie(0)->sync_with_stdio(0);
    int h, w; cin >> h >> w;
    for (int i=0; i<h; i++){
        cin >> a[i];
    }
    for (int j=0; j<w; j++){
        cin >> b[j];
    }

    memset(dp, 0x3f, sizeof dp);
    dp[0] = 0;

    for (int i=0; i<h-1; i++){
        int v = dp[0];
        for (int j=1; j<w; j++){
            v = v > dp[j] - a[i] * j ? dp[j] - a[i] * j : v;

            dp[j] = dp[j] < v + a[i] * j ? dp[j] : v + a[i] * j;
        }
        for (int j=0; j<w; j++){
            dp[j] += b[j];
        }
    }
    for (int j=1; j<w; j++){
        dp[j] = dp[j] < dp[j-1] + a[h-1] ? dp[j] : dp[j-1] + a[h-1];
    }
    cout << dp[w-1] << "\n";
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 30
• Subtask 3: 0 / 60