제출 #1267595

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1267595		nguyn	푸드 코트 (JOI21_foodcourt)	C++20	100 / 100	389 ms	63692 KiB

foodcourt

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define ll long long
#define F first
#define S second
#define pb push_back
#define pii pair<int, int>

const int N = 2.5e5 + 5;
const ll inf = 1e18;

struct SegTree1 {
    vector<ll> st;
    int n;

    SegTree1(int n) : n(n) {
        st.resize(4 * n + 5);
    }

    void update(int id, int l, int r, int i, int x) {
        if (l == r) {
            st[id] += x;
            return;
        }
        int mid = (l + r) / 2;
        if (i <= mid) update(id * 2, l, mid, i, x);
        else update(id * 2 + 1, mid + 1, r, i, x);
        st[id] = st[id * 2] + st[id * 2 + 1];
    }

    ll get(int id, int l, int r, int u, int v) {
        if (l > v || r < u) return 0;
        if (u <= l && r <= v) return st[id];
        int mid = (l + r) / 2;
        return get(id * 2, l, mid, u, v) + get(id * 2 + 1, mid + 1, r, u, v);
    }

    int walk(int id, int l, int r, ll x) {
        if (l == r) {
            return l;
        }
        int mid = (l + r) / 2;
        if (st[id * 2] < x) {
            return walk(id * 2 + 1, mid + 1, r, x - st[id * 2]);
        }
        return walk(id * 2, l, mid, x);
    }
};

struct SegTree2 {
    vector<pair<ll, ll>> st;
    int n;

    SegTree2(int n) : n(n) {
        st.resize(4 * n + 5);
    }

    void update(int id, int l, int r, int i, int x) {
        if (l == r) {
            st[id].F += x;
            st[id].S = max(st[id].F, 0ll);
            return;
        }
        int mid = (l + r) / 2;
        if (i <= mid) update(id * 2, l, mid, i, x);
        else update(id * 2 + 1, mid + 1, r, i, x);
        st[id].F = st[id * 2].F + st[id * 2 + 1].F;
        st[id].S = max(st[id * 2].S + st[id * 2 + 1].F, st[id * 2 + 1].S);
    }

    pair<ll, ll> get(int id, int l, int r, int u, int v) {
        if (l > v || r < u) {
            return {0, 0};
        }
        if (u <= l && r <= v) {
            return st[id];
        }
        int mid = (l + r) / 2;
        auto lef = get(id * 2, l, mid, u, v);
        auto rig = get(id * 2 + 1, mid + 1, r, u, v);
        return {lef.F + rig.F, max(lef.S + rig.F, rig.S)};
    }
};

int n, m, q;

struct Query {
    int type, l, r, c; ll k;
} que[N];
int res[N];

vector<int> add[N];
vector<int> del[N];
vector<int> ev[N];


signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m >> q;
    for (int i = 1; i <= q; i++) {
        int type;
        cin >> type;
        if (type == 1) {
            int l, r, c, k;
            cin >> l >> r >> c >> k;
            que[i] = {type, l, r, c, k};
            add[l].pb(i);
            add[r + 1].pb(- i);
        }
        else if (type == 2) {
            int l, r, k;
            cin >> l >> r >> k;
            que[i] = {type, l, r, -1, k};
            del[l].pb(i);
            del[r + 1].pb(- i);
        }
        else {
            int l, k; cin >> l >> k;
            que[i] = {type, l, -1, -1, k};
            ev[l].pb(i);
        }
    }
    SegTree1 st1(q);
    SegTree2 st2(q);
    for (int i = 1; i <= n; i++) {
        for (int id : add[i]) {
            if (id > 0) {
                st1.update(1, 1, q, id, que[id].k);
                st2.update(1, 1, q, id, que[id].k);
            }
            else {
                id = - id;
                st1.update(1, 1, q, id, - que[id].k);
                st2.update(1, 1, q, id, - que[id].k);
            }
        }
        for (int id : del[i]) {
            if (id > 0) {
                st2.update(1, 1, q, id, - que[id].k);
            }
            else {
                id = -id;
                st2.update(1, 1, q, id, que[id].k);
            }
        }
        for (int id : ev[i]) {
            ll cur = st2.get(1, 1, q, 1, id).S;
            if (cur >= que[id].k) {
                ll index = st1.get(1, 1, q, 1, id) - (cur - que[id].k);
//                cout << st1.get(1, 1, q, 1, id) << ' ' << cur << '\n';
                int pos = st1.walk(1, 1, q, index);
//                cout << id << ' ' << st1.get(1, 1, q, 1, id) << ' ' << cur << ' ' << index << endl;
                res[id] = que[pos].c;
             }
        }
    }
    for (int i = 1; i <= q; i++) {
        if (que[i].type == 3) cout << res[i] << '\n';
    }
}

• Subtask 1: 2 / 2
• Subtask 2: 5 / 5
• Subtask 3: 7 / 7
• Subtask 4: 21 / 21
• Subtask 5: 15 / 15
• Subtask 6: 13 / 13
• Subtask 7: 26 / 26
• Subtask 8: 11 / 11