oj.uz

Submission #979750

# Submission time Handle Problem Language Result Execution time Memory
979750 2024-05-11T10:44:01 Z Jarif_Rahman New Home (APIO18_new_home) C++17
57 / 100
 5000 ms 325204 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

const int lim = 7e6;

struct Node{
    int inc = -1e9, dec = -1e9;
    Node *l = nullptr, *r = nullptr;

    Node(){}
    Node(Node *_l, Node *_r): l(_l), r(_r){}
    void update(){
        inc = -1e9;
        if(l) inc = max(inc, l->inc);
        if(r) inc = max(inc, r->inc);

        dec = -1e9;
        if(l) dec = max(dec, l->dec);
        if(r) dec = max(dec, r->dec);
    }
};

/*int ls_node = 0;
Node* newNode(){
    return &Nodes[ls_node++];
}*/

struct sparse_segtree{
    Node* root = new Node();
    int n = 1;
    sparse_segtree(int _n){
        while(n < _n) n*=2;
    }
    void update(int i, Node *nd, int a, int b, int x, bool inc){
        if(a == b){
            if(inc) nd->inc = x+n-1-i;
            else nd->dec = x+i;
            return;
        }
        int m = (a+b)/2;
        if(i <= m){
            if(nd->l == nullptr) nd->l = new Node();
            update(i, nd->l, a, m, x, inc);
        }
        else{
             if(nd->r == nullptr) nd->r = new Node();
             update(i, nd->r, m+1, b, x, inc);
        }
        nd->update();
    }
    void update(int i, int x, bool inc){
        update(i, root, 0, n-1, x, inc);
    }

    int get(int l, int r, Node* nd, int a, int b, bool inc){
        if(!nd) return -1e9;
        if(a > r || b < l) return -1e9;
        if(a >= l && b <= r){
            if(inc) return nd->inc;
            else return nd->dec;
        }
        int m = (a+b)/2;
        return max(get(l, r, nd->l, a, m, inc), get(l, r, nd->r, m+1, b, inc));
    }
    int get(int l, int r, bool inc){
        return get(l, r, root, 0, n-1, inc);
    }
};

const int L = 1e8+5;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, k, q; cin >> n >> k >> q;
    vector<tuple<int, int, int, int>> queries;

    for(int i = 0; i < n; i++){
        int x, t, a, b; cin >> x >> t >> a >> b; t--;
        queries.push_back({a, 0, x, t});
        queries.push_back({b, 2, x, t});
    }
    for(int i = 0; i < q; i++){
        int l, y; cin >> l >> y;
        queries.push_back({y, 1, l, i});
    }
    sort(queries.begin(), queries.end());

    vector<set<int>> stores(k);
    vector<map<int, int>> cnt(k);
    map<int, multiset<int>> mx[2];
    sparse_segtree S(L);

    auto add_to_mx = [&](int i, int x, bool inc){
        if(mx[inc][i].empty() || x > *mx[inc][i].rbegin()) S.update(i, x, inc);
        mx[inc][i].insert(x);
    };
    auto remove_from_mx = [&](int i, int x, bool inc){
        mx[inc][i].erase(mx[inc][i].find(x));
        if(mx[inc][i].empty()) S.update(i, -1e9, inc);
        else if(x > *mx[inc][i].rbegin()) S.update(i, *mx[inc][i].rbegin(), inc);
    };

    auto add = [&](int t, int x){
        cnt[t][x]++;
        if(cnt[t][x] > 1) return;
        auto it = stores[t].insert(x).first;
        if(stores[t].size() == 1){
            add_to_mx(0, x, false);
            add_to_mx(L-1, L-1-x, true);
        }
        else if(it == stores[t].begin()){
            remove_from_mx(0, *next(it), false);
            add_to_mx(0, x, false);
            int md = (x+*next(it))/2;
            if(md > x) add_to_mx(md, md-x, true);
            add_to_mx(md+1, *next(it)-md-1, false);
        }
        else if(next(it) == stores[t].end()){
            remove_from_mx(L-1, L-1-*prev(it), true);
            int md = (*prev(it)+x)/2;
            if(md > *prev(it)) add_to_mx(md, md-*prev(it), true);
            add_to_mx(md+1, x-md-1, false);
            add_to_mx(L-1, L-1-x, true);
        }
        else{
            int md = (*prev(it)+*next(it))/2;
            if(md > *prev(it)) remove_from_mx(md, md-*prev(it), true);
            remove_from_mx(md+1, *next(it)-md-1, false);

            md = (*prev(it)+x)/2;
            if(md > *prev(it)) add_to_mx(md, md-*prev(it), true);
            add_to_mx(md+1, x-md-1, false);

            md = (x+*next(it))/2;
            if(md > x) add_to_mx(md, md-x, true);
            add_to_mx(md+1, *next(it)-md-1, false);
        }
    };
    auto remove = [&](int t, int x){
        cnt[t][x]--;
        if(cnt[t][x] > 0) return;
        auto it = stores[t].find(x);
        if(stores[t].size() == 1){
            remove_from_mx(0, x, false);
            remove_from_mx(L-1, L-1-x, true);
        }
        else if(it == stores[t].begin()){
            add_to_mx(0, *next(it), false);
            remove_from_mx(0, x, false);
            int md = (x+*next(it))/2;
            if(md > x) remove_from_mx(md, md-x, true);
            remove_from_mx(md+1, *next(it)-md-1, false);
        }
        else if(next(it) == stores[t].end()){
            add_to_mx(L-1, L-1-*prev(it), true);
            int md = (*prev(it)+x)/2;
            if(md > *prev(it)) remove_from_mx(md, md-*prev(it), true);
            remove_from_mx(md+1, x-md-1, false);
            remove_from_mx(L-1, L-1-x, true);
        }
        else{
            int md = (*prev(it)+*next(it))/2;
            if(md > *prev(it)) add_to_mx(md, md-*prev(it), true);
            add_to_mx(md+1, *next(it)-md-1, false);

            md = (*prev(it)+x)/2;
            if(md > *prev(it)) remove_from_mx(md, md-*prev(it), true);
            remove_from_mx(md+1, x-md-1, false);

            md = (x+*next(it))/2;
            if(md > x) remove_from_mx(md, md-x, true);
            remove_from_mx(md+1, *next(it)-md-1, false);
        }
        stores[t].erase(it);
    };

    vector<int> cnt_t(k, 0);
    int nonzero = 0;

    vector<int> ans(q);

    for(auto [_, type, x, i]: queries){
        if(type == 0){
            cnt_t[i]++;
            if(cnt_t[i] == 1) nonzero++;
            add(i, x);
        }
        else if(type == 2){
            cnt_t[i]--;
            if(cnt_t[i] == 0) nonzero--;
            remove(i, x);
        }
        else{
            if(nonzero < k) ans[i] = -1;
            else ans[i] = max(S.get(0, x, 0)-x, S.get(x, S.n-1, 1)-(S.n-1)+x);
        }
    }

    for(int x: ans) cout << x << "\n";
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 3 ms 1116 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 4 ms 1116 KB Output is correct
11 Correct 3 ms 600 KB Output is correct
12 Correct 5 ms 1044 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 668 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 860 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 2 ms 600 KB Output is correct
25 Correct 2 ms 860 KB Output is correct
26 Correct 2 ms 744 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 3 ms 1116 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 4 ms 1116 KB Output is correct
11 Correct 3 ms 600 KB Output is correct
12 Correct 5 ms 1044 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 668 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 860 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 2 ms 600 KB Output is correct
25 Correct 2 ms 860 KB Output is correct
26 Correct 2 ms 744 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1211 ms 102620 KB Output is correct
32 Correct 51 ms 6168 KB Output is correct
33 Correct 1209 ms 103104 KB Output is correct
34 Correct 1215 ms 97944 KB Output is correct
35 Correct 1206 ms 105488 KB Output is correct
36 Correct 1183 ms 107156 KB Output is correct
37 Correct 756 ms 101728 KB Output is correct
38 Correct 744 ms 103848 KB Output is correct
39 Correct 607 ms 99240 KB Output is correct
40 Correct 626 ms 102540 KB Output is correct
41 Correct 499 ms 55232 KB Output is correct
42 Correct 527 ms 55608 KB Output is correct
43 Correct 51 ms 5076 KB Output is correct
44 Correct 512 ms 55584 KB Output is correct
45 Correct 486 ms 55268 KB Output is correct
46 Correct 477 ms 55592 KB Output is correct
47 Correct 269 ms 44224 KB Output is correct
48 Correct 291 ms 47020 KB Output is correct
49 Correct 324 ms 51048 KB Output is correct
50 Correct 334 ms 49328 KB Output is correct
51 Correct 340 ms 53144 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3088 ms 214320 KB Output is correct
2 Correct 1758 ms 238116 KB Output is correct
3 Correct 699 ms 105796 KB Output is correct
4 Correct 2602 ms 196684 KB Output is correct
5 Correct 1679 ms 242148 KB Output is correct
6 Correct 1667 ms 238612 KB Output is correct
7 Correct 654 ms 106072 KB Output is correct
8 Correct 2858 ms 197232 KB Output is correct
9 Correct 3069 ms 227512 KB Output is correct
10 Correct 2053 ms 239440 KB Output is correct
11 Correct 1525 ms 233548 KB Output is correct
12 Correct 1755 ms 237332 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5044 ms 325204 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 3 ms 1116 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 4 ms 1116 KB Output is correct
11 Correct 3 ms 600 KB Output is correct
12 Correct 5 ms 1044 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 668 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 860 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 2 ms 600 KB Output is correct
25 Correct 2 ms 860 KB Output is correct
26 Correct 2 ms 744 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1211 ms 102620 KB Output is correct
32 Correct 51 ms 6168 KB Output is correct
33 Correct 1209 ms 103104 KB Output is correct
34 Correct 1215 ms 97944 KB Output is correct
35 Correct 1206 ms 105488 KB Output is correct
36 Correct 1183 ms 107156 KB Output is correct
37 Correct 756 ms 101728 KB Output is correct
38 Correct 744 ms 103848 KB Output is correct
39 Correct 607 ms 99240 KB Output is correct
40 Correct 626 ms 102540 KB Output is correct
41 Correct 499 ms 55232 KB Output is correct
42 Correct 527 ms 55608 KB Output is correct
43 Correct 51 ms 5076 KB Output is correct
44 Correct 512 ms 55584 KB Output is correct
45 Correct 486 ms 55268 KB Output is correct
46 Correct 477 ms 55592 KB Output is correct
47 Correct 269 ms 44224 KB Output is correct
48 Correct 291 ms 47020 KB Output is correct
49 Correct 324 ms 51048 KB Output is correct
50 Correct 334 ms 49328 KB Output is correct
51 Correct 340 ms 53144 KB Output is correct
52 Correct 148 ms 21100 KB Output is correct
53 Correct 115 ms 14784 KB Output is correct
54 Correct 606 ms 49644 KB Output is correct
55 Correct 427 ms 44584 KB Output is correct
56 Correct 357 ms 39020 KB Output is correct
57 Correct 553 ms 51468 KB Output is correct
58 Correct 433 ms 43268 KB Output is correct
59 Correct 383 ms 35628 KB Output is correct
60 Correct 518 ms 50744 KB Output is correct
61 Correct 85 ms 22084 KB Output is correct
62 Correct 138 ms 22008 KB Output is correct
63 Correct 420 ms 37312 KB Output is correct
64 Correct 473 ms 43476 KB Output is correct
65 Correct 572 ms 50632 KB Output is correct
66 Correct 559 ms 55160 KB Output is correct
67 Correct 177 ms 8588 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 3 ms 1116 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 4 ms 1116 KB Output is correct
11 Correct 3 ms 600 KB Output is correct
12 Correct 5 ms 1044 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 668 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 860 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 2 ms 600 KB Output is correct
25 Correct 2 ms 860 KB Output is correct
26 Correct 2 ms 744 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1211 ms 102620 KB Output is correct
32 Correct 51 ms 6168 KB Output is correct
33 Correct 1209 ms 103104 KB Output is correct
34 Correct 1215 ms 97944 KB Output is correct
35 Correct 1206 ms 105488 KB Output is correct
36 Correct 1183 ms 107156 KB Output is correct
37 Correct 756 ms 101728 KB Output is correct
38 Correct 744 ms 103848 KB Output is correct
39 Correct 607 ms 99240 KB Output is correct
40 Correct 626 ms 102540 KB Output is correct
41 Correct 499 ms 55232 KB Output is correct
42 Correct 527 ms 55608 KB Output is correct
43 Correct 51 ms 5076 KB Output is correct
44 Correct 512 ms 55584 KB Output is correct
45 Correct 486 ms 55268 KB Output is correct
46 Correct 477 ms 55592 KB Output is correct
47 Correct 269 ms 44224 KB Output is correct
48 Correct 291 ms 47020 KB Output is correct
49 Correct 324 ms 51048 KB Output is correct
50 Correct 334 ms 49328 KB Output is correct
51 Correct 340 ms 53144 KB Output is correct
52 Correct 3088 ms 214320 KB Output is correct
53 Correct 1758 ms 238116 KB Output is correct
54 Correct 699 ms 105796 KB Output is correct
55 Correct 2602 ms 196684 KB Output is correct
56 Correct 1679 ms 242148 KB Output is correct
57 Correct 1667 ms 238612 KB Output is correct
58 Correct 654 ms 106072 KB Output is correct
59 Correct 2858 ms 197232 KB Output is correct
60 Correct 3069 ms 227512 KB Output is correct
61 Correct 2053 ms 239440 KB Output is correct
62 Correct 1525 ms 233548 KB Output is correct
63 Correct 1755 ms 237332 KB Output is correct
64 Execution timed out 5044 ms 325204 KB Time limit exceeded
65 Halted 0 ms 0 KB -