oj.uz

답안 #1100421

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1100421 2024-10-13T19:34:58 Z vladilius 새 집 (APIO18_new_home) C++17
47 / 100
 1701 ms 528968 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define pb push_back
#define ff first
#define ss second
#define arr3 array<int, 3>
const int inf = 1e8;
const int inff = inf + 1;
const int N = 1e6;

struct IT{
    struct node{
        int m1, m2, i, l, r;
        node(){
            l = r = 0;
            m1 = inff; m2 = 0;
        }
    };
    multiset<int> s1[N], s2[N];
    vector<node> all;
    int cc, cc1;
    void init(){
        all.pb(node());
        all.pb(node());
        cc = 1; cc1 = 0;
    }
    int nw(int tl, int tr){
        all.pb(node()); cc++;
        if (tl == tr){
            cc1++;
            all[cc].i = cc1;
        }
        return cc;
    }
    void recalc(int v){
        all[v].m1 = inff; all[v].m2 = 0;
        if (all[v].l){
            all[v].m1 = min(all[v].m1, all[all[v].l].m1);
            all[v].m2 = max(all[v].m2, all[all[v].l].m2);
        }
        if (all[v].r){
            all[v].m1 = min(all[v].m1, all[all[v].r].m1);
            all[v].m2 = max(all[v].m2, all[all[v].r].m2);
        }
    }
    void add(int v, int tl, int tr, int p, int x, bool t){
        if (tl == tr){
            if (t){
                s2[all[v].i].insert(x);
                all[v].m2 = max(all[v].m2, x);
            }
            else{
                s1[all[v].i].insert(x);
                all[v].m1 = min(all[v].m1, x);
            }
            return;
        }
        int tm = (tl + tr) / 2;
        if (p <= tm){
            if (!all[v].l) all[v].l = nw(tl, tm);
            add(all[v].l, tl, tm, p, x, t);
        }
        else {
            if (!all[v].r) all[v].r = nw(tm + 1, tr);
            add(all[v].r, tm + 1, tr, p, x, t);
        }
        recalc(v);
    }
    void add(int l, int r){
        if (l == 1){
            add(1, 1, inf, l, r + 1, 1);
            return;
        }
        if (r == inf){
            add(1, 1, inf, inf, l - 1, 0);
            return;
        }
        int m = (l + r) / 2;
        if (l <= m) add(1, 1, inf, m, l - 1, 0);
        if (m < r) add(1, 1, inf, m + 1, r + 1, 1);
    }
    void rem(int v, int tl, int tr, int p, int x, bool t){
        if (tl == tr){
            if (t){
                s2[all[v].i].erase(s2[all[v].i].find(x));
                all[v].m2 = s2[all[v].i].empty() ? 0 : *prev(s2[all[v].i].end());
            }
            else{
                s1[all[v].i].erase(s1[all[v].i].find(x));
                all[v].m1 = s1[all[v].i].empty() ? inff : *s1[all[v].i].begin();
            }
            return;
        }
        int tm = (tl + tr) / 2;
        if (p <= tm){
            rem(all[v].l, tl, tm, p, x, t);
        }
        else {
            rem(all[v].r, tm + 1, tr, p, x, t);
        }
        recalc(v);
    }
    void rem(int l, int r){
        if (l == 1){
            rem(1, 1, inf, l, r + 1, 1);
            return;
        }
        if (r == inf){
            rem(1, 1, inf, inf, l - 1, 0);
            return;
        }
        int m = (l + r) / 2;
        if (l <= m) rem(1, 1, inf, m, l - 1, 0);
        if (m < r) rem(1, 1, inf, m + 1, r + 1, 1);
    }
    int get(int v, int tl, int tr, int l, int r, bool t){
        if (l > tr || r < tl) return inff * !t;
        if (l <= tl && tr <= r) return (t) ? all[v].m2 : all[v].m1;
        int tm = (tl + tr) / 2, out = inff * !t;
        if (all[v].l){
            if (t){
                out = max(out, get(all[v].l, tl, tm, l, r, t));
            }
            else {
                out = min(out, get(all[v].l, tl, tm, l, r, t));
            }
        }
        if (all[v].r){
            if (t){
                out = max(out, get(all[v].r, tm + 1, tr, l, r, t));
            }
            else {
                out = min(out, get(all[v].r, tm + 1, tr, l, r, t));
            }
        }
        return out;
    }
    pii get(int x){
        return {get(1, 1, inf, x, inf, 0), get(1, 1, inf, 1, x, 1)};
    }
};
 
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n, k, q; cin>>n>>k>>q;
    vector<int> x(n + 1), t(n + 1), a(n + 1), b(n + 1);
    for (int i = 1; i <= n; i++){
        cin>>x[i]>>t[i]>>a[i]>>b[i];
    }
    vector<int> xq(q + 1), yq(q + 1);
    for (int i = 1; i <= q; i++){
        cin>>xq[i]>>yq[i];
    }
 
    vector<arr3> mp;
    for (int i = 1; i <= n; i++){
        mp.pb({a[i], 1, i});
        if (b[i] < inf) mp.pb({b[i] + 1, 2, i});
    }
    for (int i = 1; i <= q; i++){
        mp.pb({yq[i], i + 2, xq[i]});
    }
    
    auto cmp = [&](arr3 x, arr3 y){
        if (x[0] == y[0]){
            return x[1] < y[1];
        }
        return x[0] < y[0];
    };
    
    sort(mp.begin(), mp.end(), cmp);
    
    vector<int> out(q + 1), cnt(k + 1);
    multiset<int> st[k + 1];
    int df = 0, l, r;
    IT T; T.init();
    for (auto [X, tt, i]: mp){
        if (tt == 1){
            df += !cnt[t[i]];
            cnt[t[i]]++;
            if (cnt[t[i]] == 1){
                if (1 < x[i]) T.add(1, x[i] - 1);
                if (x[i] < inf) T.add(x[i] + 1, inf);
                st[t[i]].insert(x[i]);
                continue;
            }
            
            if (st[t[i]].find(x[i]) != st[t[i]].end()){
                st[t[i]].insert(x[i]);
                continue;
            }
            
            auto it = st[t[i]].upper_bound(x[i]);
            if (it == st[t[i]].end()) r = inf;
            else r = (*it) - 1;
            if (it == st[t[i]].begin()) l = 1;
            else l = *prev(it) + 1;
            
            if (l <= r) T.rem(l, r);
            if (l < x[i]) T.add(l, x[i] - 1);
            if (x[i] < r) T.add(x[i] + 1, r);
            
            st[t[i]].insert(x[i]);
        }
        else if (tt == 2){
            cnt[t[i]]--;
            df -= !cnt[t[i]];
            
            if (st[t[i]].count(x[i]) > 1){
                st[t[i]].erase(st[t[i]].find(x[i]));
                continue;
            }
            
            auto it = st[t[i]].find(x[i]);
            
            if (it == st[t[i]].begin()) l = 1;
            else l = *prev(it) + 1;
            if (it == prev(st[t[i]].end())) r = inf;
            else r = *next(it) - 1;
            
            if (l < x[i]) T.rem(l, x[i] - 1);
            if (x[i] < r) T.rem(x[i] + 1, r);
            
            if (cnt[t[i]]) T.add(l, r);
            st[t[i]].erase(it);
        }
        else {
            int ii = tt - 2;
            if (df < k){
                out[ii] = -1;
                continue;
            }
            
            auto [l, r] = T.get(i);
            if (l != inff) out[ii] = max(out[ii], i - l);
            if (r != 0) out[ii] = max(out[ii], r - i);
        }
    }
    
    for (int i = 1; i <= q; i++){
        cout<<out[i]<<"\n";
    }
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 94280 KB Output is correct
2 Correct 94 ms 94160 KB Output is correct
3 Correct 94 ms 94280 KB Output is correct
4 Correct 89 ms 94280 KB Output is correct
5 Correct 92 ms 94284 KB Output is correct
6 Correct 105 ms 95132 KB Output is correct
7 Correct 88 ms 94276 KB Output is correct
8 Correct 99 ms 94728 KB Output is correct
9 Correct 88 ms 94280 KB Output is correct
10 Correct 107 ms 95128 KB Output is correct
11 Correct 100 ms 94628 KB Output is correct
12 Correct 101 ms 94876 KB Output is correct
13 Correct 101 ms 94520 KB Output is correct
14 Correct 87 ms 94568 KB Output is correct
15 Correct 91 ms 94536 KB Output is correct
16 Correct 91 ms 94536 KB Output is correct
17 Correct 94 ms 94740 KB Output is correct
18 Correct 78 ms 94536 KB Output is correct
19 Correct 87 ms 94536 KB Output is correct
20 Correct 92 ms 94832 KB Output is correct
21 Correct 86 ms 94448 KB Output is correct
22 Correct 84 ms 94280 KB Output is correct
23 Correct 88 ms 94532 KB Output is correct
24 Correct 86 ms 94528 KB Output is correct
25 Correct 81 ms 94776 KB Output is correct
26 Correct 88 ms 94816 KB Output is correct
27 Correct 96 ms 94416 KB Output is correct
28 Correct 90 ms 94536 KB Output is correct
29 Correct 87 ms 94536 KB Output is correct
30 Correct 85 ms 94548 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 94280 KB Output is correct
2 Correct 94 ms 94160 KB Output is correct
3 Correct 94 ms 94280 KB Output is correct
4 Correct 89 ms 94280 KB Output is correct
5 Correct 92 ms 94284 KB Output is correct
6 Correct 105 ms 95132 KB Output is correct
7 Correct 88 ms 94276 KB Output is correct
8 Correct 99 ms 94728 KB Output is correct
9 Correct 88 ms 94280 KB Output is correct
10 Correct 107 ms 95128 KB Output is correct
11 Correct 100 ms 94628 KB Output is correct
12 Correct 101 ms 94876 KB Output is correct
13 Correct 101 ms 94520 KB Output is correct
14 Correct 87 ms 94568 KB Output is correct
15 Correct 91 ms 94536 KB Output is correct
16 Correct 91 ms 94536 KB Output is correct
17 Correct 94 ms 94740 KB Output is correct
18 Correct 78 ms 94536 KB Output is correct
19 Correct 87 ms 94536 KB Output is correct
20 Correct 92 ms 94832 KB Output is correct
21 Correct 86 ms 94448 KB Output is correct
22 Correct 84 ms 94280 KB Output is correct
23 Correct 88 ms 94532 KB Output is correct
24 Correct 86 ms 94528 KB Output is correct
25 Correct 81 ms 94776 KB Output is correct
26 Correct 88 ms 94816 KB Output is correct
27 Correct 96 ms 94416 KB Output is correct
28 Correct 90 ms 94536 KB Output is correct
29 Correct 87 ms 94536 KB Output is correct
30 Correct 85 ms 94548 KB Output is correct
31 Correct 611 ms 148120 KB Output is correct
32 Correct 368 ms 99516 KB Output is correct
33 Correct 562 ms 144264 KB Output is correct
34 Correct 566 ms 144172 KB Output is correct
35 Correct 636 ms 148116 KB Output is correct
36 Correct 650 ms 190612 KB Output is correct
37 Correct 487 ms 143772 KB Output is correct
38 Correct 500 ms 143764 KB Output is correct
39 Correct 413 ms 143696 KB Output is correct
40 Correct 426 ms 143768 KB Output is correct
41 Correct 344 ms 143772 KB Output is correct
42 Correct 363 ms 143780 KB Output is correct
43 Correct 134 ms 100720 KB Output is correct
44 Correct 382 ms 143620 KB Output is correct
45 Correct 363 ms 143768 KB Output is correct
46 Correct 354 ms 143680 KB Output is correct
47 Correct 274 ms 123044 KB Output is correct
48 Correct 273 ms 123044 KB Output is correct
49 Correct 302 ms 123048 KB Output is correct
50 Correct 292 ms 123224 KB Output is correct
51 Correct 306 ms 123048 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1512 ms 234696 KB Output is correct
2 Runtime error 1670 ms 512320 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1701 ms 528968 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 94280 KB Output is correct
2 Correct 94 ms 94160 KB Output is correct
3 Correct 94 ms 94280 KB Output is correct
4 Correct 89 ms 94280 KB Output is correct
5 Correct 92 ms 94284 KB Output is correct
6 Correct 105 ms 95132 KB Output is correct
7 Correct 88 ms 94276 KB Output is correct
8 Correct 99 ms 94728 KB Output is correct
9 Correct 88 ms 94280 KB Output is correct
10 Correct 107 ms 95128 KB Output is correct
11 Correct 100 ms 94628 KB Output is correct
12 Correct 101 ms 94876 KB Output is correct
13 Correct 101 ms 94520 KB Output is correct
14 Correct 87 ms 94568 KB Output is correct
15 Correct 91 ms 94536 KB Output is correct
16 Correct 91 ms 94536 KB Output is correct
17 Correct 94 ms 94740 KB Output is correct
18 Correct 78 ms 94536 KB Output is correct
19 Correct 87 ms 94536 KB Output is correct
20 Correct 92 ms 94832 KB Output is correct
21 Correct 86 ms 94448 KB Output is correct
22 Correct 84 ms 94280 KB Output is correct
23 Correct 88 ms 94532 KB Output is correct
24 Correct 86 ms 94528 KB Output is correct
25 Correct 81 ms 94776 KB Output is correct
26 Correct 88 ms 94816 KB Output is correct
27 Correct 96 ms 94416 KB Output is correct
28 Correct 90 ms 94536 KB Output is correct
29 Correct 87 ms 94536 KB Output is correct
30 Correct 85 ms 94548 KB Output is correct
31 Correct 611 ms 148120 KB Output is correct
32 Correct 368 ms 99516 KB Output is correct
33 Correct 562 ms 144264 KB Output is correct
34 Correct 566 ms 144172 KB Output is correct
35 Correct 636 ms 148116 KB Output is correct
36 Correct 650 ms 190612 KB Output is correct
37 Correct 487 ms 143772 KB Output is correct
38 Correct 500 ms 143764 KB Output is correct
39 Correct 413 ms 143696 KB Output is correct
40 Correct 426 ms 143768 KB Output is correct
41 Correct 344 ms 143772 KB Output is correct
42 Correct 363 ms 143780 KB Output is correct
43 Correct 134 ms 100720 KB Output is correct
44 Correct 382 ms 143620 KB Output is correct
45 Correct 363 ms 143768 KB Output is correct
46 Correct 354 ms 143680 KB Output is correct
47 Correct 274 ms 123044 KB Output is correct
48 Correct 273 ms 123044 KB Output is correct
49 Correct 302 ms 123048 KB Output is correct
50 Correct 292 ms 123224 KB Output is correct
51 Correct 306 ms 123048 KB Output is correct
52 Correct 259 ms 109748 KB Output is correct
53 Correct 245 ms 104380 KB Output is correct
54 Correct 376 ms 128428 KB Output is correct
55 Correct 356 ms 127136 KB Output is correct
56 Correct 320 ms 128932 KB Output is correct
57 Correct 348 ms 124244 KB Output is correct
58 Correct 333 ms 124580 KB Output is correct
59 Correct 305 ms 126472 KB Output is correct
60 Correct 375 ms 123556 KB Output is correct
61 Correct 147 ms 106684 KB Output is correct
62 Correct 235 ms 109748 KB Output is correct
63 Correct 368 ms 117424 KB Output is correct
64 Correct 372 ms 127400 KB Output is correct
65 Correct 388 ms 124324 KB Output is correct
66 Correct 372 ms 123308 KB Output is correct
67 Correct 329 ms 100532 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 94280 KB Output is correct
2 Correct 94 ms 94160 KB Output is correct
3 Correct 94 ms 94280 KB Output is correct
4 Correct 89 ms 94280 KB Output is correct
5 Correct 92 ms 94284 KB Output is correct
6 Correct 105 ms 95132 KB Output is correct
7 Correct 88 ms 94276 KB Output is correct
8 Correct 99 ms 94728 KB Output is correct
9 Correct 88 ms 94280 KB Output is correct
10 Correct 107 ms 95128 KB Output is correct
11 Correct 100 ms 94628 KB Output is correct
12 Correct 101 ms 94876 KB Output is correct
13 Correct 101 ms 94520 KB Output is correct
14 Correct 87 ms 94568 KB Output is correct
15 Correct 91 ms 94536 KB Output is correct
16 Correct 91 ms 94536 KB Output is correct
17 Correct 94 ms 94740 KB Output is correct
18 Correct 78 ms 94536 KB Output is correct
19 Correct 87 ms 94536 KB Output is correct
20 Correct 92 ms 94832 KB Output is correct
21 Correct 86 ms 94448 KB Output is correct
22 Correct 84 ms 94280 KB Output is correct
23 Correct 88 ms 94532 KB Output is correct
24 Correct 86 ms 94528 KB Output is correct
25 Correct 81 ms 94776 KB Output is correct
26 Correct 88 ms 94816 KB Output is correct
27 Correct 96 ms 94416 KB Output is correct
28 Correct 90 ms 94536 KB Output is correct
29 Correct 87 ms 94536 KB Output is correct
30 Correct 85 ms 94548 KB Output is correct
31 Correct 611 ms 148120 KB Output is correct
32 Correct 368 ms 99516 KB Output is correct
33 Correct 562 ms 144264 KB Output is correct
34 Correct 566 ms 144172 KB Output is correct
35 Correct 636 ms 148116 KB Output is correct
36 Correct 650 ms 190612 KB Output is correct
37 Correct 487 ms 143772 KB Output is correct
38 Correct 500 ms 143764 KB Output is correct
39 Correct 413 ms 143696 KB Output is correct
40 Correct 426 ms 143768 KB Output is correct
41 Correct 344 ms 143772 KB Output is correct
42 Correct 363 ms 143780 KB Output is correct
43 Correct 134 ms 100720 KB Output is correct
44 Correct 382 ms 143620 KB Output is correct
45 Correct 363 ms 143768 KB Output is correct
46 Correct 354 ms 143680 KB Output is correct
47 Correct 274 ms 123044 KB Output is correct
48 Correct 273 ms 123044 KB Output is correct
49 Correct 302 ms 123048 KB Output is correct
50 Correct 292 ms 123224 KB Output is correct
51 Correct 306 ms 123048 KB Output is correct
52 Correct 1512 ms 234696 KB Output is correct
53 Runtime error 1670 ms 512320 KB Execution killed with signal 11
54 Halted 0 ms 0 KB -