oj.uz

답안 #1032424

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1032424 2024-07-23T17:45:34 Z Blagoj 푸드 코트 (JOI21_foodcourt) C++17
24 / 100
 296 ms 82236 KB 
#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define ll long long
#define all(x) (x).begin(), (x).end()

const int mxn = 3e5 + 100;

vector<pair<ll, ll>> qs[mxn], fs[mxn], xs[mxn]; 
ll l[mxn], r[mxn], c[mxn], k[mxn], a[mxn], b[mxn];

struct Node {
    ll sum = 0, suf = 0, total = 0;
} null;

struct SGT {
    vector<Node> sgt;

    SGT(int sz) {
        sgt.resize(4 * sz);
    }

    void merge(Node &k, Node k1, Node k2) {
        k.sum = k1.sum + k2.sum;
        k.suf = max(k2.suf, k1.suf + k2.sum);
    }

    void fix(int k, int l, int r, int i, ll val) {
        if (l > i || r < i) return;
        if (l == r) {
            sgt[k].sum = val;
            sgt[k].suf = max(val, 0LL);
            return;
        }
        int mid = (l + r) / 2;
        fix(k * 2, l, mid, i, val);
        fix(k * 2 + 1, mid + 1, r, i, val);
        merge(sgt[k], sgt[k * 2], sgt[k * 2 + 1]);
    }

    void update(int k, int l, int r, int i, ll val) {
        if (l > i || r < i) return;
        if (l == r) {
            sgt[k].total = val;
            return;
        }
        int mid = (l + r) / 2;
        update(k * 2, l, mid, i, val);
        update(k * 2 + 1, mid + 1, r, i, val);
        sgt[k].total = sgt[k * 2].total + sgt[k * 2 + 1].total;
    }

    Node mx(int k, int l, int r, int i, int j) {
        if (l > j || r < i) return null;
        if (i <= l && r <= j) return sgt[k];
        int mid = (l + r) / 2;
        Node ansL = mx(k * 2, l, mid, i, j), ansR = mx(k * 2 + 1, mid + 1, r, i, j);
        Node ans;
        merge(ans, ansL, ansR);
        return ans;
    }

    ll get(int k, int l, int r, int i, int j) {
        if (l > j || r < i) return 0;
        if (i <= l && r <= j) return sgt[k].total;
        int mid = (l + r) / 2;
        return get(k * 2, l, mid, i, j) + get(k * 2 + 1, mid + 1, r, i, j);
    }

    ll walk(int k, int l, int r, int i) {
        if (l == r) return sgt[k].total > i ? l : l + 1;
        int mid = (l + r) / 2;
        if (sgt[k * 2].total > i) return walk(k * 2, l, mid, i);
        return walk(k * 2 + 1, mid + 1, r, i - sgt[k * 2].total);
    }
} sgt(mxn);

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, m, q;
    cin >> n >> m >> q;
    for (int i = 0; i < q; i++) {
        int type;
        cin >> type;
        if (type == 1) {
            cin >> l[i] >> r[i] >> c[i] >> k[i];
            qs[l[i]].push_back({i, k[i]});
            qs[r[i] + 1].push_back({i, 0});
            fs[l[i]].push_back({i, k[i]});
            fs[r[i] + 1].push_back({i, 0});
        }
        if (type == 2) {
            cin >> l[i] >> r[i] >> k[i];
            qs[l[i]].push_back({i, -k[i]});
            qs[r[i] + 1].push_back({i, 0});
        }
        if (type == 3) {
            cin >> a[i] >> b[i];
            xs[a[i]].push_back({i, b[i]});
        }
    }
    ll ans[q + 10];
    memset(ans, -1, sizeof(ans));
    for (int i = 1; i <= n; i++) {
        for (auto x : qs[i]) sgt.fix(1, 0, q - 1, x.first, x.second);
        for (auto x : fs[i]) sgt.update(1, 0, q - 1, x.first, x.second);
        for (auto x : xs[i]) {
            Node val = sgt.mx(1, 0, q - 1, 0, x.first);
            if (val.suf < x.second) {
                ans[x.first] = 0;
                continue; 
            }
            ll ind = sgt.get(1, 0, q - 1, 0, x.first) - val.suf + x.second;
            ans[x.first] = c[sgt.walk(1, 0, q - 1, ind - 1)]; 
        }
    }
    for (int i = 0; i < q; i++) {
        if (ans[i] != -1) cout << ans[i] << endl;
    }
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 50008 KB Output is correct
2 Correct 22 ms 50012 KB Output is correct
3 Correct 23 ms 50012 KB Output is correct
4 Correct 21 ms 49876 KB Output is correct
5 Correct 27 ms 50008 KB Output is correct
6 Correct 23 ms 50012 KB Output is correct
7 Correct 21 ms 50012 KB Output is correct
8 Correct 21 ms 50072 KB Output is correct
9 Correct 22 ms 50012 KB Output is correct
10 Correct 21 ms 49880 KB Output is correct
11 Correct 22 ms 50012 KB Output is correct
12 Correct 21 ms 50000 KB Output is correct
13 Correct 20 ms 50012 KB Output is correct
14 Correct 21 ms 49876 KB Output is correct
15 Correct 21 ms 50008 KB Output is correct
16 Correct 23 ms 50012 KB Output is correct
17 Correct 22 ms 50012 KB Output is correct
18 Correct 27 ms 50008 KB Output is correct
19 Correct 25 ms 50012 KB Output is correct
20 Correct 22 ms 50008 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 50008 KB Output is correct
2 Correct 22 ms 50012 KB Output is correct
3 Correct 23 ms 50012 KB Output is correct
4 Correct 21 ms 49876 KB Output is correct
5 Correct 27 ms 50008 KB Output is correct
6 Correct 23 ms 50012 KB Output is correct
7 Correct 21 ms 50012 KB Output is correct
8 Correct 21 ms 50072 KB Output is correct
9 Correct 22 ms 50012 KB Output is correct
10 Correct 21 ms 49880 KB Output is correct
11 Correct 22 ms 50012 KB Output is correct
12 Correct 21 ms 50000 KB Output is correct
13 Correct 20 ms 50012 KB Output is correct
14 Correct 21 ms 49876 KB Output is correct
15 Correct 21 ms 50008 KB Output is correct
16 Correct 23 ms 50012 KB Output is correct
17 Correct 22 ms 50012 KB Output is correct
18 Correct 27 ms 50008 KB Output is correct
19 Correct 25 ms 50012 KB Output is correct
20 Correct 22 ms 50008 KB Output is correct
21 Incorrect 22 ms 50012 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 58448 KB Output is correct
2 Correct 89 ms 59220 KB Output is correct
3 Correct 75 ms 58648 KB Output is correct
4 Correct 70 ms 58444 KB Output is correct
5 Correct 75 ms 59340 KB Output is correct
6 Correct 86 ms 59292 KB Output is correct
7 Correct 44 ms 56236 KB Output is correct
8 Correct 43 ms 56748 KB Output is correct
9 Correct 75 ms 58708 KB Output is correct
10 Correct 76 ms 58820 KB Output is correct
11 Correct 85 ms 58856 KB Output is correct
12 Correct 87 ms 58932 KB Output is correct
13 Correct 66 ms 58196 KB Output is correct
14 Correct 86 ms 59024 KB Output is correct
15 Correct 79 ms 60244 KB Output is correct
16 Correct 86 ms 60572 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 296 ms 82236 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 50008 KB Output is correct
2 Correct 22 ms 50012 KB Output is correct
3 Correct 23 ms 50012 KB Output is correct
4 Correct 21 ms 49876 KB Output is correct
5 Correct 27 ms 50008 KB Output is correct
6 Correct 23 ms 50012 KB Output is correct
7 Correct 21 ms 50012 KB Output is correct
8 Correct 21 ms 50072 KB Output is correct
9 Correct 22 ms 50012 KB Output is correct
10 Correct 21 ms 49880 KB Output is correct
11 Correct 22 ms 50012 KB Output is correct
12 Correct 21 ms 50000 KB Output is correct
13 Correct 20 ms 50012 KB Output is correct
14 Correct 21 ms 49876 KB Output is correct
15 Correct 21 ms 50008 KB Output is correct
16 Correct 23 ms 50012 KB Output is correct
17 Correct 22 ms 50012 KB Output is correct
18 Correct 27 ms 50008 KB Output is correct
19 Correct 25 ms 50012 KB Output is correct
20 Correct 22 ms 50008 KB Output is correct
21 Correct 77 ms 58448 KB Output is correct
22 Correct 89 ms 59220 KB Output is correct
23 Correct 75 ms 58648 KB Output is correct
24 Correct 70 ms 58444 KB Output is correct
25 Correct 75 ms 59340 KB Output is correct
26 Correct 86 ms 59292 KB Output is correct
27 Correct 44 ms 56236 KB Output is correct
28 Correct 43 ms 56748 KB Output is correct
29 Correct 75 ms 58708 KB Output is correct
30 Correct 76 ms 58820 KB Output is correct
31 Correct 85 ms 58856 KB Output is correct
32 Correct 87 ms 58932 KB Output is correct
33 Correct 66 ms 58196 KB Output is correct
34 Correct 86 ms 59024 KB Output is correct
35 Correct 79 ms 60244 KB Output is correct
36 Correct 86 ms 60572 KB Output is correct
37 Correct 69 ms 57424 KB Output is correct
38 Correct 65 ms 57168 KB Output is correct
39 Correct 40 ms 55560 KB Output is correct
40 Correct 45 ms 56564 KB Output is correct
41 Correct 78 ms 58448 KB Output is correct
42 Correct 77 ms 58708 KB Output is correct
43 Correct 76 ms 58708 KB Output is correct
44 Correct 86 ms 58636 KB Output is correct
45 Correct 79 ms 58704 KB Output is correct
46 Correct 93 ms 58708 KB Output is correct
47 Correct 50 ms 57316 KB Output is correct
48 Correct 63 ms 58348 KB Output is correct
49 Correct 59 ms 56144 KB Output is correct
50 Correct 65 ms 57552 KB Output is correct
51 Correct 74 ms 58704 KB Output is correct
52 Correct 78 ms 58704 KB Output is correct
53 Correct 73 ms 58192 KB Output is correct
54 Correct 94 ms 60568 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 87 ms 58392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 50008 KB Output is correct
2 Correct 22 ms 50012 KB Output is correct
3 Correct 23 ms 50012 KB Output is correct
4 Correct 21 ms 49876 KB Output is correct
5 Correct 27 ms 50008 KB Output is correct
6 Correct 23 ms 50012 KB Output is correct
7 Correct 21 ms 50012 KB Output is correct
8 Correct 21 ms 50072 KB Output is correct
9 Correct 22 ms 50012 KB Output is correct
10 Correct 21 ms 49880 KB Output is correct
11 Correct 22 ms 50012 KB Output is correct
12 Correct 21 ms 50000 KB Output is correct
13 Correct 20 ms 50012 KB Output is correct
14 Correct 21 ms 49876 KB Output is correct
15 Correct 21 ms 50008 KB Output is correct
16 Correct 23 ms 50012 KB Output is correct
17 Correct 22 ms 50012 KB Output is correct
18 Correct 27 ms 50008 KB Output is correct
19 Correct 25 ms 50012 KB Output is correct
20 Correct 22 ms 50008 KB Output is correct
21 Incorrect 22 ms 50012 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 50008 KB Output is correct
2 Correct 22 ms 50012 KB Output is correct
3 Correct 23 ms 50012 KB Output is correct
4 Correct 21 ms 49876 KB Output is correct
5 Correct 27 ms 50008 KB Output is correct
6 Correct 23 ms 50012 KB Output is correct
7 Correct 21 ms 50012 KB Output is correct
8 Correct 21 ms 50072 KB Output is correct
9 Correct 22 ms 50012 KB Output is correct
10 Correct 21 ms 49880 KB Output is correct
11 Correct 22 ms 50012 KB Output is correct
12 Correct 21 ms 50000 KB Output is correct
13 Correct 20 ms 50012 KB Output is correct
14 Correct 21 ms 49876 KB Output is correct
15 Correct 21 ms 50008 KB Output is correct
16 Correct 23 ms 50012 KB Output is correct
17 Correct 22 ms 50012 KB Output is correct
18 Correct 27 ms 50008 KB Output is correct
19 Correct 25 ms 50012 KB Output is correct
20 Correct 22 ms 50008 KB Output is correct
21 Incorrect 22 ms 50012 KB Output isn't correct
22 Halted 0 ms 0 KB -