Submission #1100282

#	Time	Username	Problem	Language	Result	Execution time	Memory
1100282		vladilius	New Home (APIO18_new_home)	C++17	47 / 100	5118 ms	915008 KiB

new_home

#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 / 5
• Subtask 2: 7 / 7
• Subtask 3: 0 / 10
• Subtask 4: 0 / 23
• Subtask 5: 35 / 35
• Subtask 6: 0 / 20