oj.uz

Submission #979735

# Submission time Handle Problem Language Result Execution time Memory
979735 2024-05-11T10:37:01 Z Jarif_Rahman New Home (APIO18_new_home) C++17
57 / 100
 3064 ms 471896 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 = 4e6;

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);
    }
}Nodes[lim];

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

struct sparse_segtree{
    Node* root = newNode();
    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 = newNode();
            update(i, nd->l, a, m, x, inc);
        }
        else{
             if(nd->r == nullptr) nd->r = newNode();
             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 17 ms 94296 KB Output is correct
2 Correct 16 ms 94300 KB Output is correct
3 Correct 16 ms 94396 KB Output is correct
4 Correct 16 ms 94300 KB Output is correct
5 Correct 17 ms 94420 KB Output is correct
6 Correct 18 ms 94556 KB Output is correct
7 Correct 16 ms 94300 KB Output is correct
8 Correct 17 ms 94400 KB Output is correct
9 Correct 16 ms 94300 KB Output is correct
10 Correct 18 ms 94600 KB Output is correct
11 Correct 17 ms 94676 KB Output is correct
12 Correct 18 ms 94556 KB Output is correct
13 Correct 17 ms 94400 KB Output is correct
14 Correct 18 ms 94440 KB Output is correct
15 Correct 17 ms 94556 KB Output is correct
16 Correct 17 ms 94556 KB Output is correct
17 Correct 17 ms 94816 KB Output is correct
18 Correct 17 ms 94296 KB Output is correct
19 Correct 18 ms 94428 KB Output is correct
20 Correct 17 ms 94468 KB Output is correct
21 Correct 19 ms 94300 KB Output is correct
22 Correct 17 ms 94420 KB Output is correct
23 Correct 17 ms 94300 KB Output is correct
24 Correct 17 ms 94300 KB Output is correct
25 Correct 17 ms 94300 KB Output is correct
26 Correct 18 ms 94356 KB Output is correct
27 Correct 17 ms 94300 KB Output is correct
28 Correct 17 ms 94296 KB Output is correct
29 Correct 17 ms 94296 KB Output is correct
30 Correct 17 ms 94296 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 94296 KB Output is correct
2 Correct 16 ms 94300 KB Output is correct
3 Correct 16 ms 94396 KB Output is correct
4 Correct 16 ms 94300 KB Output is correct
5 Correct 17 ms 94420 KB Output is correct
6 Correct 18 ms 94556 KB Output is correct
7 Correct 16 ms 94300 KB Output is correct
8 Correct 17 ms 94400 KB Output is correct
9 Correct 16 ms 94300 KB Output is correct
10 Correct 18 ms 94600 KB Output is correct
11 Correct 17 ms 94676 KB Output is correct
12 Correct 18 ms 94556 KB Output is correct
13 Correct 17 ms 94400 KB Output is correct
14 Correct 18 ms 94440 KB Output is correct
15 Correct 17 ms 94556 KB Output is correct
16 Correct 17 ms 94556 KB Output is correct
17 Correct 17 ms 94816 KB Output is correct
18 Correct 17 ms 94296 KB Output is correct
19 Correct 18 ms 94428 KB Output is correct
20 Correct 17 ms 94468 KB Output is correct
21 Correct 19 ms 94300 KB Output is correct
22 Correct 17 ms 94420 KB Output is correct
23 Correct 17 ms 94300 KB Output is correct
24 Correct 17 ms 94300 KB Output is correct
25 Correct 17 ms 94300 KB Output is correct
26 Correct 18 ms 94356 KB Output is correct
27 Correct 17 ms 94300 KB Output is correct
28 Correct 17 ms 94296 KB Output is correct
29 Correct 17 ms 94296 KB Output is correct
30 Correct 17 ms 94296 KB Output is correct
31 Correct 1098 ms 139492 KB Output is correct
32 Correct 71 ms 98516 KB Output is correct
33 Correct 991 ms 134612 KB Output is correct
34 Correct 1034 ms 131992 KB Output is correct
35 Correct 1038 ms 140988 KB Output is correct
36 Correct 1046 ms 142080 KB Output is correct
37 Correct 668 ms 132648 KB Output is correct
38 Correct 653 ms 132288 KB Output is correct
39 Correct 524 ms 131008 KB Output is correct
40 Correct 546 ms 131508 KB Output is correct
41 Correct 441 ms 115760 KB Output is correct
42 Correct 454 ms 115468 KB Output is correct
43 Correct 65 ms 98760 KB Output is correct
44 Correct 456 ms 115816 KB Output is correct
45 Correct 449 ms 115796 KB Output is correct
46 Correct 401 ms 115904 KB Output is correct
47 Correct 242 ms 112184 KB Output is correct
48 Correct 267 ms 113876 KB Output is correct
49 Correct 295 ms 114244 KB Output is correct
50 Correct 327 ms 113704 KB Output is correct
51 Correct 308 ms 115780 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2807 ms 221156 KB Output is correct
2 Correct 1607 ms 223980 KB Output is correct
3 Correct 719 ms 198376 KB Output is correct
4 Correct 2399 ms 216756 KB Output is correct
5 Correct 1507 ms 224108 KB Output is correct
6 Correct 1499 ms 223872 KB Output is correct
7 Correct 666 ms 199828 KB Output is correct
8 Correct 2598 ms 217900 KB Output is correct
9 Correct 3064 ms 223740 KB Output is correct
10 Correct 2015 ms 224508 KB Output is correct
11 Correct 1475 ms 223120 KB Output is correct
12 Correct 1620 ms 224076 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 2013 ms 471896 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 94296 KB Output is correct
2 Correct 16 ms 94300 KB Output is correct
3 Correct 16 ms 94396 KB Output is correct
4 Correct 16 ms 94300 KB Output is correct
5 Correct 17 ms 94420 KB Output is correct
6 Correct 18 ms 94556 KB Output is correct
7 Correct 16 ms 94300 KB Output is correct
8 Correct 17 ms 94400 KB Output is correct
9 Correct 16 ms 94300 KB Output is correct
10 Correct 18 ms 94600 KB Output is correct
11 Correct 17 ms 94676 KB Output is correct
12 Correct 18 ms 94556 KB Output is correct
13 Correct 17 ms 94400 KB Output is correct
14 Correct 18 ms 94440 KB Output is correct
15 Correct 17 ms 94556 KB Output is correct
16 Correct 17 ms 94556 KB Output is correct
17 Correct 17 ms 94816 KB Output is correct
18 Correct 17 ms 94296 KB Output is correct
19 Correct 18 ms 94428 KB Output is correct
20 Correct 17 ms 94468 KB Output is correct
21 Correct 19 ms 94300 KB Output is correct
22 Correct 17 ms 94420 KB Output is correct
23 Correct 17 ms 94300 KB Output is correct
24 Correct 17 ms 94300 KB Output is correct
25 Correct 17 ms 94300 KB Output is correct
26 Correct 18 ms 94356 KB Output is correct
27 Correct 17 ms 94300 KB Output is correct
28 Correct 17 ms 94296 KB Output is correct
29 Correct 17 ms 94296 KB Output is correct
30 Correct 17 ms 94296 KB Output is correct
31 Correct 1098 ms 139492 KB Output is correct
32 Correct 71 ms 98516 KB Output is correct
33 Correct 991 ms 134612 KB Output is correct
34 Correct 1034 ms 131992 KB Output is correct
35 Correct 1038 ms 140988 KB Output is correct
36 Correct 1046 ms 142080 KB Output is correct
37 Correct 668 ms 132648 KB Output is correct
38 Correct 653 ms 132288 KB Output is correct
39 Correct 524 ms 131008 KB Output is correct
40 Correct 546 ms 131508 KB Output is correct
41 Correct 441 ms 115760 KB Output is correct
42 Correct 454 ms 115468 KB Output is correct
43 Correct 65 ms 98760 KB Output is correct
44 Correct 456 ms 115816 KB Output is correct
45 Correct 449 ms 115796 KB Output is correct
46 Correct 401 ms 115904 KB Output is correct
47 Correct 242 ms 112184 KB Output is correct
48 Correct 267 ms 113876 KB Output is correct
49 Correct 295 ms 114244 KB Output is correct
50 Correct 327 ms 113704 KB Output is correct
51 Correct 308 ms 115780 KB Output is correct
52 Correct 152 ms 114940 KB Output is correct
53 Correct 121 ms 109760 KB Output is correct
54 Correct 526 ms 120768 KB Output is correct
55 Correct 368 ms 115512 KB Output is correct
56 Correct 285 ms 116288 KB Output is correct
57 Correct 449 ms 116728 KB Output is correct
58 Correct 374 ms 113972 KB Output is correct
59 Correct 295 ms 114108 KB Output is correct
60 Correct 475 ms 115160 KB Output is correct
61 Correct 98 ms 115660 KB Output is correct
62 Correct 139 ms 115356 KB Output is correct
63 Correct 372 ms 117932 KB Output is correct
64 Correct 433 ms 116336 KB Output is correct
65 Correct 456 ms 115976 KB Output is correct
66 Correct 468 ms 115992 KB Output is correct
67 Correct 176 ms 102212 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 94296 KB Output is correct
2 Correct 16 ms 94300 KB Output is correct
3 Correct 16 ms 94396 KB Output is correct
4 Correct 16 ms 94300 KB Output is correct
5 Correct 17 ms 94420 KB Output is correct
6 Correct 18 ms 94556 KB Output is correct
7 Correct 16 ms 94300 KB Output is correct
8 Correct 17 ms 94400 KB Output is correct
9 Correct 16 ms 94300 KB Output is correct
10 Correct 18 ms 94600 KB Output is correct
11 Correct 17 ms 94676 KB Output is correct
12 Correct 18 ms 94556 KB Output is correct
13 Correct 17 ms 94400 KB Output is correct
14 Correct 18 ms 94440 KB Output is correct
15 Correct 17 ms 94556 KB Output is correct
16 Correct 17 ms 94556 KB Output is correct
17 Correct 17 ms 94816 KB Output is correct
18 Correct 17 ms 94296 KB Output is correct
19 Correct 18 ms 94428 KB Output is correct
20 Correct 17 ms 94468 KB Output is correct
21 Correct 19 ms 94300 KB Output is correct
22 Correct 17 ms 94420 KB Output is correct
23 Correct 17 ms 94300 KB Output is correct
24 Correct 17 ms 94300 KB Output is correct
25 Correct 17 ms 94300 KB Output is correct
26 Correct 18 ms 94356 KB Output is correct
27 Correct 17 ms 94300 KB Output is correct
28 Correct 17 ms 94296 KB Output is correct
29 Correct 17 ms 94296 KB Output is correct
30 Correct 17 ms 94296 KB Output is correct
31 Correct 1098 ms 139492 KB Output is correct
32 Correct 71 ms 98516 KB Output is correct
33 Correct 991 ms 134612 KB Output is correct
34 Correct 1034 ms 131992 KB Output is correct
35 Correct 1038 ms 140988 KB Output is correct
36 Correct 1046 ms 142080 KB Output is correct
37 Correct 668 ms 132648 KB Output is correct
38 Correct 653 ms 132288 KB Output is correct
39 Correct 524 ms 131008 KB Output is correct
40 Correct 546 ms 131508 KB Output is correct
41 Correct 441 ms 115760 KB Output is correct
42 Correct 454 ms 115468 KB Output is correct
43 Correct 65 ms 98760 KB Output is correct
44 Correct 456 ms 115816 KB Output is correct
45 Correct 449 ms 115796 KB Output is correct
46 Correct 401 ms 115904 KB Output is correct
47 Correct 242 ms 112184 KB Output is correct
48 Correct 267 ms 113876 KB Output is correct
49 Correct 295 ms 114244 KB Output is correct
50 Correct 327 ms 113704 KB Output is correct
51 Correct 308 ms 115780 KB Output is correct
52 Correct 2807 ms 221156 KB Output is correct
53 Correct 1607 ms 223980 KB Output is correct
54 Correct 719 ms 198376 KB Output is correct
55 Correct 2399 ms 216756 KB Output is correct
56 Correct 1507 ms 224108 KB Output is correct
57 Correct 1499 ms 223872 KB Output is correct
58 Correct 666 ms 199828 KB Output is correct
59 Correct 2598 ms 217900 KB Output is correct
60 Correct 3064 ms 223740 KB Output is correct
61 Correct 2015 ms 224508 KB Output is correct
62 Correct 1475 ms 223120 KB Output is correct
63 Correct 1620 ms 224076 KB Output is correct
64 Runtime error 2013 ms 471896 KB Execution killed with signal 11
65 Halted 0 ms 0 KB -