Submission #743534

#	Time	Username	Problem	Language	Result	Execution time	Memory
743534		alvingogo	New Home (APIO18_new_home)	C++14	0 / 100	5063 ms	106908 KiB

new_home

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
#define int long long
using namespace std;

typedef pair<int,int> pii;
signed main(){
    AquA;
    int n,k,q;
    cin >> n >> k >> q;
    vector<pair<pii,pii> > vp(n);
    vector<pair<int,pii> > g;
    for(int i=0;i<n;i++){
        cin >> vp[i].fs.fs >> vp[i].fs.sc >> vp[i].sc.fs >> vp[i].sc.sc;
        g.push_back({vp[i].sc.fs,vp[i].fs});
        g.push_back({vp[i].sc.sc,{vp[i].fs.fs,-vp[i].fs.sc}});
    }
    vector<multiset<int> > s(k);
    for(int i=0;i<k;i++){
        s[i].insert(-2e9);
        s[i].insert(2e9);
    }
    vector<int> ans(n+1);
    for(int i=1;i<=q;i++){
        int l,y;
        cin >> l >> y;
        g.push_back({y,{-i,l}});
    }
    sort(g.begin(),g.end());
    vector<pii> ins,que,de;
    int nw=-1;
    for(auto t:g){
        if(t.fs!=nw){
            for(auto h:ins){
                s[h.sc-1].insert(h.fs);
            }
            for(auto h:que){
                for(int i=0;i<k;i++){
                    auto y=s[i].lower_bound(h.sc);
                    auto z=prev(y);
                    ans[-h.fs]=max(ans[-h.fs],min((*y)-h.sc,h.sc-(*z)));
                }
            }
            for(auto h:de){
                s[(-h.sc)-1].erase(s[-h.sc].find(h.fs));
            }
            ins.clear();
            que.clear();
            de.clear();
        }
        if(t.sc.fs<0){
            que.push_back(t.sc);
        }
        else if(t.sc.sc<0){
            de.push_back(t.sc);
        }
        else{
            ins.push_back(t.sc);
        }
        nw=t.fs;
    }
    for(auto h:ins){
        s[h.sc].insert(h.fs);
    }
    for(auto h:que){
        for(int i=0;i<k;i++){
            auto y=s[i].lower_bound(h.sc);
            auto z=prev(y);
            ans[-h.fs]=max(ans[-h.fs],min((*y)-h.sc,h.sc-(*z)));
        }
    }
    for(auto h:de){
        s[-h.sc].erase(s[-h.sc].find(h.fs));
    }
    for(int i=1;i<=q;i++){
        if(ans[i]>1e9){
            cout << -1 << "\n";
        }
        else{
            cout << ans[i] << "\n";
        }
    }
    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 10
• Subtask 4: 0 / 23
• Subtask 5: 0 / 35
• Subtask 6: 0 / 20