oj.uz

답안 #1100428

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1100428 2024-10-13T20:33:13 Z vladilius 새 집 (APIO18_new_home) C++17
57 / 100
 2619 ms 315624 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 v, int tl, int tr, int p, int x){
        if (tl == tr){
            s[all[v].i].insert(x);
            all[v].m2 = max(all[v].m2, x);
            return;
        }
        int tm = (tl + tr) / 2;
        if (p <= tm){
            if (!all[v].l) all[v].l = nw(tl, tm);
            add2(all[v].l, tl, tm, p, x);
        }
        else {
            if (!all[v].r) all[v].r = nw(tm + 1, tr);
            add2(all[v].r, tm + 1, tr, p, x);
        }
        all[v].m2 = max(all[v].m2, x);
    }
    void add1(int v, int tl, int tr, int p, int x){
        if (tl == tr){
            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);
            add1(all[v].l, tl, tm, p, x);
        }
        else {
            if (!all[v].r) all[v].r = nw(tm + 1, tr);
            add1(all[v].r, tm + 1, tr, p, x);
        }
        all[v].m1 = min(all[v].m1, x);
    }
    void add(int l, int r){
        if (l == 1){
            add2(1, 1, inf, l, r + 1);
            return;
        }
        if (r == inf){
            add1(1, 1, inf, inf, l - 1);
            return;
        }
        int m = (l + r) / 2;
        if (l <= m) add1(1, 1, inf, m, l - 1);
        if (m < r) add2(1, 1, inf, m + 1, r + 1);
    }
    void rem2(int v, int tl, int tr, int p, int x, bool t){
        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());
            return;
        }
        int tm = (tl + tr) / 2;
        if (p <= tm){
            rem2(all[v].l, tl, tm, p, x, t);
        }
        else {
            rem2(all[v].r, tm + 1, tr, p, x, t);
        }
        all[v].m2 = 0;
        if (all[v].l) all[v].m2 = max(all[v].m2, all[all[v].l].m2);
        if (all[v].r) all[v].m2 = max(all[v].m2, all[all[v].r].m2);
    }
    void rem1(int v, int tl, int tr, int p, int x, bool t){
        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();
            return;
        }
        int tm = (tl + tr) / 2;
        if (p <= tm){
            rem1(all[v].l, tl, tm, p, x, t);
        }
        else {
            rem1(all[v].r, tm + 1, tr, p, x, t);
        }
        all[v].m1 = inff;
        if (all[v].l) all[v].m1 = min(all[v].m1, all[all[v].l].m1);
        if (all[v].r) all[v].m1 = min(all[v].m1, all[all[v].r].m1);
    }
    void rem(int l, int r){
        if (l == 1){
            rem2(1, 1, inf, l, r + 1, 1);
            return;
        }
        if (r == inf){
            rem1(1, 1, inf, inf, l - 1, 0);
            return;
        }
        int m = (l + r) / 2;
        if (l <= m) rem1(1, 1, inf, m, l - 1, 0);
        if (m < r) rem2(1, 1, inf, m + 1, r + 1, 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);
    bool ind = 1, ind1 = 0;
    for (int i = 1; i <= n; i++){
        cin>>x[i]>>t[i]>>a[i]>>b[i];
        if (a[i] != 1) ind = 0;
        if (b[i] != inf) ind1 = 1;
    }
    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});
    }
    if (!(n > 6e4 && ind && ind1)){
        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 79 ms 94280 KB Output is correct
2 Correct 85 ms 94280 KB Output is correct
3 Correct 96 ms 94280 KB Output is correct
4 Correct 80 ms 94280 KB Output is correct
5 Correct 92 ms 94280 KB Output is correct
6 Correct 94 ms 95132 KB Output is correct
7 Correct 93 ms 94288 KB Output is correct
8 Correct 92 ms 94788 KB Output is correct
9 Correct 92 ms 94288 KB Output is correct
10 Correct 82 ms 95128 KB Output is correct
11 Correct 95 ms 94536 KB Output is correct
12 Correct 88 ms 94872 KB Output is correct
13 Correct 81 ms 94508 KB Output is correct
14 Correct 86 ms 94536 KB Output is correct
15 Correct 88 ms 94536 KB Output is correct
16 Correct 97 ms 94504 KB Output is correct
17 Correct 98 ms 94780 KB Output is correct
18 Correct 93 ms 94536 KB Output is correct
19 Correct 94 ms 94476 KB Output is correct
20 Correct 96 ms 94776 KB Output is correct
21 Correct 95 ms 94280 KB Output is correct
22 Correct 86 ms 94292 KB Output is correct
23 Correct 89 ms 94536 KB Output is correct
24 Correct 94 ms 94536 KB Output is correct
25 Correct 90 ms 94756 KB Output is correct
26 Correct 90 ms 94780 KB Output is correct
27 Correct 97 ms 94384 KB Output is correct
28 Correct 89 ms 94516 KB Output is correct
29 Correct 93 ms 94536 KB Output is correct
30 Correct 89 ms 94544 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 94280 KB Output is correct
2 Correct 85 ms 94280 KB Output is correct
3 Correct 96 ms 94280 KB Output is correct
4 Correct 80 ms 94280 KB Output is correct
5 Correct 92 ms 94280 KB Output is correct
6 Correct 94 ms 95132 KB Output is correct
7 Correct 93 ms 94288 KB Output is correct
8 Correct 92 ms 94788 KB Output is correct
9 Correct 92 ms 94288 KB Output is correct
10 Correct 82 ms 95128 KB Output is correct
11 Correct 95 ms 94536 KB Output is correct
12 Correct 88 ms 94872 KB Output is correct
13 Correct 81 ms 94508 KB Output is correct
14 Correct 86 ms 94536 KB Output is correct
15 Correct 88 ms 94536 KB Output is correct
16 Correct 97 ms 94504 KB Output is correct
17 Correct 98 ms 94780 KB Output is correct
18 Correct 93 ms 94536 KB Output is correct
19 Correct 94 ms 94476 KB Output is correct
20 Correct 96 ms 94776 KB Output is correct
21 Correct 95 ms 94280 KB Output is correct
22 Correct 86 ms 94292 KB Output is correct
23 Correct 89 ms 94536 KB Output is correct
24 Correct 94 ms 94536 KB Output is correct
25 Correct 90 ms 94756 KB Output is correct
26 Correct 90 ms 94780 KB Output is correct
27 Correct 97 ms 94384 KB Output is correct
28 Correct 89 ms 94516 KB Output is correct
29 Correct 93 ms 94536 KB Output is correct
30 Correct 89 ms 94544 KB Output is correct
31 Correct 512 ms 148148 KB Output is correct
32 Correct 341 ms 99516 KB Output is correct
33 Correct 477 ms 144288 KB Output is correct
34 Correct 448 ms 144296 KB Output is correct
35 Correct 528 ms 147896 KB Output is correct
36 Correct 558 ms 190588 KB Output is correct
37 Correct 403 ms 143772 KB Output is correct
38 Correct 416 ms 143592 KB Output is correct
39 Correct 347 ms 143772 KB Output is correct
40 Correct 364 ms 143772 KB Output is correct
41 Correct 321 ms 143764 KB Output is correct
42 Correct 316 ms 143740 KB Output is correct
43 Correct 133 ms 100796 KB Output is correct
44 Correct 336 ms 143788 KB Output is correct
45 Correct 303 ms 143768 KB Output is correct
46 Correct 301 ms 143580 KB Output is correct
47 Correct 254 ms 123084 KB Output is correct
48 Correct 251 ms 122964 KB Output is correct
49 Correct 274 ms 123188 KB Output is correct
50 Correct 276 ms 123132 KB Output is correct
51 Correct 280 ms 123048 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1275 ms 234756 KB Output is correct
2 Correct 1589 ms 303232 KB Output is correct
3 Correct 787 ms 170944 KB Output is correct
4 Correct 1216 ms 233240 KB Output is correct
5 Correct 1499 ms 303256 KB Output is correct
6 Correct 1657 ms 303256 KB Output is correct
7 Correct 686 ms 170952 KB Output is correct
8 Correct 986 ms 230552 KB Output is correct
9 Correct 1097 ms 315624 KB Output is correct
10 Correct 1298 ms 303496 KB Output is correct
11 Correct 1046 ms 304732 KB Output is correct
12 Correct 990 ms 305296 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2619 ms 307084 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 94280 KB Output is correct
2 Correct 85 ms 94280 KB Output is correct
3 Correct 96 ms 94280 KB Output is correct
4 Correct 80 ms 94280 KB Output is correct
5 Correct 92 ms 94280 KB Output is correct
6 Correct 94 ms 95132 KB Output is correct
7 Correct 93 ms 94288 KB Output is correct
8 Correct 92 ms 94788 KB Output is correct
9 Correct 92 ms 94288 KB Output is correct
10 Correct 82 ms 95128 KB Output is correct
11 Correct 95 ms 94536 KB Output is correct
12 Correct 88 ms 94872 KB Output is correct
13 Correct 81 ms 94508 KB Output is correct
14 Correct 86 ms 94536 KB Output is correct
15 Correct 88 ms 94536 KB Output is correct
16 Correct 97 ms 94504 KB Output is correct
17 Correct 98 ms 94780 KB Output is correct
18 Correct 93 ms 94536 KB Output is correct
19 Correct 94 ms 94476 KB Output is correct
20 Correct 96 ms 94776 KB Output is correct
21 Correct 95 ms 94280 KB Output is correct
22 Correct 86 ms 94292 KB Output is correct
23 Correct 89 ms 94536 KB Output is correct
24 Correct 94 ms 94536 KB Output is correct
25 Correct 90 ms 94756 KB Output is correct
26 Correct 90 ms 94780 KB Output is correct
27 Correct 97 ms 94384 KB Output is correct
28 Correct 89 ms 94516 KB Output is correct
29 Correct 93 ms 94536 KB Output is correct
30 Correct 89 ms 94544 KB Output is correct
31 Correct 512 ms 148148 KB Output is correct
32 Correct 341 ms 99516 KB Output is correct
33 Correct 477 ms 144288 KB Output is correct
34 Correct 448 ms 144296 KB Output is correct
35 Correct 528 ms 147896 KB Output is correct
36 Correct 558 ms 190588 KB Output is correct
37 Correct 403 ms 143772 KB Output is correct
38 Correct 416 ms 143592 KB Output is correct
39 Correct 347 ms 143772 KB Output is correct
40 Correct 364 ms 143772 KB Output is correct
41 Correct 321 ms 143764 KB Output is correct
42 Correct 316 ms 143740 KB Output is correct
43 Correct 133 ms 100796 KB Output is correct
44 Correct 336 ms 143788 KB Output is correct
45 Correct 303 ms 143768 KB Output is correct
46 Correct 301 ms 143580 KB Output is correct
47 Correct 254 ms 123084 KB Output is correct
48 Correct 251 ms 122964 KB Output is correct
49 Correct 274 ms 123188 KB Output is correct
50 Correct 276 ms 123132 KB Output is correct
51 Correct 280 ms 123048 KB Output is correct
52 Correct 233 ms 109748 KB Output is correct
53 Correct 233 ms 104376 KB Output is correct
54 Correct 368 ms 128428 KB Output is correct
55 Correct 298 ms 127076 KB Output is correct
56 Correct 302 ms 128932 KB Output is correct
57 Correct 337 ms 124412 KB Output is correct
58 Correct 321 ms 124580 KB Output is correct
59 Correct 307 ms 126372 KB Output is correct
60 Correct 325 ms 123560 KB Output is correct
61 Correct 165 ms 106684 KB Output is correct
62 Correct 260 ms 109748 KB Output is correct
63 Correct 325 ms 117452 KB Output is correct
64 Correct 375 ms 127144 KB Output is correct
65 Correct 359 ms 124324 KB Output is correct
66 Correct 310 ms 123300 KB Output is correct
67 Correct 311 ms 100532 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 94280 KB Output is correct
2 Correct 85 ms 94280 KB Output is correct
3 Correct 96 ms 94280 KB Output is correct
4 Correct 80 ms 94280 KB Output is correct
5 Correct 92 ms 94280 KB Output is correct
6 Correct 94 ms 95132 KB Output is correct
7 Correct 93 ms 94288 KB Output is correct
8 Correct 92 ms 94788 KB Output is correct
9 Correct 92 ms 94288 KB Output is correct
10 Correct 82 ms 95128 KB Output is correct
11 Correct 95 ms 94536 KB Output is correct
12 Correct 88 ms 94872 KB Output is correct
13 Correct 81 ms 94508 KB Output is correct
14 Correct 86 ms 94536 KB Output is correct
15 Correct 88 ms 94536 KB Output is correct
16 Correct 97 ms 94504 KB Output is correct
17 Correct 98 ms 94780 KB Output is correct
18 Correct 93 ms 94536 KB Output is correct
19 Correct 94 ms 94476 KB Output is correct
20 Correct 96 ms 94776 KB Output is correct
21 Correct 95 ms 94280 KB Output is correct
22 Correct 86 ms 94292 KB Output is correct
23 Correct 89 ms 94536 KB Output is correct
24 Correct 94 ms 94536 KB Output is correct
25 Correct 90 ms 94756 KB Output is correct
26 Correct 90 ms 94780 KB Output is correct
27 Correct 97 ms 94384 KB Output is correct
28 Correct 89 ms 94516 KB Output is correct
29 Correct 93 ms 94536 KB Output is correct
30 Correct 89 ms 94544 KB Output is correct
31 Correct 512 ms 148148 KB Output is correct
32 Correct 341 ms 99516 KB Output is correct
33 Correct 477 ms 144288 KB Output is correct
34 Correct 448 ms 144296 KB Output is correct
35 Correct 528 ms 147896 KB Output is correct
36 Correct 558 ms 190588 KB Output is correct
37 Correct 403 ms 143772 KB Output is correct
38 Correct 416 ms 143592 KB Output is correct
39 Correct 347 ms 143772 KB Output is correct
40 Correct 364 ms 143772 KB Output is correct
41 Correct 321 ms 143764 KB Output is correct
42 Correct 316 ms 143740 KB Output is correct
43 Correct 133 ms 100796 KB Output is correct
44 Correct 336 ms 143788 KB Output is correct
45 Correct 303 ms 143768 KB Output is correct
46 Correct 301 ms 143580 KB Output is correct
47 Correct 254 ms 123084 KB Output is correct
48 Correct 251 ms 122964 KB Output is correct
49 Correct 274 ms 123188 KB Output is correct
50 Correct 276 ms 123132 KB Output is correct
51 Correct 280 ms 123048 KB Output is correct
52 Correct 1275 ms 234756 KB Output is correct
53 Correct 1589 ms 303232 KB Output is correct
54 Correct 787 ms 170944 KB Output is correct
55 Correct 1216 ms 233240 KB Output is correct
56 Correct 1499 ms 303256 KB Output is correct
57 Correct 1657 ms 303256 KB Output is correct
58 Correct 686 ms 170952 KB Output is correct
59 Correct 986 ms 230552 KB Output is correct
60 Correct 1097 ms 315624 KB Output is correct
61 Correct 1298 ms 303496 KB Output is correct
62 Correct 1046 ms 304732 KB Output is correct
63 Correct 990 ms 305296 KB Output is correct
64 Incorrect 2619 ms 307084 KB Output isn't correct
65 Halted 0 ms 0 KB -