oj.uz

답안 #979733

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
979733 2024-05-11T10:35:05 Z Jarif_Rahman 새 집 (APIO18_new_home) C++17
57 / 100
 5000 ms 399124 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 = 1e7;

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

# 결과 실행 시간 메모리 Grader output
1 Correct 107 ms 235088 KB Output is correct
2 Correct 63 ms 235212 KB Output is correct
3 Correct 65 ms 235036 KB Output is correct
4 Correct 63 ms 235132 KB Output is correct
5 Correct 69 ms 235092 KB Output is correct
6 Correct 65 ms 235348 KB Output is correct
7 Correct 66 ms 235368 KB Output is correct
8 Correct 66 ms 235352 KB Output is correct
9 Correct 64 ms 235344 KB Output is correct
10 Correct 66 ms 235520 KB Output is correct
11 Correct 65 ms 235312 KB Output is correct
12 Correct 66 ms 235284 KB Output is correct
13 Correct 63 ms 235344 KB Output is correct
14 Correct 72 ms 235656 KB Output is correct
15 Correct 66 ms 235348 KB Output is correct
16 Correct 65 ms 235416 KB Output is correct
17 Correct 73 ms 235416 KB Output is correct
18 Correct 71 ms 235344 KB Output is correct
19 Correct 113 ms 235224 KB Output is correct
20 Correct 88 ms 235268 KB Output is correct
21 Correct 81 ms 235200 KB Output is correct
22 Correct 88 ms 235344 KB Output is correct
23 Correct 71 ms 235344 KB Output is correct
24 Correct 67 ms 235576 KB Output is correct
25 Correct 67 ms 235332 KB Output is correct
26 Correct 69 ms 235372 KB Output is correct
27 Correct 62 ms 235252 KB Output is correct
28 Correct 66 ms 235372 KB Output is correct
29 Correct 69 ms 235356 KB Output is correct
30 Correct 66 ms 235232 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 107 ms 235088 KB Output is correct
2 Correct 63 ms 235212 KB Output is correct
3 Correct 65 ms 235036 KB Output is correct
4 Correct 63 ms 235132 KB Output is correct
5 Correct 69 ms 235092 KB Output is correct
6 Correct 65 ms 235348 KB Output is correct
7 Correct 66 ms 235368 KB Output is correct
8 Correct 66 ms 235352 KB Output is correct
9 Correct 64 ms 235344 KB Output is correct
10 Correct 66 ms 235520 KB Output is correct
11 Correct 65 ms 235312 KB Output is correct
12 Correct 66 ms 235284 KB Output is correct
13 Correct 63 ms 235344 KB Output is correct
14 Correct 72 ms 235656 KB Output is correct
15 Correct 66 ms 235348 KB Output is correct
16 Correct 65 ms 235416 KB Output is correct
17 Correct 73 ms 235416 KB Output is correct
18 Correct 71 ms 235344 KB Output is correct
19 Correct 113 ms 235224 KB Output is correct
20 Correct 88 ms 235268 KB Output is correct
21 Correct 81 ms 235200 KB Output is correct
22 Correct 88 ms 235344 KB Output is correct
23 Correct 71 ms 235344 KB Output is correct
24 Correct 67 ms 235576 KB Output is correct
25 Correct 67 ms 235332 KB Output is correct
26 Correct 69 ms 235372 KB Output is correct
27 Correct 62 ms 235252 KB Output is correct
28 Correct 66 ms 235372 KB Output is correct
29 Correct 69 ms 235356 KB Output is correct
30 Correct 66 ms 235232 KB Output is correct
31 Correct 1290 ms 283076 KB Output is correct
32 Correct 136 ms 240168 KB Output is correct
33 Correct 1213 ms 277668 KB Output is correct
34 Correct 1262 ms 275912 KB Output is correct
35 Correct 1254 ms 284152 KB Output is correct
36 Correct 1225 ms 284752 KB Output is correct
37 Correct 787 ms 275580 KB Output is correct
38 Correct 788 ms 276060 KB Output is correct
39 Correct 581 ms 274548 KB Output is correct
40 Correct 637 ms 275360 KB Output is correct
41 Correct 526 ms 259488 KB Output is correct
42 Correct 533 ms 259664 KB Output is correct
43 Correct 111 ms 241360 KB Output is correct
44 Correct 515 ms 259516 KB Output is correct
45 Correct 533 ms 259532 KB Output is correct
46 Correct 499 ms 259528 KB Output is correct
47 Correct 294 ms 255084 KB Output is correct
48 Correct 308 ms 256372 KB Output is correct
49 Correct 337 ms 258028 KB Output is correct
50 Correct 347 ms 257404 KB Output is correct
51 Correct 350 ms 258412 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2839 ms 373992 KB Output is correct
2 Correct 1619 ms 377124 KB Output is correct
3 Correct 729 ms 352708 KB Output is correct
4 Correct 2699 ms 370364 KB Output is correct
5 Correct 1542 ms 376492 KB Output is correct
6 Correct 1628 ms 378288 KB Output is correct
7 Correct 748 ms 352764 KB Output is correct
8 Correct 2835 ms 370340 KB Output is correct
9 Correct 2978 ms 376608 KB Output is correct
10 Correct 1986 ms 378188 KB Output is correct
11 Correct 1451 ms 374684 KB Output is correct
12 Correct 1681 ms 377088 KB Output is correct

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 107 ms 235088 KB Output is correct
2 Correct 63 ms 235212 KB Output is correct
3 Correct 65 ms 235036 KB Output is correct
4 Correct 63 ms 235132 KB Output is correct
5 Correct 69 ms 235092 KB Output is correct
6 Correct 65 ms 235348 KB Output is correct
7 Correct 66 ms 235368 KB Output is correct
8 Correct 66 ms 235352 KB Output is correct
9 Correct 64 ms 235344 KB Output is correct
10 Correct 66 ms 235520 KB Output is correct
11 Correct 65 ms 235312 KB Output is correct
12 Correct 66 ms 235284 KB Output is correct
13 Correct 63 ms 235344 KB Output is correct
14 Correct 72 ms 235656 KB Output is correct
15 Correct 66 ms 235348 KB Output is correct
16 Correct 65 ms 235416 KB Output is correct
17 Correct 73 ms 235416 KB Output is correct
18 Correct 71 ms 235344 KB Output is correct
19 Correct 113 ms 235224 KB Output is correct
20 Correct 88 ms 235268 KB Output is correct
21 Correct 81 ms 235200 KB Output is correct
22 Correct 88 ms 235344 KB Output is correct
23 Correct 71 ms 235344 KB Output is correct
24 Correct 67 ms 235576 KB Output is correct
25 Correct 67 ms 235332 KB Output is correct
26 Correct 69 ms 235372 KB Output is correct
27 Correct 62 ms 235252 KB Output is correct
28 Correct 66 ms 235372 KB Output is correct
29 Correct 69 ms 235356 KB Output is correct
30 Correct 66 ms 235232 KB Output is correct
31 Correct 1290 ms 283076 KB Output is correct
32 Correct 136 ms 240168 KB Output is correct
33 Correct 1213 ms 277668 KB Output is correct
34 Correct 1262 ms 275912 KB Output is correct
35 Correct 1254 ms 284152 KB Output is correct
36 Correct 1225 ms 284752 KB Output is correct
37 Correct 787 ms 275580 KB Output is correct
38 Correct 788 ms 276060 KB Output is correct
39 Correct 581 ms 274548 KB Output is correct
40 Correct 637 ms 275360 KB Output is correct
41 Correct 526 ms 259488 KB Output is correct
42 Correct 533 ms 259664 KB Output is correct
43 Correct 111 ms 241360 KB Output is correct
44 Correct 515 ms 259516 KB Output is correct
45 Correct 533 ms 259532 KB Output is correct
46 Correct 499 ms 259528 KB Output is correct
47 Correct 294 ms 255084 KB Output is correct
48 Correct 308 ms 256372 KB Output is correct
49 Correct 337 ms 258028 KB Output is correct
50 Correct 347 ms 257404 KB Output is correct
51 Correct 350 ms 258412 KB Output is correct
52 Correct 165 ms 258620 KB Output is correct
53 Correct 156 ms 252332 KB Output is correct
54 Correct 548 ms 264868 KB Output is correct
55 Correct 398 ms 260548 KB Output is correct
56 Correct 336 ms 260604 KB Output is correct
57 Correct 455 ms 259928 KB Output is correct
58 Correct 382 ms 258104 KB Output is correct
59 Correct 342 ms 257728 KB Output is correct
60 Correct 455 ms 259260 KB Output is correct
61 Correct 126 ms 258496 KB Output is correct
62 Correct 192 ms 259260 KB Output is correct
63 Correct 350 ms 260288 KB Output is correct
64 Correct 446 ms 260416 KB Output is correct
65 Correct 539 ms 260976 KB Output is correct
66 Correct 525 ms 259516 KB Output is correct
67 Correct 188 ms 244240 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 107 ms 235088 KB Output is correct
2 Correct 63 ms 235212 KB Output is correct
3 Correct 65 ms 235036 KB Output is correct
4 Correct 63 ms 235132 KB Output is correct
5 Correct 69 ms 235092 KB Output is correct
6 Correct 65 ms 235348 KB Output is correct
7 Correct 66 ms 235368 KB Output is correct
8 Correct 66 ms 235352 KB Output is correct
9 Correct 64 ms 235344 KB Output is correct
10 Correct 66 ms 235520 KB Output is correct
11 Correct 65 ms 235312 KB Output is correct
12 Correct 66 ms 235284 KB Output is correct
13 Correct 63 ms 235344 KB Output is correct
14 Correct 72 ms 235656 KB Output is correct
15 Correct 66 ms 235348 KB Output is correct
16 Correct 65 ms 235416 KB Output is correct
17 Correct 73 ms 235416 KB Output is correct
18 Correct 71 ms 235344 KB Output is correct
19 Correct 113 ms 235224 KB Output is correct
20 Correct 88 ms 235268 KB Output is correct
21 Correct 81 ms 235200 KB Output is correct
22 Correct 88 ms 235344 KB Output is correct
23 Correct 71 ms 235344 KB Output is correct
24 Correct 67 ms 235576 KB Output is correct
25 Correct 67 ms 235332 KB Output is correct
26 Correct 69 ms 235372 KB Output is correct
27 Correct 62 ms 235252 KB Output is correct
28 Correct 66 ms 235372 KB Output is correct
29 Correct 69 ms 235356 KB Output is correct
30 Correct 66 ms 235232 KB Output is correct
31 Correct 1290 ms 283076 KB Output is correct
32 Correct 136 ms 240168 KB Output is correct
33 Correct 1213 ms 277668 KB Output is correct
34 Correct 1262 ms 275912 KB Output is correct
35 Correct 1254 ms 284152 KB Output is correct
36 Correct 1225 ms 284752 KB Output is correct
37 Correct 787 ms 275580 KB Output is correct
38 Correct 788 ms 276060 KB Output is correct
39 Correct 581 ms 274548 KB Output is correct
40 Correct 637 ms 275360 KB Output is correct
41 Correct 526 ms 259488 KB Output is correct
42 Correct 533 ms 259664 KB Output is correct
43 Correct 111 ms 241360 KB Output is correct
44 Correct 515 ms 259516 KB Output is correct
45 Correct 533 ms 259532 KB Output is correct
46 Correct 499 ms 259528 KB Output is correct
47 Correct 294 ms 255084 KB Output is correct
48 Correct 308 ms 256372 KB Output is correct
49 Correct 337 ms 258028 KB Output is correct
50 Correct 347 ms 257404 KB Output is correct
51 Correct 350 ms 258412 KB Output is correct
52 Correct 2839 ms 373992 KB Output is correct
53 Correct 1619 ms 377124 KB Output is correct
54 Correct 729 ms 352708 KB Output is correct
55 Correct 2699 ms 370364 KB Output is correct
56 Correct 1542 ms 376492 KB Output is correct
57 Correct 1628 ms 378288 KB Output is correct
58 Correct 748 ms 352764 KB Output is correct
59 Correct 2835 ms 370340 KB Output is correct
60 Correct 2978 ms 376608 KB Output is correct
61 Correct 1986 ms 378188 KB Output is correct
62 Correct 1451 ms 374684 KB Output is correct
63 Correct 1681 ms 377088 KB Output is correct
64 Execution timed out 5024 ms 399124 KB Time limit exceeded
65 Halted 0 ms 0 KB -