oj.uz

Submission #1100282

# Submission time Handle Problem Language Result Execution time Memory
1100282 2024-10-13T12:02:54 Z vladilius New Home (APIO18_new_home) C++17
47 / 100
 5000 ms 915008 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;
 
struct IT{
    struct node{
        node *l, *r;
        multiset<int> s1, s2;
        int m1, m2;
        node(){
            l = r = 0;
            m1 = inff; m2 = 0;
        }
    };
    node *rt;
    void init(){
        rt = new node();
    }
    void add(node *v, int tl, int tr, int l, int r, int x, int y){
        if (l > tr || r < tl) return;
        if (l <= tl && tr <= r){
            if (x != inff) (v -> s1).insert(x);
            if (y != 0) (v -> s2).insert(y);
            
            v -> m1 = min(v -> m1, x);
            v -> m2 = max(v -> m2, y);
            return;
        }
        int tm = (tl + tr) / 2;
        if (!(v -> l)) v -> l = new node();
        if (!(v -> r)) v -> r = new node();
        
        add(v -> l, tl, tm, l, r, x, y);
        add(v -> r, tm + 1, tr, l, r, x, y);
    }
    void add(int l, int r){
        if (l == 1){
            add(rt, 1, inf, l, r, inf, r + 1);
            return;
        }
        if (r == inf){
            add(rt, 1, inf, l, r, l - 1, 0);
            return;
        }
        int m = (l + r) / 2;
        if (l > 1 && l <= m) add(rt, 1, inf, l, m, l - 1, 0);
        if (r < inf && m < r) add(rt, 1, inf, m + 1, r, inf, r + 1);
    }
    void rem(node *v, int tl, int tr, int l, int r, int x, int y){
        if (l > tr || r < tl) return;
        if (l <= tl && tr <= r){
            if (x != inff) (v -> s1).erase((v -> s1).find(x));
            if (y != 0) (v -> s2).erase((v -> s2).find(y));
            
            v -> m1 = (v -> s1).empty() ? inff : *(v -> s1).begin();
            v -> m2 = (v -> s2).empty() ? 0 : *prev(v -> s2.end());
            return;
        }
        int tm = (tl + tr) / 2;
        rem(v -> l, tl, tm, l, r, x, y);
        rem(v -> r, tm + 1, tr, l, r, x, y);
    }
    void rem(int l, int r){
        if (l == 1){
            rem(rt, 1, inf, l, r, inf, r + 1);
            return;
        }
        if (r == inf){
            rem(rt, 1, inf, l, r, l - 1, 0);
            return;
        }
        int m = (l + r) / 2;
        if (l > 1 && l <= m) rem(rt, 1, inf, l, m, l - 1, 0);
        if (r < inf && m < r) rem(rt, 1, inf, m + 1, r, inf, r + 1);
    }
    pii merge(pii x, pii y){
        return {min(x.ff, y.ff), max(x.ss, y.ss)};
    }
    pii get(node *v, int tl, int tr, int& x){
        if (tl == tr) return {v -> m1, v -> m2};
        int tm = (tl + tr) / 2;
        if (x <= tm){
            if (!(v -> l)) return {v -> m1, v -> m2};
            return merge({v -> m1, v -> m2}, get(v -> l, tl, tm, x));
        }
        else {
            if (!(v -> r)) return {v -> m1, v -> m2};
            return merge({v -> m1, v -> m2}, get(v -> r, tm + 1, tr, x));
        }
    }
    pii get(int x){
        return get(rt, 1, inf, 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 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 12 ms 5712 KB Output is correct
7 Correct 5 ms 2384 KB Output is correct
8 Correct 9 ms 4688 KB Output is correct
9 Correct 4 ms 2896 KB Output is correct
10 Correct 11 ms 6396 KB Output is correct
11 Correct 8 ms 3408 KB Output is correct
12 Correct 10 ms 5200 KB Output is correct
13 Correct 4 ms 2504 KB Output is correct
14 Correct 6 ms 3408 KB Output is correct
15 Correct 7 ms 3692 KB Output is correct
16 Correct 7 ms 3408 KB Output is correct
17 Correct 10 ms 3920 KB Output is correct
18 Correct 10 ms 3664 KB Output is correct
19 Correct 6 ms 3664 KB Output is correct
20 Correct 7 ms 3920 KB Output is correct
21 Correct 3 ms 1360 KB Output is correct
22 Correct 4 ms 2896 KB Output is correct
23 Correct 6 ms 3832 KB Output is correct
24 Correct 8 ms 3904 KB Output is correct
25 Correct 7 ms 4176 KB Output is correct
26 Correct 10 ms 4084 KB Output is correct
27 Correct 3 ms 760 KB Output is correct
28 Correct 5 ms 3564 KB Output is correct
29 Correct 6 ms 3408 KB Output is correct
30 Correct 4 ms 2480 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 12 ms 5712 KB Output is correct
7 Correct 5 ms 2384 KB Output is correct
8 Correct 9 ms 4688 KB Output is correct
9 Correct 4 ms 2896 KB Output is correct
10 Correct 11 ms 6396 KB Output is correct
11 Correct 8 ms 3408 KB Output is correct
12 Correct 10 ms 5200 KB Output is correct
13 Correct 4 ms 2504 KB Output is correct
14 Correct 6 ms 3408 KB Output is correct
15 Correct 7 ms 3692 KB Output is correct
16 Correct 7 ms 3408 KB Output is correct
17 Correct 10 ms 3920 KB Output is correct
18 Correct 10 ms 3664 KB Output is correct
19 Correct 6 ms 3664 KB Output is correct
20 Correct 7 ms 3920 KB Output is correct
21 Correct 3 ms 1360 KB Output is correct
22 Correct 4 ms 2896 KB Output is correct
23 Correct 6 ms 3832 KB Output is correct
24 Correct 8 ms 3904 KB Output is correct
25 Correct 7 ms 4176 KB Output is correct
26 Correct 10 ms 4084 KB Output is correct
27 Correct 3 ms 760 KB Output is correct
28 Correct 5 ms 3564 KB Output is correct
29 Correct 6 ms 3408 KB Output is correct
30 Correct 4 ms 2480 KB Output is correct
31 Correct 4945 ms 537500 KB Output is correct
32 Correct 254 ms 5584 KB Output is correct
33 Correct 2672 ms 487276 KB Output is correct
34 Correct 4668 ms 478000 KB Output is correct
35 Correct 4213 ms 529544 KB Output is correct
36 Correct 2613 ms 505668 KB Output is correct
37 Correct 1976 ms 476976 KB Output is correct
38 Correct 1714 ms 479508 KB Output is correct
39 Correct 1272 ms 462708 KB Output is correct
40 Correct 1358 ms 469728 KB Output is correct
41 Correct 1606 ms 321316 KB Output is correct
42 Correct 1625 ms 322668 KB Output is correct
43 Correct 46 ms 7868 KB Output is correct
44 Correct 1342 ms 322032 KB Output is correct
45 Correct 1318 ms 321672 KB Output is correct
46 Correct 1002 ms 321380 KB Output is correct
47 Correct 632 ms 279476 KB Output is correct
48 Correct 592 ms 290440 KB Output is correct
49 Correct 797 ms 306868 KB Output is correct
50 Correct 1207 ms 302516 KB Output is correct
51 Correct 759 ms 310416 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5118 ms 915008 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5112 ms 763368 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 12 ms 5712 KB Output is correct
7 Correct 5 ms 2384 KB Output is correct
8 Correct 9 ms 4688 KB Output is correct
9 Correct 4 ms 2896 KB Output is correct
10 Correct 11 ms 6396 KB Output is correct
11 Correct 8 ms 3408 KB Output is correct
12 Correct 10 ms 5200 KB Output is correct
13 Correct 4 ms 2504 KB Output is correct
14 Correct 6 ms 3408 KB Output is correct
15 Correct 7 ms 3692 KB Output is correct
16 Correct 7 ms 3408 KB Output is correct
17 Correct 10 ms 3920 KB Output is correct
18 Correct 10 ms 3664 KB Output is correct
19 Correct 6 ms 3664 KB Output is correct
20 Correct 7 ms 3920 KB Output is correct
21 Correct 3 ms 1360 KB Output is correct
22 Correct 4 ms 2896 KB Output is correct
23 Correct 6 ms 3832 KB Output is correct
24 Correct 8 ms 3904 KB Output is correct
25 Correct 7 ms 4176 KB Output is correct
26 Correct 10 ms 4084 KB Output is correct
27 Correct 3 ms 760 KB Output is correct
28 Correct 5 ms 3564 KB Output is correct
29 Correct 6 ms 3408 KB Output is correct
30 Correct 4 ms 2480 KB Output is correct
31 Correct 4945 ms 537500 KB Output is correct
32 Correct 254 ms 5584 KB Output is correct
33 Correct 2672 ms 487276 KB Output is correct
34 Correct 4668 ms 478000 KB Output is correct
35 Correct 4213 ms 529544 KB Output is correct
36 Correct 2613 ms 505668 KB Output is correct
37 Correct 1976 ms 476976 KB Output is correct
38 Correct 1714 ms 479508 KB Output is correct
39 Correct 1272 ms 462708 KB Output is correct
40 Correct 1358 ms 469728 KB Output is correct
41 Correct 1606 ms 321316 KB Output is correct
42 Correct 1625 ms 322668 KB Output is correct
43 Correct 46 ms 7868 KB Output is correct
44 Correct 1342 ms 322032 KB Output is correct
45 Correct 1318 ms 321672 KB Output is correct
46 Correct 1002 ms 321380 KB Output is correct
47 Correct 632 ms 279476 KB Output is correct
48 Correct 592 ms 290440 KB Output is correct
49 Correct 797 ms 306868 KB Output is correct
50 Correct 1207 ms 302516 KB Output is correct
51 Correct 759 ms 310416 KB Output is correct
52 Correct 1466 ms 285888 KB Output is correct
53 Correct 1160 ms 194228 KB Output is correct
54 Correct 4280 ms 435920 KB Output is correct
55 Correct 1919 ms 309852 KB Output is correct
56 Correct 1792 ms 301836 KB Output is correct
57 Correct 1762 ms 318124 KB Output is correct
58 Correct 2013 ms 286388 KB Output is correct
59 Correct 2048 ms 276504 KB Output is correct
60 Correct 2047 ms 312224 KB Output is correct
61 Correct 571 ms 156348 KB Output is correct
62 Correct 1437 ms 286280 KB Output is correct
63 Correct 2646 ms 351920 KB Output is correct
64 Correct 3554 ms 355304 KB Output is correct
65 Correct 3361 ms 335172 KB Output is correct
66 Correct 1719 ms 323188 KB Output is correct
67 Correct 1220 ms 16308 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 12 ms 5712 KB Output is correct
7 Correct 5 ms 2384 KB Output is correct
8 Correct 9 ms 4688 KB Output is correct
9 Correct 4 ms 2896 KB Output is correct
10 Correct 11 ms 6396 KB Output is correct
11 Correct 8 ms 3408 KB Output is correct
12 Correct 10 ms 5200 KB Output is correct
13 Correct 4 ms 2504 KB Output is correct
14 Correct 6 ms 3408 KB Output is correct
15 Correct 7 ms 3692 KB Output is correct
16 Correct 7 ms 3408 KB Output is correct
17 Correct 10 ms 3920 KB Output is correct
18 Correct 10 ms 3664 KB Output is correct
19 Correct 6 ms 3664 KB Output is correct
20 Correct 7 ms 3920 KB Output is correct
21 Correct 3 ms 1360 KB Output is correct
22 Correct 4 ms 2896 KB Output is correct
23 Correct 6 ms 3832 KB Output is correct
24 Correct 8 ms 3904 KB Output is correct
25 Correct 7 ms 4176 KB Output is correct
26 Correct 10 ms 4084 KB Output is correct
27 Correct 3 ms 760 KB Output is correct
28 Correct 5 ms 3564 KB Output is correct
29 Correct 6 ms 3408 KB Output is correct
30 Correct 4 ms 2480 KB Output is correct
31 Correct 4945 ms 537500 KB Output is correct
32 Correct 254 ms 5584 KB Output is correct
33 Correct 2672 ms 487276 KB Output is correct
34 Correct 4668 ms 478000 KB Output is correct
35 Correct 4213 ms 529544 KB Output is correct
36 Correct 2613 ms 505668 KB Output is correct
37 Correct 1976 ms 476976 KB Output is correct
38 Correct 1714 ms 479508 KB Output is correct
39 Correct 1272 ms 462708 KB Output is correct
40 Correct 1358 ms 469728 KB Output is correct
41 Correct 1606 ms 321316 KB Output is correct
42 Correct 1625 ms 322668 KB Output is correct
43 Correct 46 ms 7868 KB Output is correct
44 Correct 1342 ms 322032 KB Output is correct
45 Correct 1318 ms 321672 KB Output is correct
46 Correct 1002 ms 321380 KB Output is correct
47 Correct 632 ms 279476 KB Output is correct
48 Correct 592 ms 290440 KB Output is correct
49 Correct 797 ms 306868 KB Output is correct
50 Correct 1207 ms 302516 KB Output is correct
51 Correct 759 ms 310416 KB Output is correct
52 Execution timed out 5118 ms 915008 KB Time limit exceeded
53 Halted 0 ms 0 KB -