oj.uz

답안 #979784

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

    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 75 ms 159260 KB Output is correct
2 Correct 27 ms 159328 KB Output is correct
3 Correct 31 ms 159316 KB Output is correct
4 Correct 28 ms 159400 KB Output is correct
5 Correct 27 ms 159316 KB Output is correct
6 Correct 30 ms 159392 KB Output is correct
7 Correct 28 ms 159332 KB Output is correct
8 Correct 28 ms 159316 KB Output is correct
9 Correct 31 ms 159860 KB Output is correct
10 Correct 29 ms 159504 KB Output is correct
11 Correct 27 ms 159324 KB Output is correct
12 Correct 32 ms 159352 KB Output is correct
13 Correct 27 ms 159316 KB Output is correct
14 Correct 27 ms 159392 KB Output is correct
15 Correct 27 ms 159504 KB Output is correct
16 Correct 27 ms 159324 KB Output is correct
17 Correct 27 ms 159300 KB Output is correct
18 Correct 27 ms 159316 KB Output is correct
19 Correct 27 ms 159312 KB Output is correct
20 Correct 28 ms 159320 KB Output is correct
21 Correct 27 ms 159324 KB Output is correct
22 Correct 27 ms 159324 KB Output is correct
23 Correct 26 ms 159276 KB Output is correct
24 Correct 27 ms 159476 KB Output is correct
25 Correct 28 ms 159452 KB Output is correct
26 Correct 28 ms 159316 KB Output is correct
27 Correct 28 ms 159320 KB Output is correct
28 Correct 30 ms 159436 KB Output is correct
29 Correct 26 ms 159484 KB Output is correct
30 Correct 30 ms 159312 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 159260 KB Output is correct
2 Correct 27 ms 159328 KB Output is correct
3 Correct 31 ms 159316 KB Output is correct
4 Correct 28 ms 159400 KB Output is correct
5 Correct 27 ms 159316 KB Output is correct
6 Correct 30 ms 159392 KB Output is correct
7 Correct 28 ms 159332 KB Output is correct
8 Correct 28 ms 159316 KB Output is correct
9 Correct 31 ms 159860 KB Output is correct
10 Correct 29 ms 159504 KB Output is correct
11 Correct 27 ms 159324 KB Output is correct
12 Correct 32 ms 159352 KB Output is correct
13 Correct 27 ms 159316 KB Output is correct
14 Correct 27 ms 159392 KB Output is correct
15 Correct 27 ms 159504 KB Output is correct
16 Correct 27 ms 159324 KB Output is correct
17 Correct 27 ms 159300 KB Output is correct
18 Correct 27 ms 159316 KB Output is correct
19 Correct 27 ms 159312 KB Output is correct
20 Correct 28 ms 159320 KB Output is correct
21 Correct 27 ms 159324 KB Output is correct
22 Correct 27 ms 159324 KB Output is correct
23 Correct 26 ms 159276 KB Output is correct
24 Correct 27 ms 159476 KB Output is correct
25 Correct 28 ms 159452 KB Output is correct
26 Correct 28 ms 159316 KB Output is correct
27 Correct 28 ms 159320 KB Output is correct
28 Correct 30 ms 159436 KB Output is correct
29 Correct 26 ms 159484 KB Output is correct
30 Correct 30 ms 159312 KB Output is correct
31 Correct 975 ms 197808 KB Output is correct
32 Correct 112 ms 166056 KB Output is correct
33 Correct 897 ms 196456 KB Output is correct
34 Correct 884 ms 194936 KB Output is correct
35 Correct 1031 ms 198696 KB Output is correct
36 Correct 946 ms 198668 KB Output is correct
37 Correct 609 ms 195344 KB Output is correct
38 Correct 593 ms 195712 KB Output is correct
39 Correct 491 ms 194064 KB Output is correct
40 Correct 495 ms 195108 KB Output is correct
41 Correct 412 ms 179172 KB Output is correct
42 Correct 364 ms 179008 KB Output is correct
43 Correct 104 ms 169812 KB Output is correct
44 Correct 378 ms 179064 KB Output is correct
45 Correct 433 ms 179152 KB Output is correct
46 Correct 363 ms 179252 KB Output is correct
47 Correct 232 ms 175164 KB Output is correct
48 Correct 246 ms 176720 KB Output is correct
49 Correct 264 ms 177864 KB Output is correct
50 Correct 267 ms 177080 KB Output is correct
51 Correct 281 ms 178344 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2368 ms 261824 KB Output is correct
2 Correct 1359 ms 271908 KB Output is correct
3 Correct 574 ms 216804 KB Output is correct
4 Correct 2060 ms 254384 KB Output is correct
5 Correct 1259 ms 271360 KB Output is correct
6 Correct 1308 ms 271668 KB Output is correct
7 Correct 537 ms 216920 KB Output is correct
8 Correct 2116 ms 254344 KB Output is correct
9 Correct 2393 ms 267520 KB Output is correct
10 Correct 1522 ms 272248 KB Output is correct
11 Correct 1277 ms 269912 KB Output is correct
12 Correct 1419 ms 271660 KB Output is correct

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 159260 KB Output is correct
2 Correct 27 ms 159328 KB Output is correct
3 Correct 31 ms 159316 KB Output is correct
4 Correct 28 ms 159400 KB Output is correct
5 Correct 27 ms 159316 KB Output is correct
6 Correct 30 ms 159392 KB Output is correct
7 Correct 28 ms 159332 KB Output is correct
8 Correct 28 ms 159316 KB Output is correct
9 Correct 31 ms 159860 KB Output is correct
10 Correct 29 ms 159504 KB Output is correct
11 Correct 27 ms 159324 KB Output is correct
12 Correct 32 ms 159352 KB Output is correct
13 Correct 27 ms 159316 KB Output is correct
14 Correct 27 ms 159392 KB Output is correct
15 Correct 27 ms 159504 KB Output is correct
16 Correct 27 ms 159324 KB Output is correct
17 Correct 27 ms 159300 KB Output is correct
18 Correct 27 ms 159316 KB Output is correct
19 Correct 27 ms 159312 KB Output is correct
20 Correct 28 ms 159320 KB Output is correct
21 Correct 27 ms 159324 KB Output is correct
22 Correct 27 ms 159324 KB Output is correct
23 Correct 26 ms 159276 KB Output is correct
24 Correct 27 ms 159476 KB Output is correct
25 Correct 28 ms 159452 KB Output is correct
26 Correct 28 ms 159316 KB Output is correct
27 Correct 28 ms 159320 KB Output is correct
28 Correct 30 ms 159436 KB Output is correct
29 Correct 26 ms 159484 KB Output is correct
30 Correct 30 ms 159312 KB Output is correct
31 Correct 975 ms 197808 KB Output is correct
32 Correct 112 ms 166056 KB Output is correct
33 Correct 897 ms 196456 KB Output is correct
34 Correct 884 ms 194936 KB Output is correct
35 Correct 1031 ms 198696 KB Output is correct
36 Correct 946 ms 198668 KB Output is correct
37 Correct 609 ms 195344 KB Output is correct
38 Correct 593 ms 195712 KB Output is correct
39 Correct 491 ms 194064 KB Output is correct
40 Correct 495 ms 195108 KB Output is correct
41 Correct 412 ms 179172 KB Output is correct
42 Correct 364 ms 179008 KB Output is correct
43 Correct 104 ms 169812 KB Output is correct
44 Correct 378 ms 179064 KB Output is correct
45 Correct 433 ms 179152 KB Output is correct
46 Correct 363 ms 179252 KB Output is correct
47 Correct 232 ms 175164 KB Output is correct
48 Correct 246 ms 176720 KB Output is correct
49 Correct 264 ms 177864 KB Output is correct
50 Correct 267 ms 177080 KB Output is correct
51 Correct 281 ms 178344 KB Output is correct
52 Correct 133 ms 172192 KB Output is correct
53 Correct 120 ms 166992 KB Output is correct
54 Correct 412 ms 181876 KB Output is correct
55 Correct 336 ms 177132 KB Output is correct
56 Correct 254 ms 175796 KB Output is correct
57 Correct 356 ms 178256 KB Output is correct
58 Correct 300 ms 175084 KB Output is correct
59 Correct 265 ms 174360 KB Output is correct
60 Correct 381 ms 177800 KB Output is correct
61 Correct 97 ms 172440 KB Output is correct
62 Correct 120 ms 172372 KB Output is correct
63 Correct 300 ms 176940 KB Output is correct
64 Correct 359 ms 178048 KB Output is correct
65 Correct 399 ms 178792 KB Output is correct
66 Correct 408 ms 179112 KB Output is correct
67 Correct 182 ms 165716 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 159260 KB Output is correct
2 Correct 27 ms 159328 KB Output is correct
3 Correct 31 ms 159316 KB Output is correct
4 Correct 28 ms 159400 KB Output is correct
5 Correct 27 ms 159316 KB Output is correct
6 Correct 30 ms 159392 KB Output is correct
7 Correct 28 ms 159332 KB Output is correct
8 Correct 28 ms 159316 KB Output is correct
9 Correct 31 ms 159860 KB Output is correct
10 Correct 29 ms 159504 KB Output is correct
11 Correct 27 ms 159324 KB Output is correct
12 Correct 32 ms 159352 KB Output is correct
13 Correct 27 ms 159316 KB Output is correct
14 Correct 27 ms 159392 KB Output is correct
15 Correct 27 ms 159504 KB Output is correct
16 Correct 27 ms 159324 KB Output is correct
17 Correct 27 ms 159300 KB Output is correct
18 Correct 27 ms 159316 KB Output is correct
19 Correct 27 ms 159312 KB Output is correct
20 Correct 28 ms 159320 KB Output is correct
21 Correct 27 ms 159324 KB Output is correct
22 Correct 27 ms 159324 KB Output is correct
23 Correct 26 ms 159276 KB Output is correct
24 Correct 27 ms 159476 KB Output is correct
25 Correct 28 ms 159452 KB Output is correct
26 Correct 28 ms 159316 KB Output is correct
27 Correct 28 ms 159320 KB Output is correct
28 Correct 30 ms 159436 KB Output is correct
29 Correct 26 ms 159484 KB Output is correct
30 Correct 30 ms 159312 KB Output is correct
31 Correct 975 ms 197808 KB Output is correct
32 Correct 112 ms 166056 KB Output is correct
33 Correct 897 ms 196456 KB Output is correct
34 Correct 884 ms 194936 KB Output is correct
35 Correct 1031 ms 198696 KB Output is correct
36 Correct 946 ms 198668 KB Output is correct
37 Correct 609 ms 195344 KB Output is correct
38 Correct 593 ms 195712 KB Output is correct
39 Correct 491 ms 194064 KB Output is correct
40 Correct 495 ms 195108 KB Output is correct
41 Correct 412 ms 179172 KB Output is correct
42 Correct 364 ms 179008 KB Output is correct
43 Correct 104 ms 169812 KB Output is correct
44 Correct 378 ms 179064 KB Output is correct
45 Correct 433 ms 179152 KB Output is correct
46 Correct 363 ms 179252 KB Output is correct
47 Correct 232 ms 175164 KB Output is correct
48 Correct 246 ms 176720 KB Output is correct
49 Correct 264 ms 177864 KB Output is correct
50 Correct 267 ms 177080 KB Output is correct
51 Correct 281 ms 178344 KB Output is correct
52 Correct 2368 ms 261824 KB Output is correct
53 Correct 1359 ms 271908 KB Output is correct
54 Correct 574 ms 216804 KB Output is correct
55 Correct 2060 ms 254384 KB Output is correct
56 Correct 1259 ms 271360 KB Output is correct
57 Correct 1308 ms 271668 KB Output is correct
58 Correct 537 ms 216920 KB Output is correct
59 Correct 2116 ms 254344 KB Output is correct
60 Correct 2393 ms 267520 KB Output is correct
61 Correct 1522 ms 272248 KB Output is correct
62 Correct 1277 ms 269912 KB Output is correct
63 Correct 1419 ms 271660 KB Output is correct
64 Execution timed out 5035 ms 291704 KB Time limit exceeded
65 Halted 0 ms 0 KB -