oj.uz

답안 #979781

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
979781 2024-05-11T11:03:44 Z Jarif_Rahman 새 집 (APIO18_new_home) C++17
57 / 100
 5000 ms 289040 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 = 6e6;

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];
map<int, map<int, 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()->first) S.update(i, x, inc);
    mx[inc][i][x]++;
}
void remove_from_mx(int i, int x, bool inc){
    mx[inc][i][x]--;
    if(mx[inc][i][x] == 0) mx[inc][i].erase(x);
    if(mx[inc][i].empty()) S.update(i, -1e9, inc);
    else if(x > mx[inc][i].rbegin()->first) S.update(i, mx[inc][i].rbegin()->first, 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;

    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

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 159312 KB Output is correct
2 Correct 27 ms 159312 KB Output is correct
3 Correct 26 ms 159320 KB Output is correct
4 Correct 26 ms 159324 KB Output is correct
5 Correct 31 ms 159268 KB Output is correct
6 Correct 31 ms 159568 KB Output is correct
7 Correct 28 ms 159328 KB Output is correct
8 Correct 27 ms 159456 KB Output is correct
9 Correct 28 ms 159324 KB Output is correct
10 Correct 29 ms 159404 KB Output is correct
11 Correct 28 ms 159348 KB Output is correct
12 Correct 29 ms 159444 KB Output is correct
13 Correct 29 ms 159320 KB Output is correct
14 Correct 27 ms 159316 KB Output is correct
15 Correct 27 ms 159324 KB Output is correct
16 Correct 27 ms 159364 KB Output is correct
17 Correct 27 ms 159320 KB Output is correct
18 Correct 28 ms 159324 KB Output is correct
19 Correct 29 ms 159572 KB Output is correct
20 Correct 28 ms 159320 KB Output is correct
21 Correct 27 ms 159324 KB Output is correct
22 Correct 30 ms 159364 KB Output is correct
23 Correct 27 ms 159312 KB Output is correct
24 Correct 27 ms 159320 KB Output is correct
25 Correct 28 ms 159344 KB Output is correct
26 Correct 28 ms 159316 KB Output is correct
27 Correct 27 ms 159316 KB Output is correct
28 Correct 27 ms 159424 KB Output is correct
29 Correct 28 ms 159264 KB Output is correct
30 Correct 27 ms 159324 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 159312 KB Output is correct
2 Correct 27 ms 159312 KB Output is correct
3 Correct 26 ms 159320 KB Output is correct
4 Correct 26 ms 159324 KB Output is correct
5 Correct 31 ms 159268 KB Output is correct
6 Correct 31 ms 159568 KB Output is correct
7 Correct 28 ms 159328 KB Output is correct
8 Correct 27 ms 159456 KB Output is correct
9 Correct 28 ms 159324 KB Output is correct
10 Correct 29 ms 159404 KB Output is correct
11 Correct 28 ms 159348 KB Output is correct
12 Correct 29 ms 159444 KB Output is correct
13 Correct 29 ms 159320 KB Output is correct
14 Correct 27 ms 159316 KB Output is correct
15 Correct 27 ms 159324 KB Output is correct
16 Correct 27 ms 159364 KB Output is correct
17 Correct 27 ms 159320 KB Output is correct
18 Correct 28 ms 159324 KB Output is correct
19 Correct 29 ms 159572 KB Output is correct
20 Correct 28 ms 159320 KB Output is correct
21 Correct 27 ms 159324 KB Output is correct
22 Correct 30 ms 159364 KB Output is correct
23 Correct 27 ms 159312 KB Output is correct
24 Correct 27 ms 159320 KB Output is correct
25 Correct 28 ms 159344 KB Output is correct
26 Correct 28 ms 159316 KB Output is correct
27 Correct 27 ms 159316 KB Output is correct
28 Correct 27 ms 159424 KB Output is correct
29 Correct 28 ms 159264 KB Output is correct
30 Correct 27 ms 159324 KB Output is correct
31 Correct 979 ms 197712 KB Output is correct
32 Correct 98 ms 164928 KB Output is correct
33 Correct 920 ms 196604 KB Output is correct
34 Correct 890 ms 195088 KB Output is correct
35 Correct 1080 ms 198236 KB Output is correct
36 Correct 1014 ms 198904 KB Output is correct
37 Correct 616 ms 195196 KB Output is correct
38 Correct 629 ms 195776 KB Output is correct
39 Correct 518 ms 193924 KB Output is correct
40 Correct 523 ms 194720 KB Output is correct
41 Correct 422 ms 179024 KB Output is correct
42 Correct 395 ms 178960 KB Output is correct
43 Correct 85 ms 166996 KB Output is correct
44 Correct 411 ms 179116 KB Output is correct
45 Correct 394 ms 179076 KB Output is correct
46 Correct 378 ms 179012 KB Output is correct
47 Correct 233 ms 175188 KB Output is correct
48 Correct 247 ms 176464 KB Output is correct
49 Correct 285 ms 178172 KB Output is correct
50 Correct 290 ms 176976 KB Output is correct
51 Correct 298 ms 178416 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2398 ms 261720 KB Output is correct
2 Correct 1377 ms 271676 KB Output is correct
3 Correct 526 ms 216920 KB Output is correct
4 Correct 2283 ms 254220 KB Output is correct
5 Correct 1453 ms 271320 KB Output is correct
6 Correct 1480 ms 271844 KB Output is correct
7 Correct 583 ms 216632 KB Output is correct
8 Correct 2587 ms 254180 KB Output is correct
9 Correct 2967 ms 267328 KB Output is correct
10 Correct 1810 ms 272400 KB Output is correct
11 Correct 1434 ms 269956 KB Output is correct
12 Correct 1640 ms 272000 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5028 ms 289040 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 159312 KB Output is correct
2 Correct 27 ms 159312 KB Output is correct
3 Correct 26 ms 159320 KB Output is correct
4 Correct 26 ms 159324 KB Output is correct
5 Correct 31 ms 159268 KB Output is correct
6 Correct 31 ms 159568 KB Output is correct
7 Correct 28 ms 159328 KB Output is correct
8 Correct 27 ms 159456 KB Output is correct
9 Correct 28 ms 159324 KB Output is correct
10 Correct 29 ms 159404 KB Output is correct
11 Correct 28 ms 159348 KB Output is correct
12 Correct 29 ms 159444 KB Output is correct
13 Correct 29 ms 159320 KB Output is correct
14 Correct 27 ms 159316 KB Output is correct
15 Correct 27 ms 159324 KB Output is correct
16 Correct 27 ms 159364 KB Output is correct
17 Correct 27 ms 159320 KB Output is correct
18 Correct 28 ms 159324 KB Output is correct
19 Correct 29 ms 159572 KB Output is correct
20 Correct 28 ms 159320 KB Output is correct
21 Correct 27 ms 159324 KB Output is correct
22 Correct 30 ms 159364 KB Output is correct
23 Correct 27 ms 159312 KB Output is correct
24 Correct 27 ms 159320 KB Output is correct
25 Correct 28 ms 159344 KB Output is correct
26 Correct 28 ms 159316 KB Output is correct
27 Correct 27 ms 159316 KB Output is correct
28 Correct 27 ms 159424 KB Output is correct
29 Correct 28 ms 159264 KB Output is correct
30 Correct 27 ms 159324 KB Output is correct
31 Correct 979 ms 197712 KB Output is correct
32 Correct 98 ms 164928 KB Output is correct
33 Correct 920 ms 196604 KB Output is correct
34 Correct 890 ms 195088 KB Output is correct
35 Correct 1080 ms 198236 KB Output is correct
36 Correct 1014 ms 198904 KB Output is correct
37 Correct 616 ms 195196 KB Output is correct
38 Correct 629 ms 195776 KB Output is correct
39 Correct 518 ms 193924 KB Output is correct
40 Correct 523 ms 194720 KB Output is correct
41 Correct 422 ms 179024 KB Output is correct
42 Correct 395 ms 178960 KB Output is correct
43 Correct 85 ms 166996 KB Output is correct
44 Correct 411 ms 179116 KB Output is correct
45 Correct 394 ms 179076 KB Output is correct
46 Correct 378 ms 179012 KB Output is correct
47 Correct 233 ms 175188 KB Output is correct
48 Correct 247 ms 176464 KB Output is correct
49 Correct 285 ms 178172 KB Output is correct
50 Correct 290 ms 176976 KB Output is correct
51 Correct 298 ms 178416 KB Output is correct
52 Correct 150 ms 172116 KB Output is correct
53 Correct 145 ms 166968 KB Output is correct
54 Correct 532 ms 181840 KB Output is correct
55 Correct 356 ms 176844 KB Output is correct
56 Correct 301 ms 175848 KB Output is correct
57 Correct 426 ms 178400 KB Output is correct
58 Correct 349 ms 174928 KB Output is correct
59 Correct 306 ms 174404 KB Output is correct
60 Correct 432 ms 177776 KB Output is correct
61 Correct 76 ms 166856 KB Output is correct
62 Correct 154 ms 172368 KB Output is correct
63 Correct 356 ms 176980 KB Output is correct
64 Correct 433 ms 178080 KB Output is correct
65 Correct 462 ms 178768 KB Output is correct
66 Correct 445 ms 179112 KB Output is correct
67 Correct 125 ms 164372 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 159312 KB Output is correct
2 Correct 27 ms 159312 KB Output is correct
3 Correct 26 ms 159320 KB Output is correct
4 Correct 26 ms 159324 KB Output is correct
5 Correct 31 ms 159268 KB Output is correct
6 Correct 31 ms 159568 KB Output is correct
7 Correct 28 ms 159328 KB Output is correct
8 Correct 27 ms 159456 KB Output is correct
9 Correct 28 ms 159324 KB Output is correct
10 Correct 29 ms 159404 KB Output is correct
11 Correct 28 ms 159348 KB Output is correct
12 Correct 29 ms 159444 KB Output is correct
13 Correct 29 ms 159320 KB Output is correct
14 Correct 27 ms 159316 KB Output is correct
15 Correct 27 ms 159324 KB Output is correct
16 Correct 27 ms 159364 KB Output is correct
17 Correct 27 ms 159320 KB Output is correct
18 Correct 28 ms 159324 KB Output is correct
19 Correct 29 ms 159572 KB Output is correct
20 Correct 28 ms 159320 KB Output is correct
21 Correct 27 ms 159324 KB Output is correct
22 Correct 30 ms 159364 KB Output is correct
23 Correct 27 ms 159312 KB Output is correct
24 Correct 27 ms 159320 KB Output is correct
25 Correct 28 ms 159344 KB Output is correct
26 Correct 28 ms 159316 KB Output is correct
27 Correct 27 ms 159316 KB Output is correct
28 Correct 27 ms 159424 KB Output is correct
29 Correct 28 ms 159264 KB Output is correct
30 Correct 27 ms 159324 KB Output is correct
31 Correct 979 ms 197712 KB Output is correct
32 Correct 98 ms 164928 KB Output is correct
33 Correct 920 ms 196604 KB Output is correct
34 Correct 890 ms 195088 KB Output is correct
35 Correct 1080 ms 198236 KB Output is correct
36 Correct 1014 ms 198904 KB Output is correct
37 Correct 616 ms 195196 KB Output is correct
38 Correct 629 ms 195776 KB Output is correct
39 Correct 518 ms 193924 KB Output is correct
40 Correct 523 ms 194720 KB Output is correct
41 Correct 422 ms 179024 KB Output is correct
42 Correct 395 ms 178960 KB Output is correct
43 Correct 85 ms 166996 KB Output is correct
44 Correct 411 ms 179116 KB Output is correct
45 Correct 394 ms 179076 KB Output is correct
46 Correct 378 ms 179012 KB Output is correct
47 Correct 233 ms 175188 KB Output is correct
48 Correct 247 ms 176464 KB Output is correct
49 Correct 285 ms 178172 KB Output is correct
50 Correct 290 ms 176976 KB Output is correct
51 Correct 298 ms 178416 KB Output is correct
52 Correct 2398 ms 261720 KB Output is correct
53 Correct 1377 ms 271676 KB Output is correct
54 Correct 526 ms 216920 KB Output is correct
55 Correct 2283 ms 254220 KB Output is correct
56 Correct 1453 ms 271320 KB Output is correct
57 Correct 1480 ms 271844 KB Output is correct
58 Correct 583 ms 216632 KB Output is correct
59 Correct 2587 ms 254180 KB Output is correct
60 Correct 2967 ms 267328 KB Output is correct
61 Correct 1810 ms 272400 KB Output is correct
62 Correct 1434 ms 269956 KB Output is correct
63 Correct 1640 ms 272000 KB Output is correct
64 Execution timed out 5028 ms 289040 KB Time limit exceeded
65 Halted 0 ms 0 KB -