oj.uz

답안 #1100434

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1100434 2024-10-13T21:13:13 Z vladilius 새 집 (APIO18_new_home) C++17
0 / 100
 221 ms 43392 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 = 3e2 + 2;

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
0 / 5.0

# 결과 실행 시간 메모리 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 504 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Runtime error 2 ms 1016 KB Execution killed with signal 11
7 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 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 504 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Runtime error 2 ms 1016 KB Execution killed with signal 11
7 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 186 ms 41380 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 221 ms 43392 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 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 504 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Runtime error 2 ms 1016 KB Execution killed with signal 11
7 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 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 504 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Runtime error 2 ms 1016 KB Execution killed with signal 11
7 Halted 0 ms 0 KB -