제출 #259959

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
259959		keko37	Two Dishes (JOI19_dishes)	C++14	100 / 100	3560 ms	250500 KiB

dishes

#include<bits/stdc++.h>

using namespace std;

typedef long long llint;

const int MAXN = 1000005;
const llint INF = 1000000000000000000LL;

llint n, m, sol;
llint a[MAXN], b[MAXN], s[MAXN], t[MAXN], p[MAXN], q[MAXN];
llint suma[MAXN], sumb[MAXN], d[MAXN], lim[MAXN];
vector <int> v[MAXN], r;
set <int> st;

void upd (int pos) {
    llint ofs = 0;
    while (pos <= m) {
        int nxt = *st.upper_bound(pos);
        if (d[pos] - ofs > lim[pos]) {
            d[pos] -= ofs;
            break;
        }
        ofs += lim[pos] - d[pos];
        d[pos] = lim[pos];
        st.erase(pos);
        pos = nxt;
    }
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> s[i] >> p[i];
        suma[i] = suma[i - 1] + a[i];
    }
    for (int i = 1; i <= m; i++) {
        cin >> b[i] >> t[i] >> q[i];
        sumb[i] = sumb[i - 1] + b[i];

        if (sumb[i] > t[i]) continue;
        d[i] = lim[i] = q[i];
        int ind = upper_bound(suma, suma + n + 1, t[i] - sumb[i]) - suma;
        v[ind].push_back(i);
    }
    st.insert(m + 1);
    for (int i = 1; i <= n; i++) {
        r.clear();
        if (suma[i] <= s[i]) {
            int ind = upper_bound(sumb, sumb + m + 1, s[i] - suma[i]) - sumb - 1;
            d[0] += p[i];
            d[ind + 1] -= p[i];
            st.insert(ind + 1); r.push_back(ind + 1);
        }
        for (auto x : v[i]) {
            lim[x] = 0;
            st.insert(x); r.push_back(x);
        }
        for (auto x : r) upd(x);
    }
    for (int i = 0; i <= m; i++) sol += d[i];
    cout << sol;
    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 3 / 3
• Subtask 3: 7 / 7
• Subtask 4: 39 / 39
• Subtask 5: 11 / 11
• Subtask 6: 9 / 9
• Subtask 7: 17 / 17
• Subtask 8: 9 / 9