Submission #594886

#	Time	Username	Problem	Language	Result	Execution time	Memory
594886		piOOE	Dungeon 3 (JOI21_ho_t5)	C++17	11 / 100	4093 ms	7332 KiB

Main

#include <bits/stdc++.h>

using namespace std;

using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m;
    cin >> n >> m;
    vector<int> a(n), b(n);
    vector<ll> pref(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        pref[i] = (i ? pref[i - 1] : 0) + a[i];
    }
    for (int i = 0; i < n; ++i) {
        cin >> b[i];
    }
    vector<int> R(n, n), stk;
    for (int i = 0; i < n; ++i) {
        while (!stk.empty() && b[stk.back()] >= b[i]) {
            R[stk.back()] = i;
            stk.pop_back();
        }
        stk.push_back(i);
    }
    auto get = [&](int l, int r) {
        return pref[r] - (l ? pref[l - 1] : 0);
    };
    while (m--) {
        int s, t, u;
        cin >> s >> t >> u;
        --s, --t;
        ll ans = 0, cur = 0;
        for (int i = s; i < t; ++i) {
            ll mx = min(get(i, min(t, R[i]) - 1), (ll)u);
            ll buy = max(0ll, mx - cur);
            ans += buy * b[i];
            cur += buy;
            cur -= a[i];
            if (cur < 0) {
                break;
            }
        }
        cout << (cur >= 0 ? ans : -1) << '\n';
    }
    return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 14
• Subtask 3: 0 / 31
• Subtask 4: 0 / 44