oj.uz

Submission #1100424

# Submission time Handle Problem Language Result Execution time Memory
1100424 2024-10-13T19:45:43 Z vladilius New Home (APIO18_new_home) C++17
57 / 100
 5000 ms 315780 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 = 2e6;

struct IT{
    struct node{
        int m1, m2, i, l, r;
        node(){
            l = r = 0;
            m1 = inff; m2 = 0;
        }
    };
    multiset<int> s[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){
                s[all[v].i].insert(x);
                all[v].m2 = max(all[v].m2, x);
            }
            else{
                s[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){
                s[all[v].i].erase(s[all[v].i].find(x));
                all[v].m2 = s[all[v].i].empty() ? 0 : *prev(s[all[v].i].end());
            }
            else{
                s[all[v].i].erase(s[all[v].i].find(x));
                all[v].m1 = s[all[v].i].empty() ? inff : *s[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

# Verdict Execution time Memory Grader output
1 Correct 84 ms 94284 KB Output is correct
2 Correct 89 ms 94204 KB Output is correct
3 Correct 96 ms 94276 KB Output is correct
4 Correct 91 ms 94284 KB Output is correct
5 Correct 83 ms 94280 KB Output is correct
6 Correct 93 ms 95128 KB Output is correct
7 Correct 96 ms 94280 KB Output is correct
8 Correct 84 ms 94788 KB Output is correct
9 Correct 93 ms 94284 KB Output is correct
10 Correct 92 ms 95028 KB Output is correct
11 Correct 84 ms 94652 KB Output is correct
12 Correct 94 ms 94756 KB Output is correct
13 Correct 91 ms 94540 KB Output is correct
14 Correct 86 ms 94544 KB Output is correct
15 Correct 94 ms 94560 KB Output is correct
16 Correct 89 ms 94548 KB Output is correct
17 Correct 92 ms 94768 KB Output is correct
18 Correct 92 ms 94528 KB Output is correct
19 Correct 98 ms 94536 KB Output is correct
20 Correct 90 ms 94852 KB Output is correct
21 Correct 89 ms 94280 KB Output is correct
22 Correct 86 ms 94244 KB Output is correct
23 Correct 95 ms 94488 KB Output is correct
24 Correct 85 ms 94536 KB Output is correct
25 Correct 91 ms 94776 KB Output is correct
26 Correct 94 ms 94780 KB Output is correct
27 Correct 93 ms 94280 KB Output is correct
28 Correct 93 ms 94536 KB Output is correct
29 Correct 87 ms 94536 KB Output is correct
30 Correct 92 ms 94552 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 94284 KB Output is correct
2 Correct 89 ms 94204 KB Output is correct
3 Correct 96 ms 94276 KB Output is correct
4 Correct 91 ms 94284 KB Output is correct
5 Correct 83 ms 94280 KB Output is correct
6 Correct 93 ms 95128 KB Output is correct
7 Correct 96 ms 94280 KB Output is correct
8 Correct 84 ms 94788 KB Output is correct
9 Correct 93 ms 94284 KB Output is correct
10 Correct 92 ms 95028 KB Output is correct
11 Correct 84 ms 94652 KB Output is correct
12 Correct 94 ms 94756 KB Output is correct
13 Correct 91 ms 94540 KB Output is correct
14 Correct 86 ms 94544 KB Output is correct
15 Correct 94 ms 94560 KB Output is correct
16 Correct 89 ms 94548 KB Output is correct
17 Correct 92 ms 94768 KB Output is correct
18 Correct 92 ms 94528 KB Output is correct
19 Correct 98 ms 94536 KB Output is correct
20 Correct 90 ms 94852 KB Output is correct
21 Correct 89 ms 94280 KB Output is correct
22 Correct 86 ms 94244 KB Output is correct
23 Correct 95 ms 94488 KB Output is correct
24 Correct 85 ms 94536 KB Output is correct
25 Correct 91 ms 94776 KB Output is correct
26 Correct 94 ms 94780 KB Output is correct
27 Correct 93 ms 94280 KB Output is correct
28 Correct 93 ms 94536 KB Output is correct
29 Correct 87 ms 94536 KB Output is correct
30 Correct 92 ms 94552 KB Output is correct
31 Correct 542 ms 148116 KB Output is correct
32 Correct 355 ms 99516 KB Output is correct
33 Correct 517 ms 144288 KB Output is correct
34 Correct 511 ms 144284 KB Output is correct
35 Correct 569 ms 148112 KB Output is correct
36 Correct 557 ms 190608 KB Output is correct
37 Correct 442 ms 143688 KB Output is correct
38 Correct 462 ms 143820 KB Output is correct
39 Correct 402 ms 143620 KB Output is correct
40 Correct 420 ms 143720 KB Output is correct
41 Correct 350 ms 143788 KB Output is correct
42 Correct 374 ms 143768 KB Output is correct
43 Correct 138 ms 100796 KB Output is correct
44 Correct 369 ms 143772 KB Output is correct
45 Correct 359 ms 143740 KB Output is correct
46 Correct 336 ms 143772 KB Output is correct
47 Correct 275 ms 123044 KB Output is correct
48 Correct 300 ms 123048 KB Output is correct
49 Correct 281 ms 123044 KB Output is correct
50 Correct 300 ms 123288 KB Output is correct
51 Correct 297 ms 123056 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1353 ms 234640 KB Output is correct
2 Correct 1765 ms 303308 KB Output is correct
3 Correct 769 ms 170820 KB Output is correct
4 Correct 1247 ms 233112 KB Output is correct
5 Correct 1633 ms 303248 KB Output is correct
6 Correct 1797 ms 303248 KB Output is correct
7 Correct 722 ms 170932 KB Output is correct
8 Correct 1090 ms 230852 KB Output is correct
9 Correct 1243 ms 315780 KB Output is correct
10 Correct 1460 ms 303572 KB Output is correct
11 Correct 1169 ms 304780 KB Output is correct
12 Correct 1149 ms 305288 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3180 ms 311188 KB Output is correct
2 Execution timed out 5083 ms 128900 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 94284 KB Output is correct
2 Correct 89 ms 94204 KB Output is correct
3 Correct 96 ms 94276 KB Output is correct
4 Correct 91 ms 94284 KB Output is correct
5 Correct 83 ms 94280 KB Output is correct
6 Correct 93 ms 95128 KB Output is correct
7 Correct 96 ms 94280 KB Output is correct
8 Correct 84 ms 94788 KB Output is correct
9 Correct 93 ms 94284 KB Output is correct
10 Correct 92 ms 95028 KB Output is correct
11 Correct 84 ms 94652 KB Output is correct
12 Correct 94 ms 94756 KB Output is correct
13 Correct 91 ms 94540 KB Output is correct
14 Correct 86 ms 94544 KB Output is correct
15 Correct 94 ms 94560 KB Output is correct
16 Correct 89 ms 94548 KB Output is correct
17 Correct 92 ms 94768 KB Output is correct
18 Correct 92 ms 94528 KB Output is correct
19 Correct 98 ms 94536 KB Output is correct
20 Correct 90 ms 94852 KB Output is correct
21 Correct 89 ms 94280 KB Output is correct
22 Correct 86 ms 94244 KB Output is correct
23 Correct 95 ms 94488 KB Output is correct
24 Correct 85 ms 94536 KB Output is correct
25 Correct 91 ms 94776 KB Output is correct
26 Correct 94 ms 94780 KB Output is correct
27 Correct 93 ms 94280 KB Output is correct
28 Correct 93 ms 94536 KB Output is correct
29 Correct 87 ms 94536 KB Output is correct
30 Correct 92 ms 94552 KB Output is correct
31 Correct 542 ms 148116 KB Output is correct
32 Correct 355 ms 99516 KB Output is correct
33 Correct 517 ms 144288 KB Output is correct
34 Correct 511 ms 144284 KB Output is correct
35 Correct 569 ms 148112 KB Output is correct
36 Correct 557 ms 190608 KB Output is correct
37 Correct 442 ms 143688 KB Output is correct
38 Correct 462 ms 143820 KB Output is correct
39 Correct 402 ms 143620 KB Output is correct
40 Correct 420 ms 143720 KB Output is correct
41 Correct 350 ms 143788 KB Output is correct
42 Correct 374 ms 143768 KB Output is correct
43 Correct 138 ms 100796 KB Output is correct
44 Correct 369 ms 143772 KB Output is correct
45 Correct 359 ms 143740 KB Output is correct
46 Correct 336 ms 143772 KB Output is correct
47 Correct 275 ms 123044 KB Output is correct
48 Correct 300 ms 123048 KB Output is correct
49 Correct 281 ms 123044 KB Output is correct
50 Correct 300 ms 123288 KB Output is correct
51 Correct 297 ms 123056 KB Output is correct
52 Correct 239 ms 109644 KB Output is correct
53 Correct 237 ms 104372 KB Output is correct
54 Correct 373 ms 128420 KB Output is correct
55 Correct 325 ms 127152 KB Output is correct
56 Correct 320 ms 129008 KB Output is correct
57 Correct 336 ms 124328 KB Output is correct
58 Correct 341 ms 124584 KB Output is correct
59 Correct 303 ms 126376 KB Output is correct
60 Correct 349 ms 123580 KB Output is correct
61 Correct 160 ms 106428 KB Output is correct
62 Correct 262 ms 109748 KB Output is correct
63 Correct 345 ms 117436 KB Output is correct
64 Correct 364 ms 127132 KB Output is correct
65 Correct 390 ms 124136 KB Output is correct
66 Correct 386 ms 123368 KB Output is correct
67 Correct 335 ms 100700 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 94284 KB Output is correct
2 Correct 89 ms 94204 KB Output is correct
3 Correct 96 ms 94276 KB Output is correct
4 Correct 91 ms 94284 KB Output is correct
5 Correct 83 ms 94280 KB Output is correct
6 Correct 93 ms 95128 KB Output is correct
7 Correct 96 ms 94280 KB Output is correct
8 Correct 84 ms 94788 KB Output is correct
9 Correct 93 ms 94284 KB Output is correct
10 Correct 92 ms 95028 KB Output is correct
11 Correct 84 ms 94652 KB Output is correct
12 Correct 94 ms 94756 KB Output is correct
13 Correct 91 ms 94540 KB Output is correct
14 Correct 86 ms 94544 KB Output is correct
15 Correct 94 ms 94560 KB Output is correct
16 Correct 89 ms 94548 KB Output is correct
17 Correct 92 ms 94768 KB Output is correct
18 Correct 92 ms 94528 KB Output is correct
19 Correct 98 ms 94536 KB Output is correct
20 Correct 90 ms 94852 KB Output is correct
21 Correct 89 ms 94280 KB Output is correct
22 Correct 86 ms 94244 KB Output is correct
23 Correct 95 ms 94488 KB Output is correct
24 Correct 85 ms 94536 KB Output is correct
25 Correct 91 ms 94776 KB Output is correct
26 Correct 94 ms 94780 KB Output is correct
27 Correct 93 ms 94280 KB Output is correct
28 Correct 93 ms 94536 KB Output is correct
29 Correct 87 ms 94536 KB Output is correct
30 Correct 92 ms 94552 KB Output is correct
31 Correct 542 ms 148116 KB Output is correct
32 Correct 355 ms 99516 KB Output is correct
33 Correct 517 ms 144288 KB Output is correct
34 Correct 511 ms 144284 KB Output is correct
35 Correct 569 ms 148112 KB Output is correct
36 Correct 557 ms 190608 KB Output is correct
37 Correct 442 ms 143688 KB Output is correct
38 Correct 462 ms 143820 KB Output is correct
39 Correct 402 ms 143620 KB Output is correct
40 Correct 420 ms 143720 KB Output is correct
41 Correct 350 ms 143788 KB Output is correct
42 Correct 374 ms 143768 KB Output is correct
43 Correct 138 ms 100796 KB Output is correct
44 Correct 369 ms 143772 KB Output is correct
45 Correct 359 ms 143740 KB Output is correct
46 Correct 336 ms 143772 KB Output is correct
47 Correct 275 ms 123044 KB Output is correct
48 Correct 300 ms 123048 KB Output is correct
49 Correct 281 ms 123044 KB Output is correct
50 Correct 300 ms 123288 KB Output is correct
51 Correct 297 ms 123056 KB Output is correct
52 Correct 1353 ms 234640 KB Output is correct
53 Correct 1765 ms 303308 KB Output is correct
54 Correct 769 ms 170820 KB Output is correct
55 Correct 1247 ms 233112 KB Output is correct
56 Correct 1633 ms 303248 KB Output is correct
57 Correct 1797 ms 303248 KB Output is correct
58 Correct 722 ms 170932 KB Output is correct
59 Correct 1090 ms 230852 KB Output is correct
60 Correct 1243 ms 315780 KB Output is correct
61 Correct 1460 ms 303572 KB Output is correct
62 Correct 1169 ms 304780 KB Output is correct
63 Correct 1149 ms 305288 KB Output is correct
64 Correct 3180 ms 311188 KB Output is correct
65 Execution timed out 5083 ms 128900 KB Time limit exceeded
66 Halted 0 ms 0 KB -