oj.uz

Submission #998638

# Submission time Handle Problem Language Result Execution time Memory
998638 2024-06-14T11:55:52 Z vladilius Food Court (JOI21_foodcourt) C++17
24 / 100
 71 ms 39112 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
#define pb push_back
#define ff first
#define ss second
#define ins insert

struct ST{
    struct node{
        ll sum, max_suf;
    };
    using pni = pair<node, int>;
    vector<node> t;
    node null;
    int n;
    ST(int ns){
        n = ns;
        t.resize(4 * n);
        null = {0, 0};
    }
    node merge(node x, node y){
        return {x.sum + y.sum, max(y.max_suf, x.max_suf + y.sum)};
    }
    void upd(int v, int tl, int tr, int& p, int& k){
        if (tl == tr){
            t[v] = {k, k};
            return;
        }
        int tm = (tl + tr) / 2, vv = 2 * v;
        if (p <= tm){
            upd(vv, tl, tm, p, k);
        }
        else {
            upd(vv + 1, tm + 1, tr, p, k);
        }
        t[v] = merge(t[vv], t[vv + 1]);
    }
    void upd(int p, int k){
        upd(1, 1, n, p, k);
    }
    node get(int v, int tl, int tr, int& l, int& r){
        if (l > tr || r < tl) return null;
        if (l <= tl && tr <= r) return t[v];
        int tm = (tl + tr) / 2, vv = 2 * v;
        return merge(get(vv, tl, tm, l, r), get(vv + 1, tm + 1, tr, l, r));
    }
    ll get(int l, int r){
        return get(1, 1, n, l, r).max_suf;
    }
};

struct ST1{
    vector<ll> t;
    int n;
    ST1(int ns){
        n = ns;
        t.resize(4 * n);
    }
    void upd(int v, int tl, int tr, int& p, int& k){
        if (tl == tr){
            t[v] = k;
            return;
        }
        int tm = (tl + tr) / 2, vv = 2 * v;
        if (p <= tm){
            upd(vv, tl, tm, p, k);
        }
        else {
            upd(vv + 1, tm + 1, tr, p, k);
        }
        t[v] = t[vv] + t[vv + 1];
    }
    void upd(int p, int k){
        upd(1, 1, n, p, k);
    }
    ll get(int v, int tl, int tr, int& l, int& r){
        if (l > tr || r < tl) return 0;
        if (l <= tl && tr <= r) return t[v];
        int tm = (tl + tr) / 2, vv = 2 * v;
        return get(vv, tl, tm, l, r) + get(vv + 1, tm + 1, tr, l, r);
    }
    ll get(int l, int r){
        return get(1, 1, n, l, r);
    }
    int get_p(int r, ll k){
        int bl = 1, br = r;
        while (bl + 1 < br){
            int m = (bl + br) / 2;
            if (get(1, m) >= k){
                br = m;
            }
            else {
                bl = m + 1;
            }
        }
        if (get(1, bl) >= k) br = bl;
        return br;
    }
};

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n, m, q; cin>>n>>m>>q;
    vector<pii> st[n + 2];
    vector<pil> qs[n + 1];
    vector<int> col(q + 1);
    for (int tt = 1; tt <= q; tt++){
        int type; cin>>type;
        if (type == 1){
            int l, r, c, k; cin>>l>>r>>c>>k;
            st[l].pb({tt, k});
            st[r + 1].pb({tt, 0});
            col[tt] = c;
        }
        else if (type == 2){
            int l, r, k; cin>>l>>r>>k;
            st[l].pb({tt, -k});
            st[r + 1].pb({tt, 0});
        }
        else {
            int a, b; cin>>a>>b;
            qs[a].pb({tt, b});
        }
    }
    ST T(q);
    ST1 Ts(q);
    vector<int> out(q + 1, -1), a(q + 1);
    for (int i = 1; i <= n; i++){
        for (auto [j, k]: st[i]){
            T.upd(j, k);
            a[j] = k;
            if (k >= 0) Ts.upd(j, k);
        }
        for (auto [j, b]: qs[i]){
            ll cur = T.get(1, j);
            ll sum = 0, maxi = 0;
            for (int t = j; t > 0; t--){
                sum += a[t];
                maxi = max(maxi, sum);
            }
            if (b > cur){
                out[j] = 0;
                continue;
            }
            b = Ts.get(1, j) - cur + b;
            out[j] = col[Ts.get_p(j, b)];
        }
    }
    for (int i = 1; i <= q; i++){
        if (out[i] != -1){
            cout<<out[i]<<"\n";
        }
    }
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 620 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 1 ms 592 KB Output is correct
18 Correct 2 ms 788 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 2 ms 860 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 620 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 1 ms 592 KB Output is correct
18 Correct 2 ms 788 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 2 ms 860 KB Output is correct
21 Incorrect 1 ms 600 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 13908 KB Output is correct
2 Correct 50 ms 13908 KB Output is correct
3 Correct 50 ms 13856 KB Output is correct
4 Correct 43 ms 13904 KB Output is correct
5 Correct 47 ms 13904 KB Output is correct
6 Correct 47 ms 13772 KB Output is correct
7 Correct 27 ms 8584 KB Output is correct
8 Correct 30 ms 8928 KB Output is correct
9 Correct 46 ms 13712 KB Output is correct
10 Correct 47 ms 13912 KB Output is correct
11 Correct 46 ms 13924 KB Output is correct
12 Correct 44 ms 13728 KB Output is correct
13 Correct 45 ms 11600 KB Output is correct
14 Correct 53 ms 13660 KB Output is correct
15 Correct 49 ms 12628 KB Output is correct
16 Correct 51 ms 13908 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 45 ms 39112 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 620 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 1 ms 592 KB Output is correct
18 Correct 2 ms 788 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 2 ms 860 KB Output is correct
21 Correct 46 ms 13908 KB Output is correct
22 Correct 50 ms 13908 KB Output is correct
23 Correct 50 ms 13856 KB Output is correct
24 Correct 43 ms 13904 KB Output is correct
25 Correct 47 ms 13904 KB Output is correct
26 Correct 47 ms 13772 KB Output is correct
27 Correct 27 ms 8584 KB Output is correct
28 Correct 30 ms 8928 KB Output is correct
29 Correct 46 ms 13712 KB Output is correct
30 Correct 47 ms 13912 KB Output is correct
31 Correct 46 ms 13924 KB Output is correct
32 Correct 44 ms 13728 KB Output is correct
33 Correct 45 ms 11600 KB Output is correct
34 Correct 53 ms 13660 KB Output is correct
35 Correct 49 ms 12628 KB Output is correct
36 Correct 51 ms 13908 KB Output is correct
37 Correct 67 ms 12284 KB Output is correct
38 Correct 55 ms 11392 KB Output is correct
39 Correct 29 ms 7380 KB Output is correct
40 Correct 40 ms 8488 KB Output is correct
41 Correct 69 ms 13656 KB Output is correct
42 Correct 71 ms 13660 KB Output is correct
43 Correct 68 ms 13704 KB Output is correct
44 Correct 67 ms 13728 KB Output is correct
45 Correct 69 ms 13724 KB Output is correct
46 Correct 67 ms 13660 KB Output is correct
47 Correct 54 ms 12564 KB Output is correct
48 Correct 67 ms 13148 KB Output is correct
49 Correct 43 ms 9812 KB Output is correct
50 Correct 53 ms 12116 KB Output is correct
51 Correct 63 ms 13660 KB Output is correct
52 Correct 64 ms 13660 KB Output is correct
53 Correct 40 ms 11088 KB Output is correct
54 Correct 53 ms 13916 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 50 ms 10700 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 620 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 1 ms 592 KB Output is correct
18 Correct 2 ms 788 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 2 ms 860 KB Output is correct
21 Incorrect 1 ms 600 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 620 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 1 ms 592 KB Output is correct
18 Correct 2 ms 788 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 2 ms 860 KB Output is correct
21 Incorrect 1 ms 600 KB Output isn't correct
22 Halted 0 ms 0 KB -