Submission #1153483

#	Time	Username	Problem	Language	Result	Execution time	Memory
1153483		Zero_OP	New Home (APIO18_new_home)	C++20	12 / 100	5094 ms	131360 KiB

new_home

#include <bits/stdc++.h>

using namespace std;

//loops (warning : long long)
#define FOR(i, l, r) for(int i = (l); i < (r); ++i)
#define ROF(i, r, l) for(int i = (r - 1); i >= l; --i)

//pairs, tuples
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second

//vectors
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define pb push_back
#define eb emplace_back
#define sum_of(v) accumulate(all(v), 0ll)
#define sz(v) (int)v.size()
#define compact(v) v.erase(unique(all(v)), end(v))

//binary search
#define lwb lower_bound
#define upb upper_bound

//other stuffs
#define dbg(x) "[" #x " = " << (x) << "]"
#define file(task) if(fopen(task".inp", "r")){ freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); }

template<typename T>
bool minimize(T& a, const T& b){
    if(a > b) return a = b, true;
    return false;
}

template<typename T>
bool maximize(T& a, const T& b){
    if(a < b) return a = b, true;
    return false;
}

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using db = double;
using pi = pair<int, int>;
using pl = pair<ll, ll>;

using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vpi = vector<pi>;
using vpl = vector<pl>;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const int MAX = 3e5 + 5;
const int inf = 1e9 + 100;

int N, K, Q, x[MAX], t[MAX], a[MAX], b[MAX], lq[MAX], yq[MAX];
int answer[MAX];

struct MinimumDistanceSolver{
    vector<multiset<int>> points;
    MinimumDistanceSolver(int n) : points(n) {}

    void insert(int t, int x){
        points[t].insert(x);
    }

    void erase(int t, int x){
        points[t].erase(points[t].lower_bound(x));
    }

    int get_answer(int x){
        int mx = -inf;
        FOR(i, 0, sz(points)){
            if(points[i].empty()) return -1;
            auto it = points[i].lower_bound(x);
            int cur = 1e9;
            if(it != points[i].end()) minimize(cur, (*it) - x);
            if(it != points[i].begin()) minimize(cur, x - (*prev(it)));
            maximize(mx, cur);
        }

        // cout << dbg(x) << '\n';
        // FOR(i, 0, sz(points)){
        //     cout << dbg(i) << " : ";
        //     for(auto j : points[i]) cout << j << ' '; cout << '\n';
        // }
        return mx;
    }
};

struct SegmentTreeEvent{
    vector<vi> points, queries;
    SegmentTreeEvent(int n) : points(n << 2), queries(n) {}

    void add_events(int id, int l, int r, int u, int v, int idx){
        if(u <= l && r <= v){
            points[id].pb(idx);
        } else{
            int mid = l + r >> 1;
            if(u <= mid) add_events(id << 1, l, mid, u, v, idx);
            if(mid < v)  add_events(id << 1 | 1, mid + 1, r, u, v, idx);
        }
    }

    void add_query(int pos, int idx){
        queries[pos].pb(idx);
    }

    void solve(int id, int l, int r, MinimumDistanceSolver& T){
        for(auto idx : points[id]) T.insert(t[idx], x[idx]);
        if(l == r){
            for(auto idx : queries[l]){
                answer[idx] = T.get_answer(lq[idx]);
            }
        } else{
            int mid = l + r >> 1;
            solve(id << 1, l, mid, T);
            solve(id << 1 | 1, mid + 1, r, T);
        }
        for(auto idx : points[id]) T.erase(t[idx], x[idx]);
    }
};

void testcase(int ntestcase){
    cin >> N >> K >> Q;
    vi v, pts;
    FOR(i, 0, N){
        cin >> x[i] >> t[i] >> a[i] >> b[i];
        --t[i];
        // pts.pb(x[i]);
        v.pb(a[i]);
        v.pb(b[i]);
    }

    FOR(i, 0, Q){
        cin >> lq[i] >> yq[i];
        // pts.pb(lq[i]);
        v.pb(yq[i]);
    }

    sort(all(v)); compact(v);
    // sort(all(pts)); compact(pts);

    MinimumDistanceSolver F(K);
    SegmentTreeEvent T(sz(v));

    FOR(i, 0, N){
        // x[i] = lower_bound(all(pts), x[i]) - pts.begin();
        a[i] = lower_bound(all(v), a[i]) - v.begin();
        b[i] = lower_bound(all(v), b[i]) - v.begin();
        T.add_events(1, 0, sz(v) - 1, a[i], b[i], i);
    }
    
    FOR(i, 0, Q){
        // lq[i] = lower_bound(all(pts), lq[i]) - v.begin();
        yq[i] = lower_bound(all(v), yq[i]) - v.begin();
        T.add_query(yq[i], i);
    }

    T.solve(1, 0, sz(v) - 1, F);
    FOR(i, 0, Q) cout << answer[i] << '\n';
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

#ifdef LOCAL
    freopen("in.txt", "r", stdin);
#endif // LOCAL

    int T = 1;
    //cin >> T;
    FOR(i, 0, T) testcase(i);

    return 0;
}

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