oj.uz

Submission #998646

# Submission time Handle Problem Language Result Execution time Memory
998646 2024-06-14T12:14:46 Z vladilius Food Court (JOI21_foodcourt) C++17
2 / 100
 1000 ms 38340 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){
        for (int i = 1; i <= r; i++){
            if (get(1, i) >= k){
                return i;
            }
        }
        while (true){
            k++;
        }
    }
};
 
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);
    for (int i = 1; i <= n; i++){
        for (auto [j, k]: st[i]){
            T.upd(j, k);
            if (k >= 0) Ts.upd(j, k);
        }
        for (auto [j, b]: qs[i]){
            ll cur = T.get(1, j);
            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 7 ms 604 KB Output is correct
2 Correct 12 ms 820 KB Output is correct
3 Correct 4 ms 604 KB Output is correct
4 Correct 8 ms 820 KB Output is correct
5 Correct 9 ms 604 KB Output is correct
6 Correct 9 ms 604 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 8 ms 604 KB Output is correct
9 Correct 11 ms 604 KB Output is correct
10 Correct 9 ms 604 KB Output is correct
11 Correct 9 ms 824 KB Output is correct
12 Correct 9 ms 604 KB Output is correct
13 Correct 8 ms 756 KB Output is correct
14 Correct 13 ms 604 KB Output is correct
15 Correct 7 ms 724 KB Output is correct
16 Correct 13 ms 604 KB Output is correct
17 Correct 6 ms 604 KB Output is correct
18 Correct 9 ms 604 KB Output is correct
19 Correct 4 ms 604 KB Output is correct
20 Correct 4 ms 604 KB Output is correct

Subtask #2
0 / 5.0

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

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 12380 KB Output is correct
2 Correct 69 ms 12428 KB Output is correct
3 Correct 96 ms 12380 KB Output is correct
4 Correct 78 ms 12368 KB Output is correct
5 Correct 103 ms 12408 KB Output is correct
6 Correct 78 ms 12376 KB Output is correct
7 Execution timed out 1036 ms 7628 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

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

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 604 KB Output is correct
2 Correct 12 ms 820 KB Output is correct
3 Correct 4 ms 604 KB Output is correct
4 Correct 8 ms 820 KB Output is correct
5 Correct 9 ms 604 KB Output is correct
6 Correct 9 ms 604 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 8 ms 604 KB Output is correct
9 Correct 11 ms 604 KB Output is correct
10 Correct 9 ms 604 KB Output is correct
11 Correct 9 ms 824 KB Output is correct
12 Correct 9 ms 604 KB Output is correct
13 Correct 8 ms 756 KB Output is correct
14 Correct 13 ms 604 KB Output is correct
15 Correct 7 ms 724 KB Output is correct
16 Correct 13 ms 604 KB Output is correct
17 Correct 6 ms 604 KB Output is correct
18 Correct 9 ms 604 KB Output is correct
19 Correct 4 ms 604 KB Output is correct
20 Correct 4 ms 604 KB Output is correct
21 Correct 67 ms 12380 KB Output is correct
22 Correct 69 ms 12428 KB Output is correct
23 Correct 96 ms 12380 KB Output is correct
24 Correct 78 ms 12368 KB Output is correct
25 Correct 103 ms 12408 KB Output is correct
26 Correct 78 ms 12376 KB Output is correct
27 Execution timed out 1036 ms 7628 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

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

Subtask #7
0 / 26.0

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

Subtask #8
0 / 11.0

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