oj.uz

Submission #1100435

# Submission time Handle Problem Language Result Execution time Memory
1100435 2024-10-13T21:13:29 Z vladilius New Home (APIO18_new_home) C++17
57 / 100
 5000 ms 315792 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
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 87 ms 94192 KB Output is correct
2 Correct 88 ms 94280 KB Output is correct
3 Correct 90 ms 94352 KB Output is correct
4 Correct 98 ms 94280 KB Output is correct
5 Correct 107 ms 94280 KB Output is correct
6 Correct 102 ms 94976 KB Output is correct
7 Correct 98 ms 94284 KB Output is correct
8 Correct 98 ms 94736 KB Output is correct
9 Correct 109 ms 94380 KB Output is correct
10 Correct 115 ms 95140 KB Output is correct
11 Correct 98 ms 94536 KB Output is correct
12 Correct 98 ms 94872 KB Output is correct
13 Correct 100 ms 94536 KB Output is correct
14 Correct 107 ms 94628 KB Output is correct
15 Correct 99 ms 94536 KB Output is correct
16 Correct 99 ms 94532 KB Output is correct
17 Correct 101 ms 94768 KB Output is correct
18 Correct 98 ms 94536 KB Output is correct
19 Correct 97 ms 94532 KB Output is correct
20 Correct 97 ms 94776 KB Output is correct
21 Correct 96 ms 94292 KB Output is correct
22 Correct 95 ms 94280 KB Output is correct
23 Correct 93 ms 94572 KB Output is correct
24 Correct 97 ms 94536 KB Output is correct
25 Correct 94 ms 94776 KB Output is correct
26 Correct 92 ms 94780 KB Output is correct
27 Correct 96 ms 94280 KB Output is correct
28 Correct 92 ms 94536 KB Output is correct
29 Correct 98 ms 94564 KB Output is correct
30 Correct 95 ms 94540 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 94192 KB Output is correct
2 Correct 88 ms 94280 KB Output is correct
3 Correct 90 ms 94352 KB Output is correct
4 Correct 98 ms 94280 KB Output is correct
5 Correct 107 ms 94280 KB Output is correct
6 Correct 102 ms 94976 KB Output is correct
7 Correct 98 ms 94284 KB Output is correct
8 Correct 98 ms 94736 KB Output is correct
9 Correct 109 ms 94380 KB Output is correct
10 Correct 115 ms 95140 KB Output is correct
11 Correct 98 ms 94536 KB Output is correct
12 Correct 98 ms 94872 KB Output is correct
13 Correct 100 ms 94536 KB Output is correct
14 Correct 107 ms 94628 KB Output is correct
15 Correct 99 ms 94536 KB Output is correct
16 Correct 99 ms 94532 KB Output is correct
17 Correct 101 ms 94768 KB Output is correct
18 Correct 98 ms 94536 KB Output is correct
19 Correct 97 ms 94532 KB Output is correct
20 Correct 97 ms 94776 KB Output is correct
21 Correct 96 ms 94292 KB Output is correct
22 Correct 95 ms 94280 KB Output is correct
23 Correct 93 ms 94572 KB Output is correct
24 Correct 97 ms 94536 KB Output is correct
25 Correct 94 ms 94776 KB Output is correct
26 Correct 92 ms 94780 KB Output is correct
27 Correct 96 ms 94280 KB Output is correct
28 Correct 92 ms 94536 KB Output is correct
29 Correct 98 ms 94564 KB Output is correct
30 Correct 95 ms 94540 KB Output is correct
31 Correct 531 ms 147968 KB Output is correct
32 Correct 354 ms 99516 KB Output is correct
33 Correct 468 ms 144284 KB Output is correct
34 Correct 485 ms 144288 KB Output is correct
35 Correct 533 ms 148116 KB Output is correct
36 Correct 518 ms 190608 KB Output is correct
37 Correct 417 ms 143768 KB Output is correct
38 Correct 408 ms 143772 KB Output is correct
39 Correct 358 ms 143772 KB Output is correct
40 Correct 366 ms 143768 KB Output is correct
41 Correct 319 ms 143732 KB Output is correct
42 Correct 308 ms 143772 KB Output is correct
43 Correct 149 ms 100796 KB Output is correct
44 Correct 326 ms 143836 KB Output is correct
45 Correct 315 ms 143820 KB Output is correct
46 Correct 287 ms 143772 KB Output is correct
47 Correct 245 ms 123044 KB Output is correct
48 Correct 249 ms 123016 KB Output is correct
49 Correct 264 ms 123184 KB Output is correct
50 Correct 266 ms 123300 KB Output is correct
51 Correct 271 ms 123048 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1270 ms 234604 KB Output is correct
2 Correct 1535 ms 303248 KB Output is correct
3 Correct 784 ms 170996 KB Output is correct
4 Correct 1133 ms 233076 KB Output is correct
5 Correct 1525 ms 303248 KB Output is correct
6 Correct 1505 ms 303144 KB Output is correct
7 Correct 677 ms 170916 KB Output is correct
8 Correct 943 ms 230808 KB Output is correct
9 Correct 1044 ms 315792 KB Output is correct
10 Correct 1194 ms 303500 KB Output is correct
11 Correct 947 ms 304900 KB Output is correct
12 Correct 943 ms 305552 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2723 ms 311196 KB Output is correct
2 Execution timed out 5083 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 87 ms 94192 KB Output is correct
2 Correct 88 ms 94280 KB Output is correct
3 Correct 90 ms 94352 KB Output is correct
4 Correct 98 ms 94280 KB Output is correct
5 Correct 107 ms 94280 KB Output is correct
6 Correct 102 ms 94976 KB Output is correct
7 Correct 98 ms 94284 KB Output is correct
8 Correct 98 ms 94736 KB Output is correct
9 Correct 109 ms 94380 KB Output is correct
10 Correct 115 ms 95140 KB Output is correct
11 Correct 98 ms 94536 KB Output is correct
12 Correct 98 ms 94872 KB Output is correct
13 Correct 100 ms 94536 KB Output is correct
14 Correct 107 ms 94628 KB Output is correct
15 Correct 99 ms 94536 KB Output is correct
16 Correct 99 ms 94532 KB Output is correct
17 Correct 101 ms 94768 KB Output is correct
18 Correct 98 ms 94536 KB Output is correct
19 Correct 97 ms 94532 KB Output is correct
20 Correct 97 ms 94776 KB Output is correct
21 Correct 96 ms 94292 KB Output is correct
22 Correct 95 ms 94280 KB Output is correct
23 Correct 93 ms 94572 KB Output is correct
24 Correct 97 ms 94536 KB Output is correct
25 Correct 94 ms 94776 KB Output is correct
26 Correct 92 ms 94780 KB Output is correct
27 Correct 96 ms 94280 KB Output is correct
28 Correct 92 ms 94536 KB Output is correct
29 Correct 98 ms 94564 KB Output is correct
30 Correct 95 ms 94540 KB Output is correct
31 Correct 531 ms 147968 KB Output is correct
32 Correct 354 ms 99516 KB Output is correct
33 Correct 468 ms 144284 KB Output is correct
34 Correct 485 ms 144288 KB Output is correct
35 Correct 533 ms 148116 KB Output is correct
36 Correct 518 ms 190608 KB Output is correct
37 Correct 417 ms 143768 KB Output is correct
38 Correct 408 ms 143772 KB Output is correct
39 Correct 358 ms 143772 KB Output is correct
40 Correct 366 ms 143768 KB Output is correct
41 Correct 319 ms 143732 KB Output is correct
42 Correct 308 ms 143772 KB Output is correct
43 Correct 149 ms 100796 KB Output is correct
44 Correct 326 ms 143836 KB Output is correct
45 Correct 315 ms 143820 KB Output is correct
46 Correct 287 ms 143772 KB Output is correct
47 Correct 245 ms 123044 KB Output is correct
48 Correct 249 ms 123016 KB Output is correct
49 Correct 264 ms 123184 KB Output is correct
50 Correct 266 ms 123300 KB Output is correct
51 Correct 271 ms 123048 KB Output is correct
52 Correct 255 ms 109748 KB Output is correct
53 Correct 232 ms 104356 KB Output is correct
54 Correct 369 ms 128420 KB Output is correct
55 Correct 323 ms 126912 KB Output is correct
56 Correct 301 ms 128908 KB Output is correct
57 Correct 333 ms 124408 KB Output is correct
58 Correct 305 ms 124580 KB Output is correct
59 Correct 294 ms 126372 KB Output is correct
60 Correct 322 ms 123636 KB Output is correct
61 Correct 141 ms 106536 KB Output is correct
62 Correct 246 ms 109748 KB Output is correct
63 Correct 337 ms 117336 KB Output is correct
64 Correct 324 ms 127212 KB Output is correct
65 Correct 340 ms 124324 KB Output is correct
66 Correct 306 ms 123300 KB Output is correct
67 Correct 319 ms 100532 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 94192 KB Output is correct
2 Correct 88 ms 94280 KB Output is correct
3 Correct 90 ms 94352 KB Output is correct
4 Correct 98 ms 94280 KB Output is correct
5 Correct 107 ms 94280 KB Output is correct
6 Correct 102 ms 94976 KB Output is correct
7 Correct 98 ms 94284 KB Output is correct
8 Correct 98 ms 94736 KB Output is correct
9 Correct 109 ms 94380 KB Output is correct
10 Correct 115 ms 95140 KB Output is correct
11 Correct 98 ms 94536 KB Output is correct
12 Correct 98 ms 94872 KB Output is correct
13 Correct 100 ms 94536 KB Output is correct
14 Correct 107 ms 94628 KB Output is correct
15 Correct 99 ms 94536 KB Output is correct
16 Correct 99 ms 94532 KB Output is correct
17 Correct 101 ms 94768 KB Output is correct
18 Correct 98 ms 94536 KB Output is correct
19 Correct 97 ms 94532 KB Output is correct
20 Correct 97 ms 94776 KB Output is correct
21 Correct 96 ms 94292 KB Output is correct
22 Correct 95 ms 94280 KB Output is correct
23 Correct 93 ms 94572 KB Output is correct
24 Correct 97 ms 94536 KB Output is correct
25 Correct 94 ms 94776 KB Output is correct
26 Correct 92 ms 94780 KB Output is correct
27 Correct 96 ms 94280 KB Output is correct
28 Correct 92 ms 94536 KB Output is correct
29 Correct 98 ms 94564 KB Output is correct
30 Correct 95 ms 94540 KB Output is correct
31 Correct 531 ms 147968 KB Output is correct
32 Correct 354 ms 99516 KB Output is correct
33 Correct 468 ms 144284 KB Output is correct
34 Correct 485 ms 144288 KB Output is correct
35 Correct 533 ms 148116 KB Output is correct
36 Correct 518 ms 190608 KB Output is correct
37 Correct 417 ms 143768 KB Output is correct
38 Correct 408 ms 143772 KB Output is correct
39 Correct 358 ms 143772 KB Output is correct
40 Correct 366 ms 143768 KB Output is correct
41 Correct 319 ms 143732 KB Output is correct
42 Correct 308 ms 143772 KB Output is correct
43 Correct 149 ms 100796 KB Output is correct
44 Correct 326 ms 143836 KB Output is correct
45 Correct 315 ms 143820 KB Output is correct
46 Correct 287 ms 143772 KB Output is correct
47 Correct 245 ms 123044 KB Output is correct
48 Correct 249 ms 123016 KB Output is correct
49 Correct 264 ms 123184 KB Output is correct
50 Correct 266 ms 123300 KB Output is correct
51 Correct 271 ms 123048 KB Output is correct
52 Correct 1270 ms 234604 KB Output is correct
53 Correct 1535 ms 303248 KB Output is correct
54 Correct 784 ms 170996 KB Output is correct
55 Correct 1133 ms 233076 KB Output is correct
56 Correct 1525 ms 303248 KB Output is correct
57 Correct 1505 ms 303144 KB Output is correct
58 Correct 677 ms 170916 KB Output is correct
59 Correct 943 ms 230808 KB Output is correct
60 Correct 1044 ms 315792 KB Output is correct
61 Correct 1194 ms 303500 KB Output is correct
62 Correct 947 ms 304900 KB Output is correct
63 Correct 943 ms 305552 KB Output is correct
64 Correct 2723 ms 311196 KB Output is correct
65 Execution timed out 5083 ms 128932 KB Time limit exceeded
66 Halted 0 ms 0 KB -