oj.uz

답안 #1100264

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1100264 2024-10-13T11:06:06 Z vladilius 새 집 (APIO18_new_home) C++17
57 / 100
 5000 ms 247620 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 N = 3e5 + 1;
const int NN = 1e7;
 
struct IT{
    struct node{
        int m, l, r, s;
        node(){
            l = r = m = 0;
        }
    };
    node all[NN];
    multiset<int> st[N];
    int rt, cc, cc1;
    void init(){
        all[1] = node();
        rt = cc = 1;
        cc1 = -1;
    }
    int nw(int tl, int tr){
        all[++cc] = node();
        if (tl == tr){
            st[++cc1] = {};
            all[cc].s = cc1;
        }
        return cc;
    }
    void add(int v, int tl, int tr, int& p, int& x){
        if (tl == tr){
            st[all[v].s].insert(x);
            all[v].m = max(all[v].m, 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);
        }
        else {
            if (!all[v].r) all[v].r = nw(tm + 1, tr);
            add(all[v].r, tm + 1, tr, p, x);
        }
        all[v].m = 0;
        if (all[v].l) all[v].m = max(all[v].m, all[all[v].l].m);
        if (all[v].r) all[v].m = max(all[v].m, all[all[v].r].m);
    }
    void add(int l, int r){
        add(rt, 1, inf, l, r);
    }
    void rem(int v, int tl, int tr, int& p, int& x){
        if (tl == tr){
            st[all[v].s].erase(st[all[v].s].find(x));
            all[v].m = (st[all[v].s].empty()) ? 0 : *prev(st[all[v].s].end());
            return;
        }
        int tm = (tl + tr) / 2;
        if (p <= tm){
            rem(all[v].l, tl, tm, p, x);
        }
        else {
            rem(all[v].r, tm + 1, tr, p, x);
        }
        all[v].m = 0;
        if (all[v].l) all[v].m = max(all[v].m, all[all[v].l].m);
        if (all[v].r) all[v].m = max(all[v].m, all[all[v].r].m);
    }
    void rem(int l, int r){
        rem(rt, 1, inf, l, r);
    }
    int get(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].m;
        int tm = (tl + tr) / 2, out = 0;
        if (all[v].l) out = max(out, get(all[v].l, tl, tm, l, r));
        if (all[v].r) out = max(out, get(all[v].r, tm + 1, tr, l, r));
        return out;
    }
    bool get(int l, int r){
        return get(rt, 1, inf, 1, l) >= r;
    }
};
 
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 check = [&](int d){
                return T.get(max(1, i - d), min(inf, i + d));
            };
            
            int l = 0, r = inf;
            while (l + 1 < r){
                int m = (l + r) / 2;
                if (check(m)){
                    l = m + 1;
                }
                else {
                    r = m;
                }
            }
            if (check(l)) l = r;
            
            out[ii] = l;
        }
    }
    
    for (int i = 1; i <= q; i++){
        cout<<out[i]<<"\n";
    }
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 150 ms 171084 KB Output is correct
2 Correct 148 ms 171080 KB Output is correct
3 Correct 160 ms 170856 KB Output is correct
4 Correct 163 ms 171080 KB Output is correct
5 Correct 147 ms 170968 KB Output is correct
6 Correct 158 ms 171080 KB Output is correct
7 Correct 153 ms 171080 KB Output is correct
8 Correct 152 ms 170948 KB Output is correct
9 Correct 139 ms 171080 KB Output is correct
10 Correct 153 ms 170932 KB Output is correct
11 Correct 164 ms 171080 KB Output is correct
12 Correct 154 ms 171080 KB Output is correct
13 Correct 155 ms 171084 KB Output is correct
14 Correct 170 ms 171084 KB Output is correct
15 Correct 159 ms 171080 KB Output is correct
16 Correct 148 ms 170928 KB Output is correct
17 Correct 155 ms 171084 KB Output is correct
18 Correct 148 ms 171060 KB Output is correct
19 Correct 154 ms 170972 KB Output is correct
20 Correct 153 ms 171080 KB Output is correct
21 Correct 156 ms 171144 KB Output is correct
22 Correct 152 ms 171084 KB Output is correct
23 Correct 153 ms 171260 KB Output is correct
24 Correct 153 ms 170964 KB Output is correct
25 Correct 152 ms 171100 KB Output is correct
26 Correct 170 ms 170988 KB Output is correct
27 Correct 157 ms 171044 KB Output is correct
28 Correct 165 ms 171080 KB Output is correct
29 Correct 159 ms 171080 KB Output is correct
30 Correct 138 ms 171080 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 150 ms 171084 KB Output is correct
2 Correct 148 ms 171080 KB Output is correct
3 Correct 160 ms 170856 KB Output is correct
4 Correct 163 ms 171080 KB Output is correct
5 Correct 147 ms 170968 KB Output is correct
6 Correct 158 ms 171080 KB Output is correct
7 Correct 153 ms 171080 KB Output is correct
8 Correct 152 ms 170948 KB Output is correct
9 Correct 139 ms 171080 KB Output is correct
10 Correct 153 ms 170932 KB Output is correct
11 Correct 164 ms 171080 KB Output is correct
12 Correct 154 ms 171080 KB Output is correct
13 Correct 155 ms 171084 KB Output is correct
14 Correct 170 ms 171084 KB Output is correct
15 Correct 159 ms 171080 KB Output is correct
16 Correct 148 ms 170928 KB Output is correct
17 Correct 155 ms 171084 KB Output is correct
18 Correct 148 ms 171060 KB Output is correct
19 Correct 154 ms 170972 KB Output is correct
20 Correct 153 ms 171080 KB Output is correct
21 Correct 156 ms 171144 KB Output is correct
22 Correct 152 ms 171084 KB Output is correct
23 Correct 153 ms 171260 KB Output is correct
24 Correct 153 ms 170964 KB Output is correct
25 Correct 152 ms 171100 KB Output is correct
26 Correct 170 ms 170988 KB Output is correct
27 Correct 157 ms 171044 KB Output is correct
28 Correct 165 ms 171080 KB Output is correct
29 Correct 159 ms 171080 KB Output is correct
30 Correct 138 ms 171080 KB Output is correct
31 Correct 581 ms 180804 KB Output is correct
32 Correct 555 ms 176220 KB Output is correct
33 Correct 543 ms 177148 KB Output is correct
34 Correct 544 ms 177328 KB Output is correct
35 Correct 683 ms 180916 KB Output is correct
36 Correct 635 ms 180660 KB Output is correct
37 Correct 550 ms 176060 KB Output is correct
38 Correct 545 ms 176060 KB Output is correct
39 Correct 498 ms 175984 KB Output is correct
40 Correct 512 ms 176060 KB Output is correct
41 Correct 504 ms 176048 KB Output is correct
42 Correct 407 ms 176060 KB Output is correct
43 Correct 339 ms 177340 KB Output is correct
44 Correct 496 ms 176060 KB Output is correct
45 Correct 528 ms 176060 KB Output is correct
46 Correct 466 ms 176060 KB Output is correct
47 Correct 358 ms 176060 KB Output is correct
48 Correct 395 ms 176060 KB Output is correct
49 Correct 421 ms 176060 KB Output is correct
50 Correct 355 ms 176060 KB Output is correct
51 Correct 440 ms 175996 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2254 ms 224176 KB Output is correct
2 Correct 2895 ms 217196 KB Output is correct
3 Correct 1908 ms 247620 KB Output is correct
4 Correct 1909 ms 228148 KB Output is correct
5 Correct 2769 ms 216660 KB Output is correct
6 Correct 2956 ms 217148 KB Output is correct
7 Correct 1807 ms 247532 KB Output is correct
8 Correct 1768 ms 228192 KB Output is correct
9 Correct 1935 ms 221204 KB Output is correct
10 Correct 2545 ms 217780 KB Output is correct
11 Correct 1842 ms 216740 KB Output is correct
12 Correct 1862 ms 217532 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3232 ms 222708 KB Output is correct
2 Execution timed out 5074 ms 205480 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 150 ms 171084 KB Output is correct
2 Correct 148 ms 171080 KB Output is correct
3 Correct 160 ms 170856 KB Output is correct
4 Correct 163 ms 171080 KB Output is correct
5 Correct 147 ms 170968 KB Output is correct
6 Correct 158 ms 171080 KB Output is correct
7 Correct 153 ms 171080 KB Output is correct
8 Correct 152 ms 170948 KB Output is correct
9 Correct 139 ms 171080 KB Output is correct
10 Correct 153 ms 170932 KB Output is correct
11 Correct 164 ms 171080 KB Output is correct
12 Correct 154 ms 171080 KB Output is correct
13 Correct 155 ms 171084 KB Output is correct
14 Correct 170 ms 171084 KB Output is correct
15 Correct 159 ms 171080 KB Output is correct
16 Correct 148 ms 170928 KB Output is correct
17 Correct 155 ms 171084 KB Output is correct
18 Correct 148 ms 171060 KB Output is correct
19 Correct 154 ms 170972 KB Output is correct
20 Correct 153 ms 171080 KB Output is correct
21 Correct 156 ms 171144 KB Output is correct
22 Correct 152 ms 171084 KB Output is correct
23 Correct 153 ms 171260 KB Output is correct
24 Correct 153 ms 170964 KB Output is correct
25 Correct 152 ms 171100 KB Output is correct
26 Correct 170 ms 170988 KB Output is correct
27 Correct 157 ms 171044 KB Output is correct
28 Correct 165 ms 171080 KB Output is correct
29 Correct 159 ms 171080 KB Output is correct
30 Correct 138 ms 171080 KB Output is correct
31 Correct 581 ms 180804 KB Output is correct
32 Correct 555 ms 176220 KB Output is correct
33 Correct 543 ms 177148 KB Output is correct
34 Correct 544 ms 177328 KB Output is correct
35 Correct 683 ms 180916 KB Output is correct
36 Correct 635 ms 180660 KB Output is correct
37 Correct 550 ms 176060 KB Output is correct
38 Correct 545 ms 176060 KB Output is correct
39 Correct 498 ms 175984 KB Output is correct
40 Correct 512 ms 176060 KB Output is correct
41 Correct 504 ms 176048 KB Output is correct
42 Correct 407 ms 176060 KB Output is correct
43 Correct 339 ms 177340 KB Output is correct
44 Correct 496 ms 176060 KB Output is correct
45 Correct 528 ms 176060 KB Output is correct
46 Correct 466 ms 176060 KB Output is correct
47 Correct 358 ms 176060 KB Output is correct
48 Correct 395 ms 176060 KB Output is correct
49 Correct 421 ms 176060 KB Output is correct
50 Correct 355 ms 176060 KB Output is correct
51 Correct 440 ms 175996 KB Output is correct
52 Correct 315 ms 186512 KB Output is correct
53 Correct 300 ms 181084 KB Output is correct
54 Correct 371 ms 182452 KB Output is correct
55 Correct 515 ms 179124 KB Output is correct
56 Correct 501 ms 181180 KB Output is correct
57 Correct 525 ms 176564 KB Output is correct
58 Correct 443 ms 179048 KB Output is correct
59 Correct 425 ms 180892 KB Output is correct
60 Correct 437 ms 176312 KB Output is correct
61 Correct 373 ms 183228 KB Output is correct
62 Correct 402 ms 186648 KB Output is correct
63 Correct 442 ms 182708 KB Output is correct
64 Correct 438 ms 180916 KB Output is correct
65 Correct 460 ms 177076 KB Output is correct
66 Correct 499 ms 176148 KB Output is correct
67 Correct 371 ms 176824 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 150 ms 171084 KB Output is correct
2 Correct 148 ms 171080 KB Output is correct
3 Correct 160 ms 170856 KB Output is correct
4 Correct 163 ms 171080 KB Output is correct
5 Correct 147 ms 170968 KB Output is correct
6 Correct 158 ms 171080 KB Output is correct
7 Correct 153 ms 171080 KB Output is correct
8 Correct 152 ms 170948 KB Output is correct
9 Correct 139 ms 171080 KB Output is correct
10 Correct 153 ms 170932 KB Output is correct
11 Correct 164 ms 171080 KB Output is correct
12 Correct 154 ms 171080 KB Output is correct
13 Correct 155 ms 171084 KB Output is correct
14 Correct 170 ms 171084 KB Output is correct
15 Correct 159 ms 171080 KB Output is correct
16 Correct 148 ms 170928 KB Output is correct
17 Correct 155 ms 171084 KB Output is correct
18 Correct 148 ms 171060 KB Output is correct
19 Correct 154 ms 170972 KB Output is correct
20 Correct 153 ms 171080 KB Output is correct
21 Correct 156 ms 171144 KB Output is correct
22 Correct 152 ms 171084 KB Output is correct
23 Correct 153 ms 171260 KB Output is correct
24 Correct 153 ms 170964 KB Output is correct
25 Correct 152 ms 171100 KB Output is correct
26 Correct 170 ms 170988 KB Output is correct
27 Correct 157 ms 171044 KB Output is correct
28 Correct 165 ms 171080 KB Output is correct
29 Correct 159 ms 171080 KB Output is correct
30 Correct 138 ms 171080 KB Output is correct
31 Correct 581 ms 180804 KB Output is correct
32 Correct 555 ms 176220 KB Output is correct
33 Correct 543 ms 177148 KB Output is correct
34 Correct 544 ms 177328 KB Output is correct
35 Correct 683 ms 180916 KB Output is correct
36 Correct 635 ms 180660 KB Output is correct
37 Correct 550 ms 176060 KB Output is correct
38 Correct 545 ms 176060 KB Output is correct
39 Correct 498 ms 175984 KB Output is correct
40 Correct 512 ms 176060 KB Output is correct
41 Correct 504 ms 176048 KB Output is correct
42 Correct 407 ms 176060 KB Output is correct
43 Correct 339 ms 177340 KB Output is correct
44 Correct 496 ms 176060 KB Output is correct
45 Correct 528 ms 176060 KB Output is correct
46 Correct 466 ms 176060 KB Output is correct
47 Correct 358 ms 176060 KB Output is correct
48 Correct 395 ms 176060 KB Output is correct
49 Correct 421 ms 176060 KB Output is correct
50 Correct 355 ms 176060 KB Output is correct
51 Correct 440 ms 175996 KB Output is correct
52 Correct 2254 ms 224176 KB Output is correct
53 Correct 2895 ms 217196 KB Output is correct
54 Correct 1908 ms 247620 KB Output is correct
55 Correct 1909 ms 228148 KB Output is correct
56 Correct 2769 ms 216660 KB Output is correct
57 Correct 2956 ms 217148 KB Output is correct
58 Correct 1807 ms 247532 KB Output is correct
59 Correct 1768 ms 228192 KB Output is correct
60 Correct 1935 ms 221204 KB Output is correct
61 Correct 2545 ms 217780 KB Output is correct
62 Correct 1842 ms 216740 KB Output is correct
63 Correct 1862 ms 217532 KB Output is correct
64 Correct 3232 ms 222708 KB Output is correct
65 Execution timed out 5074 ms 205480 KB Time limit exceeded
66 Halted 0 ms 0 KB -