oj.uz

Submission #1100432

# Submission time Handle Problem Language Result Execution time Memory
1100432 2024-10-13T21:08:01 Z vladilius New Home (APIO18_new_home) C++17
57 / 100
 5000 ms 315620 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 add2(int p, int x){
        int v = 1, tl = 1, tr = inf;
        while (true){
            all[v].m2 = max(all[v].m2, x);
            if (tl == tr){
                s[all[v].i].insert(x);
                break;
            }
            int tm = (tl + tr) / 2;
            if (p <= tm){
                if (!all[v].l) all[v].l = nw(tl, tm);
                v = all[v].l;
                tr = tm;
            }
            else {
                if (!all[v].r) all[v].r = nw(tm + 1, tr);
                v = all[v].r;
                tl = tm + 1;
            }
        }
    }
    void add1(int p, int x){
        int v = 1, tl = 1, tr = inf;
        while (true){
            all[v].m1 = min(all[v].m1, x);
            if (tl == tr){
                s[all[v].i].insert(x);
                break;
            }
            int tm = (tl + tr) / 2;
            if (p <= tm){
                if (!all[v].l) all[v].l = nw(tl, tm);
                v = all[v].l;
                tr = tm;
            }
            else {
                if (!all[v].r) all[v].r = nw(tm + 1, tr);
                v = all[v].r;
                tl = tm + 1;
            }
        }
    }
    void add(int l, int r){
        if (l == 1){
            add2(l, r + 1);
            return;
        }
        if (r == inf){
            add1(inf, l - 1);
            return;
        }
        int m = (l + r) / 2;
        if (l <= m) add1(m, l - 1);
        if (m < r) add2(m + 1, r + 1);
    }
    vector<int> up;
    void rem2(int p, int x){
        up.clear();
        int v = 1, tl = 1, tr = inf;
        while (true){
            if (tl == tr){
                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());
                break;
            }
            up.pb(v);
            int tm = (tl + tr) / 2;
            if (p <= tm){
                v = all[v].l;
                tr = tm;
            }
            else {
                v = all[v].r;
                tl = tm + 1;
            }
        }
        reverse(up.begin(), up.end());
        for (int i: up){
            all[i].m2 = 0;
            if (all[i].l) all[i].m2 = max(all[i].m2, all[all[i].l].m2);
            if (all[i].r) all[i].m2 = max(all[i].m2, all[all[i].r].m2);
        }
    }
    void rem1(int p, int x){
        up.clear();
        int v = 1, tl = 1, tr = inf;
        while (true){
            if (tl == tr){
                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();
                break;
            }
            up.pb(v);
            int tm = (tl + tr) / 2;
            if (p <= tm){
                v = all[v].l;
                tr = tm;
            }
            else {
                v = all[v].r;
                tl = tm + 1;
            }
        }
        reverse(up.begin(), up.end());
        for (int i: up){
            all[i].m1 = inff;
            if (all[i].l) all[i].m1 = min(all[i].m1, all[all[i].l].m1);
            if (all[i].r) all[i].m1 = min(all[i].m1, all[all[i].r].m1);
        }
    }
    void rem(int l, int r){
        if (l == 1){
            rem2(l, r + 1);
            return;
        }
        if (r == inf){
            rem1(inf, l - 1);
            return;
        }
        int m = (l + r) / 2;
        if (l <= m) rem1(m, l - 1);
        if (m < r) rem2(m + 1, r + 1);
    }
    int get2(int v, int tl, int tr, int l, int r){
        if (l > tr || r < tl) return 0;
        if (l <= tl && tr <= r) return all[v].m2;
        int tm = (tl + tr) / 2, out = 0;
        if (all[v].l){
            out = max(out, get2(all[v].l, tl, tm, l, r));
        }
        if (all[v].r){
            out = max(out, get2(all[v].r, tm + 1, tr, l, r));
        }
        return out;
    }
    int get1(int v, int tl, int tr, int l, int r){
        if (l > tr || r < tl) return inff;
        if (l <= tl && tr <= r) return all[v].m1;
        int tm = (tl + tr) / 2, out = inff;
        if (all[v].l){
            out = min(out, get1(all[v].l, tl, tm, l, r));
        }
        if (all[v].r){
            out = min(out, get1(all[v].r, tm + 1, tr, l, r));
        }
        return out;
    }
    pii get(int x){
        return {get1(1, 1, inf, x, inf), get2(1, 1, inf, 1, x)};
    }
};
 
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 81 ms 94280 KB Output is correct
2 Correct 97 ms 94280 KB Output is correct
3 Correct 95 ms 94280 KB Output is correct
4 Correct 92 ms 94280 KB Output is correct
5 Correct 93 ms 94280 KB Output is correct
6 Correct 87 ms 95124 KB Output is correct
7 Correct 91 ms 94340 KB Output is correct
8 Correct 90 ms 94788 KB Output is correct
9 Correct 89 ms 94368 KB Output is correct
10 Correct 88 ms 95132 KB Output is correct
11 Correct 88 ms 94536 KB Output is correct
12 Correct 97 ms 94872 KB Output is correct
13 Correct 97 ms 94540 KB Output is correct
14 Correct 97 ms 94576 KB Output is correct
15 Correct 102 ms 94536 KB Output is correct
16 Correct 96 ms 94508 KB Output is correct
17 Correct 97 ms 94768 KB Output is correct
18 Correct 100 ms 94596 KB Output is correct
19 Correct 98 ms 94684 KB Output is correct
20 Correct 98 ms 94776 KB Output is correct
21 Correct 90 ms 94340 KB Output is correct
22 Correct 93 ms 94280 KB Output is correct
23 Correct 97 ms 94536 KB Output is correct
24 Correct 82 ms 94536 KB Output is correct
25 Correct 97 ms 94784 KB Output is correct
26 Correct 102 ms 94780 KB Output is correct
27 Correct 96 ms 94256 KB Output is correct
28 Correct 103 ms 94772 KB Output is correct
29 Correct 93 ms 94536 KB Output is correct
30 Correct 83 ms 94524 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 94280 KB Output is correct
2 Correct 97 ms 94280 KB Output is correct
3 Correct 95 ms 94280 KB Output is correct
4 Correct 92 ms 94280 KB Output is correct
5 Correct 93 ms 94280 KB Output is correct
6 Correct 87 ms 95124 KB Output is correct
7 Correct 91 ms 94340 KB Output is correct
8 Correct 90 ms 94788 KB Output is correct
9 Correct 89 ms 94368 KB Output is correct
10 Correct 88 ms 95132 KB Output is correct
11 Correct 88 ms 94536 KB Output is correct
12 Correct 97 ms 94872 KB Output is correct
13 Correct 97 ms 94540 KB Output is correct
14 Correct 97 ms 94576 KB Output is correct
15 Correct 102 ms 94536 KB Output is correct
16 Correct 96 ms 94508 KB Output is correct
17 Correct 97 ms 94768 KB Output is correct
18 Correct 100 ms 94596 KB Output is correct
19 Correct 98 ms 94684 KB Output is correct
20 Correct 98 ms 94776 KB Output is correct
21 Correct 90 ms 94340 KB Output is correct
22 Correct 93 ms 94280 KB Output is correct
23 Correct 97 ms 94536 KB Output is correct
24 Correct 82 ms 94536 KB Output is correct
25 Correct 97 ms 94784 KB Output is correct
26 Correct 102 ms 94780 KB Output is correct
27 Correct 96 ms 94256 KB Output is correct
28 Correct 103 ms 94772 KB Output is correct
29 Correct 93 ms 94536 KB Output is correct
30 Correct 83 ms 94524 KB Output is correct
31 Correct 545 ms 148064 KB Output is correct
32 Correct 353 ms 99684 KB Output is correct
33 Correct 488 ms 144084 KB Output is correct
34 Correct 471 ms 144204 KB Output is correct
35 Correct 563 ms 147916 KB Output is correct
36 Correct 530 ms 190508 KB Output is correct
37 Correct 396 ms 143772 KB Output is correct
38 Correct 398 ms 143772 KB Output is correct
39 Correct 345 ms 143772 KB Output is correct
40 Correct 378 ms 143772 KB Output is correct
41 Correct 317 ms 143776 KB Output is correct
42 Correct 316 ms 143784 KB Output is correct
43 Correct 143 ms 100796 KB Output is correct
44 Correct 324 ms 143772 KB Output is correct
45 Correct 312 ms 143684 KB Output is correct
46 Correct 293 ms 143772 KB Output is correct
47 Correct 264 ms 123044 KB Output is correct
48 Correct 264 ms 123048 KB Output is correct
49 Correct 294 ms 123044 KB Output is correct
50 Correct 285 ms 123300 KB Output is correct
51 Correct 275 ms 123024 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1197 ms 234696 KB Output is correct
2 Correct 1535 ms 303292 KB Output is correct
3 Correct 711 ms 170916 KB Output is correct
4 Correct 1133 ms 233112 KB Output is correct
5 Correct 1561 ms 303288 KB Output is correct
6 Correct 1555 ms 303152 KB Output is correct
7 Correct 682 ms 170960 KB Output is correct
8 Correct 939 ms 230548 KB Output is correct
9 Correct 1030 ms 315620 KB Output is correct
10 Correct 1194 ms 303504 KB Output is correct
11 Correct 910 ms 304744 KB Output is correct
12 Correct 983 ms 305168 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2880 ms 311280 KB Output is correct
2 Execution timed out 5076 ms 128932 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 94280 KB Output is correct
2 Correct 97 ms 94280 KB Output is correct
3 Correct 95 ms 94280 KB Output is correct
4 Correct 92 ms 94280 KB Output is correct
5 Correct 93 ms 94280 KB Output is correct
6 Correct 87 ms 95124 KB Output is correct
7 Correct 91 ms 94340 KB Output is correct
8 Correct 90 ms 94788 KB Output is correct
9 Correct 89 ms 94368 KB Output is correct
10 Correct 88 ms 95132 KB Output is correct
11 Correct 88 ms 94536 KB Output is correct
12 Correct 97 ms 94872 KB Output is correct
13 Correct 97 ms 94540 KB Output is correct
14 Correct 97 ms 94576 KB Output is correct
15 Correct 102 ms 94536 KB Output is correct
16 Correct 96 ms 94508 KB Output is correct
17 Correct 97 ms 94768 KB Output is correct
18 Correct 100 ms 94596 KB Output is correct
19 Correct 98 ms 94684 KB Output is correct
20 Correct 98 ms 94776 KB Output is correct
21 Correct 90 ms 94340 KB Output is correct
22 Correct 93 ms 94280 KB Output is correct
23 Correct 97 ms 94536 KB Output is correct
24 Correct 82 ms 94536 KB Output is correct
25 Correct 97 ms 94784 KB Output is correct
26 Correct 102 ms 94780 KB Output is correct
27 Correct 96 ms 94256 KB Output is correct
28 Correct 103 ms 94772 KB Output is correct
29 Correct 93 ms 94536 KB Output is correct
30 Correct 83 ms 94524 KB Output is correct
31 Correct 545 ms 148064 KB Output is correct
32 Correct 353 ms 99684 KB Output is correct
33 Correct 488 ms 144084 KB Output is correct
34 Correct 471 ms 144204 KB Output is correct
35 Correct 563 ms 147916 KB Output is correct
36 Correct 530 ms 190508 KB Output is correct
37 Correct 396 ms 143772 KB Output is correct
38 Correct 398 ms 143772 KB Output is correct
39 Correct 345 ms 143772 KB Output is correct
40 Correct 378 ms 143772 KB Output is correct
41 Correct 317 ms 143776 KB Output is correct
42 Correct 316 ms 143784 KB Output is correct
43 Correct 143 ms 100796 KB Output is correct
44 Correct 324 ms 143772 KB Output is correct
45 Correct 312 ms 143684 KB Output is correct
46 Correct 293 ms 143772 KB Output is correct
47 Correct 264 ms 123044 KB Output is correct
48 Correct 264 ms 123048 KB Output is correct
49 Correct 294 ms 123044 KB Output is correct
50 Correct 285 ms 123300 KB Output is correct
51 Correct 275 ms 123024 KB Output is correct
52 Correct 253 ms 109748 KB Output is correct
53 Correct 225 ms 104372 KB Output is correct
54 Correct 367 ms 128420 KB Output is correct
55 Correct 304 ms 126940 KB Output is correct
56 Correct 295 ms 128936 KB Output is correct
57 Correct 316 ms 124340 KB Output is correct
58 Correct 308 ms 124580 KB Output is correct
59 Correct 310 ms 126396 KB Output is correct
60 Correct 318 ms 123596 KB Output is correct
61 Correct 148 ms 106428 KB Output is correct
62 Correct 251 ms 109748 KB Output is correct
63 Correct 328 ms 117376 KB Output is correct
64 Correct 338 ms 127140 KB Output is correct
65 Correct 348 ms 124340 KB Output is correct
66 Correct 317 ms 123300 KB Output is correct
67 Correct 281 ms 100524 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 94280 KB Output is correct
2 Correct 97 ms 94280 KB Output is correct
3 Correct 95 ms 94280 KB Output is correct
4 Correct 92 ms 94280 KB Output is correct
5 Correct 93 ms 94280 KB Output is correct
6 Correct 87 ms 95124 KB Output is correct
7 Correct 91 ms 94340 KB Output is correct
8 Correct 90 ms 94788 KB Output is correct
9 Correct 89 ms 94368 KB Output is correct
10 Correct 88 ms 95132 KB Output is correct
11 Correct 88 ms 94536 KB Output is correct
12 Correct 97 ms 94872 KB Output is correct
13 Correct 97 ms 94540 KB Output is correct
14 Correct 97 ms 94576 KB Output is correct
15 Correct 102 ms 94536 KB Output is correct
16 Correct 96 ms 94508 KB Output is correct
17 Correct 97 ms 94768 KB Output is correct
18 Correct 100 ms 94596 KB Output is correct
19 Correct 98 ms 94684 KB Output is correct
20 Correct 98 ms 94776 KB Output is correct
21 Correct 90 ms 94340 KB Output is correct
22 Correct 93 ms 94280 KB Output is correct
23 Correct 97 ms 94536 KB Output is correct
24 Correct 82 ms 94536 KB Output is correct
25 Correct 97 ms 94784 KB Output is correct
26 Correct 102 ms 94780 KB Output is correct
27 Correct 96 ms 94256 KB Output is correct
28 Correct 103 ms 94772 KB Output is correct
29 Correct 93 ms 94536 KB Output is correct
30 Correct 83 ms 94524 KB Output is correct
31 Correct 545 ms 148064 KB Output is correct
32 Correct 353 ms 99684 KB Output is correct
33 Correct 488 ms 144084 KB Output is correct
34 Correct 471 ms 144204 KB Output is correct
35 Correct 563 ms 147916 KB Output is correct
36 Correct 530 ms 190508 KB Output is correct
37 Correct 396 ms 143772 KB Output is correct
38 Correct 398 ms 143772 KB Output is correct
39 Correct 345 ms 143772 KB Output is correct
40 Correct 378 ms 143772 KB Output is correct
41 Correct 317 ms 143776 KB Output is correct
42 Correct 316 ms 143784 KB Output is correct
43 Correct 143 ms 100796 KB Output is correct
44 Correct 324 ms 143772 KB Output is correct
45 Correct 312 ms 143684 KB Output is correct
46 Correct 293 ms 143772 KB Output is correct
47 Correct 264 ms 123044 KB Output is correct
48 Correct 264 ms 123048 KB Output is correct
49 Correct 294 ms 123044 KB Output is correct
50 Correct 285 ms 123300 KB Output is correct
51 Correct 275 ms 123024 KB Output is correct
52 Correct 1197 ms 234696 KB Output is correct
53 Correct 1535 ms 303292 KB Output is correct
54 Correct 711 ms 170916 KB Output is correct
55 Correct 1133 ms 233112 KB Output is correct
56 Correct 1561 ms 303288 KB Output is correct
57 Correct 1555 ms 303152 KB Output is correct
58 Correct 682 ms 170960 KB Output is correct
59 Correct 939 ms 230548 KB Output is correct
60 Correct 1030 ms 315620 KB Output is correct
61 Correct 1194 ms 303504 KB Output is correct
62 Correct 910 ms 304744 KB Output is correct
63 Correct 983 ms 305168 KB Output is correct
64 Correct 2880 ms 311280 KB Output is correct
65 Execution timed out 5076 ms 128932 KB Time limit exceeded
66 Halted 0 ms 0 KB -