oj.uz

답안 #1100420

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1100420 2024-10-13T19:34:16 Z vladilius 새 집 (APIO18_new_home) C++17
47 / 100
 1217 ms 370828 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 = 6e5 + 2;

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 50 ms 56644 KB Output is correct
2 Correct 51 ms 56652 KB Output is correct
3 Correct 50 ms 56648 KB Output is correct
4 Correct 50 ms 56648 KB Output is correct
5 Correct 51 ms 56648 KB Output is correct
6 Correct 60 ms 57496 KB Output is correct
7 Correct 60 ms 56720 KB Output is correct
8 Correct 56 ms 57160 KB Output is correct
9 Correct 49 ms 56904 KB Output is correct
10 Correct 61 ms 57496 KB Output is correct
11 Correct 50 ms 56904 KB Output is correct
12 Correct 57 ms 57200 KB Output is correct
13 Correct 58 ms 56840 KB Output is correct
14 Correct 52 ms 57024 KB Output is correct
15 Correct 51 ms 56936 KB Output is correct
16 Correct 62 ms 56904 KB Output is correct
17 Correct 58 ms 57136 KB Output is correct
18 Correct 49 ms 56904 KB Output is correct
19 Correct 48 ms 57016 KB Output is correct
20 Correct 48 ms 57144 KB Output is correct
21 Correct 60 ms 56648 KB Output is correct
22 Correct 54 ms 56884 KB Output is correct
23 Correct 60 ms 56904 KB Output is correct
24 Correct 53 ms 57144 KB Output is correct
25 Correct 51 ms 57144 KB Output is correct
26 Correct 54 ms 57148 KB Output is correct
27 Correct 56 ms 56756 KB Output is correct
28 Correct 51 ms 56904 KB Output is correct
29 Correct 55 ms 56904 KB Output is correct
30 Correct 59 ms 56904 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 56644 KB Output is correct
2 Correct 51 ms 56652 KB Output is correct
3 Correct 50 ms 56648 KB Output is correct
4 Correct 50 ms 56648 KB Output is correct
5 Correct 51 ms 56648 KB Output is correct
6 Correct 60 ms 57496 KB Output is correct
7 Correct 60 ms 56720 KB Output is correct
8 Correct 56 ms 57160 KB Output is correct
9 Correct 49 ms 56904 KB Output is correct
10 Correct 61 ms 57496 KB Output is correct
11 Correct 50 ms 56904 KB Output is correct
12 Correct 57 ms 57200 KB Output is correct
13 Correct 58 ms 56840 KB Output is correct
14 Correct 52 ms 57024 KB Output is correct
15 Correct 51 ms 56936 KB Output is correct
16 Correct 62 ms 56904 KB Output is correct
17 Correct 58 ms 57136 KB Output is correct
18 Correct 49 ms 56904 KB Output is correct
19 Correct 48 ms 57016 KB Output is correct
20 Correct 48 ms 57144 KB Output is correct
21 Correct 60 ms 56648 KB Output is correct
22 Correct 54 ms 56884 KB Output is correct
23 Correct 60 ms 56904 KB Output is correct
24 Correct 53 ms 57144 KB Output is correct
25 Correct 51 ms 57144 KB Output is correct
26 Correct 54 ms 57148 KB Output is correct
27 Correct 56 ms 56756 KB Output is correct
28 Correct 51 ms 56904 KB Output is correct
29 Correct 55 ms 56904 KB Output is correct
30 Correct 59 ms 56904 KB Output is correct
31 Correct 532 ms 110484 KB Output is correct
32 Correct 332 ms 61844 KB Output is correct
33 Correct 527 ms 106652 KB Output is correct
34 Correct 528 ms 106656 KB Output is correct
35 Correct 599 ms 112276 KB Output is correct
36 Correct 603 ms 153100 KB Output is correct
37 Correct 440 ms 106140 KB Output is correct
38 Correct 438 ms 106164 KB Output is correct
39 Correct 381 ms 106012 KB Output is correct
40 Correct 397 ms 106144 KB Output is correct
41 Correct 333 ms 106148 KB Output is correct
42 Correct 311 ms 106136 KB Output is correct
43 Correct 95 ms 63168 KB Output is correct
44 Correct 319 ms 106140 KB Output is correct
45 Correct 320 ms 106112 KB Output is correct
46 Correct 310 ms 106172 KB Output is correct
47 Correct 244 ms 85412 KB Output is correct
48 Correct 244 ms 85416 KB Output is correct
49 Correct 275 ms 85544 KB Output is correct
50 Correct 254 ms 85764 KB Output is correct
51 Correct 266 ms 85616 KB Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 56644 KB Output is correct
2 Correct 51 ms 56652 KB Output is correct
3 Correct 50 ms 56648 KB Output is correct
4 Correct 50 ms 56648 KB Output is correct
5 Correct 51 ms 56648 KB Output is correct
6 Correct 60 ms 57496 KB Output is correct
7 Correct 60 ms 56720 KB Output is correct
8 Correct 56 ms 57160 KB Output is correct
9 Correct 49 ms 56904 KB Output is correct
10 Correct 61 ms 57496 KB Output is correct
11 Correct 50 ms 56904 KB Output is correct
12 Correct 57 ms 57200 KB Output is correct
13 Correct 58 ms 56840 KB Output is correct
14 Correct 52 ms 57024 KB Output is correct
15 Correct 51 ms 56936 KB Output is correct
16 Correct 62 ms 56904 KB Output is correct
17 Correct 58 ms 57136 KB Output is correct
18 Correct 49 ms 56904 KB Output is correct
19 Correct 48 ms 57016 KB Output is correct
20 Correct 48 ms 57144 KB Output is correct
21 Correct 60 ms 56648 KB Output is correct
22 Correct 54 ms 56884 KB Output is correct
23 Correct 60 ms 56904 KB Output is correct
24 Correct 53 ms 57144 KB Output is correct
25 Correct 51 ms 57144 KB Output is correct
26 Correct 54 ms 57148 KB Output is correct
27 Correct 56 ms 56756 KB Output is correct
28 Correct 51 ms 56904 KB Output is correct
29 Correct 55 ms 56904 KB Output is correct
30 Correct 59 ms 56904 KB Output is correct
31 Correct 532 ms 110484 KB Output is correct
32 Correct 332 ms 61844 KB Output is correct
33 Correct 527 ms 106652 KB Output is correct
34 Correct 528 ms 106656 KB Output is correct
35 Correct 599 ms 112276 KB Output is correct
36 Correct 603 ms 153100 KB Output is correct
37 Correct 440 ms 106140 KB Output is correct
38 Correct 438 ms 106164 KB Output is correct
39 Correct 381 ms 106012 KB Output is correct
40 Correct 397 ms 106144 KB Output is correct
41 Correct 333 ms 106148 KB Output is correct
42 Correct 311 ms 106136 KB Output is correct
43 Correct 95 ms 63168 KB Output is correct
44 Correct 319 ms 106140 KB Output is correct
45 Correct 320 ms 106112 KB Output is correct
46 Correct 310 ms 106172 KB Output is correct
47 Correct 244 ms 85412 KB Output is correct
48 Correct 244 ms 85416 KB Output is correct
49 Correct 275 ms 85544 KB Output is correct
50 Correct 254 ms 85764 KB Output is correct
51 Correct 266 ms 85616 KB Output is correct
52 Correct 214 ms 72116 KB Output is correct
53 Correct 214 ms 66736 KB Output is correct
54 Correct 368 ms 90832 KB Output is correct
55 Correct 330 ms 89444 KB Output is correct
56 Correct 309 ms 91300 KB Output is correct
57 Correct 354 ms 86872 KB Output is correct
58 Correct 325 ms 87060 KB Output is correct
59 Correct 280 ms 88852 KB Output is correct
60 Correct 356 ms 86040 KB Output is correct
61 Correct 122 ms 69056 KB Output is correct
62 Correct 226 ms 72372 KB Output is correct
63 Correct 322 ms 79776 KB Output is correct
64 Correct 348 ms 89768 KB Output is correct
65 Correct 361 ms 86576 KB Output is correct
66 Correct 344 ms 85668 KB Output is correct
67 Correct 291 ms 62900 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 56644 KB Output is correct
2 Correct 51 ms 56652 KB Output is correct
3 Correct 50 ms 56648 KB Output is correct
4 Correct 50 ms 56648 KB Output is correct
5 Correct 51 ms 56648 KB Output is correct
6 Correct 60 ms 57496 KB Output is correct
7 Correct 60 ms 56720 KB Output is correct
8 Correct 56 ms 57160 KB Output is correct
9 Correct 49 ms 56904 KB Output is correct
10 Correct 61 ms 57496 KB Output is correct
11 Correct 50 ms 56904 KB Output is correct
12 Correct 57 ms 57200 KB Output is correct
13 Correct 58 ms 56840 KB Output is correct
14 Correct 52 ms 57024 KB Output is correct
15 Correct 51 ms 56936 KB Output is correct
16 Correct 62 ms 56904 KB Output is correct
17 Correct 58 ms 57136 KB Output is correct
18 Correct 49 ms 56904 KB Output is correct
19 Correct 48 ms 57016 KB Output is correct
20 Correct 48 ms 57144 KB Output is correct
21 Correct 60 ms 56648 KB Output is correct
22 Correct 54 ms 56884 KB Output is correct
23 Correct 60 ms 56904 KB Output is correct
24 Correct 53 ms 57144 KB Output is correct
25 Correct 51 ms 57144 KB Output is correct
26 Correct 54 ms 57148 KB Output is correct
27 Correct 56 ms 56756 KB Output is correct
28 Correct 51 ms 56904 KB Output is correct
29 Correct 55 ms 56904 KB Output is correct
30 Correct 59 ms 56904 KB Output is correct
31 Correct 532 ms 110484 KB Output is correct
32 Correct 332 ms 61844 KB Output is correct
33 Correct 527 ms 106652 KB Output is correct
34 Correct 528 ms 106656 KB Output is correct
35 Correct 599 ms 112276 KB Output is correct
36 Correct 603 ms 153100 KB Output is correct
37 Correct 440 ms 106140 KB Output is correct
38 Correct 438 ms 106164 KB Output is correct
39 Correct 381 ms 106012 KB Output is correct
40 Correct 397 ms 106144 KB Output is correct
41 Correct 333 ms 106148 KB Output is correct
42 Correct 311 ms 106136 KB Output is correct
43 Correct 95 ms 63168 KB Output is correct
44 Correct 319 ms 106140 KB Output is correct
45 Correct 320 ms 106112 KB Output is correct
46 Correct 310 ms 106172 KB Output is correct
47 Correct 244 ms 85412 KB Output is correct
48 Correct 244 ms 85416 KB Output is correct
49 Correct 275 ms 85544 KB Output is correct
50 Correct 254 ms 85764 KB Output is correct
51 Correct 266 ms 85616 KB Output is correct
52 Runtime error 1217 ms 370828 KB Execution killed with signal 11
53 Halted 0 ms 0 KB -