oj.uz

Submission #979803

# Submission time Handle Problem Language Result Execution time Memory
979803 2024-05-11T11:46:35 Z Jarif_Rahman New Home (APIO18_new_home) C++17
80 / 100
 4520 ms 757592 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 = 8e6;

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<<=1;
    }
    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)>>1;
        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)>>1;
        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, N = 3e5;
tuple<int, int, int, int> queries[3*N];
multiset<int> stores[N];
unordered_map<int, multiset<int>> mx[2];
sparse_segtree S(L);
int cnt_t[N];
int nonzero = 0;
int ans[N];

void 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);
}
void 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);
};

void add(int t, int x){
    auto it = stores[t].insert(x);
    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))>>1;
        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)>>1;
        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))>>1;
        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)>>1;
        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))>>1;
        if(md > x) add_to_mx(md, md-x, true);
        add_to_mx(md+1, *next(it)-md-1, false);
    }
};
void remove(int t, int x){
    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))>>1;
        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)>>1;
        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))>>1;
        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)>>1;
        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))>>1;
        if(md > x) remove_from_mx(md, md-x, true);
        remove_from_mx(md+1, *next(it)-md-1, false);
    }
    stores[t].erase(it);
};

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

    int n, k, q; cin >> n >> k >> q;
    mx[0].reserve(n+q);
    mx[1].reserve(n+q);

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

    fill(cnt_t, cnt_t+k, 0);
    for(int qq = 0; qq < 2*n+q; qq++){
        auto [_, type, x, i] = queries[qq];
        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 i = 0; i < q; i++) cout << ans[i] << "\n";
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 206164 KB Output is correct
2 Correct 33 ms 206164 KB Output is correct
3 Correct 35 ms 206416 KB Output is correct
4 Correct 33 ms 206160 KB Output is correct
5 Correct 35 ms 206164 KB Output is correct
6 Correct 36 ms 206420 KB Output is correct
7 Correct 33 ms 206332 KB Output is correct
8 Correct 35 ms 206268 KB Output is correct
9 Correct 36 ms 206420 KB Output is correct
10 Correct 35 ms 206420 KB Output is correct
11 Correct 34 ms 206420 KB Output is correct
12 Correct 35 ms 206484 KB Output is correct
13 Correct 34 ms 206428 KB Output is correct
14 Correct 34 ms 206420 KB Output is correct
15 Correct 34 ms 206368 KB Output is correct
16 Correct 39 ms 206396 KB Output is correct
17 Correct 36 ms 206416 KB Output is correct
18 Correct 35 ms 206424 KB Output is correct
19 Correct 35 ms 206280 KB Output is correct
20 Correct 35 ms 206420 KB Output is correct
21 Correct 36 ms 206420 KB Output is correct
22 Correct 36 ms 206416 KB Output is correct
23 Correct 35 ms 206336 KB Output is correct
24 Correct 35 ms 206284 KB Output is correct
25 Correct 35 ms 206416 KB Output is correct
26 Correct 35 ms 206444 KB Output is correct
27 Correct 34 ms 206384 KB Output is correct
28 Correct 35 ms 206420 KB Output is correct
29 Correct 35 ms 206428 KB Output is correct
30 Correct 36 ms 206416 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 206164 KB Output is correct
2 Correct 33 ms 206164 KB Output is correct
3 Correct 35 ms 206416 KB Output is correct
4 Correct 33 ms 206160 KB Output is correct
5 Correct 35 ms 206164 KB Output is correct
6 Correct 36 ms 206420 KB Output is correct
7 Correct 33 ms 206332 KB Output is correct
8 Correct 35 ms 206268 KB Output is correct
9 Correct 36 ms 206420 KB Output is correct
10 Correct 35 ms 206420 KB Output is correct
11 Correct 34 ms 206420 KB Output is correct
12 Correct 35 ms 206484 KB Output is correct
13 Correct 34 ms 206428 KB Output is correct
14 Correct 34 ms 206420 KB Output is correct
15 Correct 34 ms 206368 KB Output is correct
16 Correct 39 ms 206396 KB Output is correct
17 Correct 36 ms 206416 KB Output is correct
18 Correct 35 ms 206424 KB Output is correct
19 Correct 35 ms 206280 KB Output is correct
20 Correct 35 ms 206420 KB Output is correct
21 Correct 36 ms 206420 KB Output is correct
22 Correct 36 ms 206416 KB Output is correct
23 Correct 35 ms 206336 KB Output is correct
24 Correct 35 ms 206284 KB Output is correct
25 Correct 35 ms 206416 KB Output is correct
26 Correct 35 ms 206444 KB Output is correct
27 Correct 34 ms 206384 KB Output is correct
28 Correct 35 ms 206420 KB Output is correct
29 Correct 35 ms 206428 KB Output is correct
30 Correct 36 ms 206416 KB Output is correct
31 Correct 738 ms 246160 KB Output is correct
32 Correct 119 ms 215632 KB Output is correct
33 Correct 689 ms 244628 KB Output is correct
34 Correct 650 ms 242836 KB Output is correct
35 Correct 735 ms 246932 KB Output is correct
36 Correct 763 ms 247092 KB Output is correct
37 Correct 486 ms 243164 KB Output is correct
38 Correct 501 ms 243812 KB Output is correct
39 Correct 387 ms 241816 KB Output is correct
40 Correct 418 ms 242568 KB Output is correct
41 Correct 267 ms 227308 KB Output is correct
42 Correct 254 ms 227324 KB Output is correct
43 Correct 118 ms 220244 KB Output is correct
44 Correct 265 ms 227524 KB Output is correct
45 Correct 260 ms 227304 KB Output is correct
46 Correct 248 ms 227188 KB Output is correct
47 Correct 178 ms 223644 KB Output is correct
48 Correct 186 ms 224596 KB Output is correct
49 Correct 201 ms 225872 KB Output is correct
50 Correct 207 ms 225556 KB Output is correct
51 Correct 210 ms 226388 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1855 ms 317900 KB Output is correct
2 Correct 1189 ms 325444 KB Output is correct
3 Correct 562 ms 280380 KB Output is correct
4 Correct 1634 ms 311668 KB Output is correct
5 Correct 1192 ms 324864 KB Output is correct
6 Correct 1181 ms 325204 KB Output is correct
7 Correct 555 ms 280372 KB Output is correct
8 Correct 1625 ms 311616 KB Output is correct
9 Correct 1844 ms 322428 KB Output is correct
10 Correct 1399 ms 326196 KB Output is correct
11 Correct 1097 ms 323664 KB Output is correct
12 Correct 1376 ms 325660 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3595 ms 342312 KB Output is correct
2 Correct 521 ms 259380 KB Output is correct
3 Correct 3320 ms 348828 KB Output is correct
4 Correct 809 ms 278324 KB Output is correct
5 Correct 2461 ms 319344 KB Output is correct
6 Correct 2287 ms 310480 KB Output is correct
7 Correct 2993 ms 348208 KB Output is correct
8 Correct 3231 ms 348712 KB Output is correct
9 Correct 750 ms 279604 KB Output is correct
10 Correct 2422 ms 318856 KB Output is correct
11 Correct 3138 ms 336744 KB Output is correct
12 Correct 3348 ms 349436 KB Output is correct
13 Correct 1559 ms 338508 KB Output is correct
14 Correct 1514 ms 339340 KB Output is correct
15 Correct 1732 ms 344496 KB Output is correct
16 Correct 2057 ms 344284 KB Output is correct
17 Correct 1868 ms 345132 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 206164 KB Output is correct
2 Correct 33 ms 206164 KB Output is correct
3 Correct 35 ms 206416 KB Output is correct
4 Correct 33 ms 206160 KB Output is correct
5 Correct 35 ms 206164 KB Output is correct
6 Correct 36 ms 206420 KB Output is correct
7 Correct 33 ms 206332 KB Output is correct
8 Correct 35 ms 206268 KB Output is correct
9 Correct 36 ms 206420 KB Output is correct
10 Correct 35 ms 206420 KB Output is correct
11 Correct 34 ms 206420 KB Output is correct
12 Correct 35 ms 206484 KB Output is correct
13 Correct 34 ms 206428 KB Output is correct
14 Correct 34 ms 206420 KB Output is correct
15 Correct 34 ms 206368 KB Output is correct
16 Correct 39 ms 206396 KB Output is correct
17 Correct 36 ms 206416 KB Output is correct
18 Correct 35 ms 206424 KB Output is correct
19 Correct 35 ms 206280 KB Output is correct
20 Correct 35 ms 206420 KB Output is correct
21 Correct 36 ms 206420 KB Output is correct
22 Correct 36 ms 206416 KB Output is correct
23 Correct 35 ms 206336 KB Output is correct
24 Correct 35 ms 206284 KB Output is correct
25 Correct 35 ms 206416 KB Output is correct
26 Correct 35 ms 206444 KB Output is correct
27 Correct 34 ms 206384 KB Output is correct
28 Correct 35 ms 206420 KB Output is correct
29 Correct 35 ms 206428 KB Output is correct
30 Correct 36 ms 206416 KB Output is correct
31 Correct 738 ms 246160 KB Output is correct
32 Correct 119 ms 215632 KB Output is correct
33 Correct 689 ms 244628 KB Output is correct
34 Correct 650 ms 242836 KB Output is correct
35 Correct 735 ms 246932 KB Output is correct
36 Correct 763 ms 247092 KB Output is correct
37 Correct 486 ms 243164 KB Output is correct
38 Correct 501 ms 243812 KB Output is correct
39 Correct 387 ms 241816 KB Output is correct
40 Correct 418 ms 242568 KB Output is correct
41 Correct 267 ms 227308 KB Output is correct
42 Correct 254 ms 227324 KB Output is correct
43 Correct 118 ms 220244 KB Output is correct
44 Correct 265 ms 227524 KB Output is correct
45 Correct 260 ms 227304 KB Output is correct
46 Correct 248 ms 227188 KB Output is correct
47 Correct 178 ms 223644 KB Output is correct
48 Correct 186 ms 224596 KB Output is correct
49 Correct 201 ms 225872 KB Output is correct
50 Correct 207 ms 225556 KB Output is correct
51 Correct 210 ms 226388 KB Output is correct
52 Correct 140 ms 222860 KB Output is correct
53 Correct 126 ms 217748 KB Output is correct
54 Correct 341 ms 230992 KB Output is correct
55 Correct 243 ms 226344 KB Output is correct
56 Correct 209 ms 225252 KB Output is correct
57 Correct 251 ms 226884 KB Output is correct
58 Correct 243 ms 224444 KB Output is correct
59 Correct 208 ms 224080 KB Output is correct
60 Correct 269 ms 226388 KB Output is correct
61 Correct 107 ms 222968 KB Output is correct
62 Correct 129 ms 222952 KB Output is correct
63 Correct 278 ms 227056 KB Output is correct
64 Correct 300 ms 227412 KB Output is correct
65 Correct 307 ms 227412 KB Output is correct
66 Correct 267 ms 227352 KB Output is correct
67 Correct 169 ms 215376 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 206164 KB Output is correct
2 Correct 33 ms 206164 KB Output is correct
3 Correct 35 ms 206416 KB Output is correct
4 Correct 33 ms 206160 KB Output is correct
5 Correct 35 ms 206164 KB Output is correct
6 Correct 36 ms 206420 KB Output is correct
7 Correct 33 ms 206332 KB Output is correct
8 Correct 35 ms 206268 KB Output is correct
9 Correct 36 ms 206420 KB Output is correct
10 Correct 35 ms 206420 KB Output is correct
11 Correct 34 ms 206420 KB Output is correct
12 Correct 35 ms 206484 KB Output is correct
13 Correct 34 ms 206428 KB Output is correct
14 Correct 34 ms 206420 KB Output is correct
15 Correct 34 ms 206368 KB Output is correct
16 Correct 39 ms 206396 KB Output is correct
17 Correct 36 ms 206416 KB Output is correct
18 Correct 35 ms 206424 KB Output is correct
19 Correct 35 ms 206280 KB Output is correct
20 Correct 35 ms 206420 KB Output is correct
21 Correct 36 ms 206420 KB Output is correct
22 Correct 36 ms 206416 KB Output is correct
23 Correct 35 ms 206336 KB Output is correct
24 Correct 35 ms 206284 KB Output is correct
25 Correct 35 ms 206416 KB Output is correct
26 Correct 35 ms 206444 KB Output is correct
27 Correct 34 ms 206384 KB Output is correct
28 Correct 35 ms 206420 KB Output is correct
29 Correct 35 ms 206428 KB Output is correct
30 Correct 36 ms 206416 KB Output is correct
31 Correct 738 ms 246160 KB Output is correct
32 Correct 119 ms 215632 KB Output is correct
33 Correct 689 ms 244628 KB Output is correct
34 Correct 650 ms 242836 KB Output is correct
35 Correct 735 ms 246932 KB Output is correct
36 Correct 763 ms 247092 KB Output is correct
37 Correct 486 ms 243164 KB Output is correct
38 Correct 501 ms 243812 KB Output is correct
39 Correct 387 ms 241816 KB Output is correct
40 Correct 418 ms 242568 KB Output is correct
41 Correct 267 ms 227308 KB Output is correct
42 Correct 254 ms 227324 KB Output is correct
43 Correct 118 ms 220244 KB Output is correct
44 Correct 265 ms 227524 KB Output is correct
45 Correct 260 ms 227304 KB Output is correct
46 Correct 248 ms 227188 KB Output is correct
47 Correct 178 ms 223644 KB Output is correct
48 Correct 186 ms 224596 KB Output is correct
49 Correct 201 ms 225872 KB Output is correct
50 Correct 207 ms 225556 KB Output is correct
51 Correct 210 ms 226388 KB Output is correct
52 Correct 1855 ms 317900 KB Output is correct
53 Correct 1189 ms 325444 KB Output is correct
54 Correct 562 ms 280380 KB Output is correct
55 Correct 1634 ms 311668 KB Output is correct
56 Correct 1192 ms 324864 KB Output is correct
57 Correct 1181 ms 325204 KB Output is correct
58 Correct 555 ms 280372 KB Output is correct
59 Correct 1625 ms 311616 KB Output is correct
60 Correct 1844 ms 322428 KB Output is correct
61 Correct 1399 ms 326196 KB Output is correct
62 Correct 1097 ms 323664 KB Output is correct
63 Correct 1376 ms 325660 KB Output is correct
64 Correct 3595 ms 342312 KB Output is correct
65 Correct 521 ms 259380 KB Output is correct
66 Correct 3320 ms 348828 KB Output is correct
67 Correct 809 ms 278324 KB Output is correct
68 Correct 2461 ms 319344 KB Output is correct
69 Correct 2287 ms 310480 KB Output is correct
70 Correct 2993 ms 348208 KB Output is correct
71 Correct 3231 ms 348712 KB Output is correct
72 Correct 750 ms 279604 KB Output is correct
73 Correct 2422 ms 318856 KB Output is correct
74 Correct 3138 ms 336744 KB Output is correct
75 Correct 3348 ms 349436 KB Output is correct
76 Correct 1559 ms 338508 KB Output is correct
77 Correct 1514 ms 339340 KB Output is correct
78 Correct 1732 ms 344496 KB Output is correct
79 Correct 2057 ms 344284 KB Output is correct
80 Correct 1868 ms 345132 KB Output is correct
81 Correct 140 ms 222860 KB Output is correct
82 Correct 126 ms 217748 KB Output is correct
83 Correct 341 ms 230992 KB Output is correct
84 Correct 243 ms 226344 KB Output is correct
85 Correct 209 ms 225252 KB Output is correct
86 Correct 251 ms 226884 KB Output is correct
87 Correct 243 ms 224444 KB Output is correct
88 Correct 208 ms 224080 KB Output is correct
89 Correct 269 ms 226388 KB Output is correct
90 Correct 107 ms 222968 KB Output is correct
91 Correct 129 ms 222952 KB Output is correct
92 Correct 278 ms 227056 KB Output is correct
93 Correct 300 ms 227412 KB Output is correct
94 Correct 307 ms 227412 KB Output is correct
95 Correct 267 ms 227352 KB Output is correct
96 Correct 169 ms 215376 KB Output is correct
97 Correct 852 ms 279380 KB Output is correct
98 Correct 492 ms 243040 KB Output is correct
99 Runtime error 4520 ms 757592 KB Execution killed with signal 11
100 Halted 0 ms 0 KB -