제출 #1308660

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1308660		Tymond	Road Construction (JOI21_road_construction)	C++20	6 / 100	2851 ms	33720 KiB

road_construction

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

struct pair_hash{
  size_t operator()(const pair<int,int>&x)const{
    return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
  }
};

const int MAXN = 3e5 + 7;
const ll INF = 1e10;
pll A[MAXN];
ll n, L;
vll dist = {};

ll getDist(pll x, pll y){
    return (ll)abs((x.fi - (x.fi + x.se) / 2) - (y.fi - (y.fi + y.se) / 2)) +
    abs(((x.fi + x.se) / 2) - ((y.fi + y.se) / 2));
}

ll count(ll K){
    dist.clear();
    vector<pair<pll, ll>> vec = {};
    for(int i = 1; i <= n; i++){
        vec.pb(mp(mp(A[i].se, 0LL), A[i].fi));
        vec.pb(mp(mp(A[i].se + K, 1LL), A[i].fi));
    }

    sort(all(vec));

    set<pll> s;
    ll res = 0LL;
    for(auto ele : vec){
        if(ele.fi.se == 0){
            ll X = ele.se;
            ll Y = ele.fi.fi - K;
            auto it = s.lower_bound(mp(X - K, -INF));
            while(it != s.end() && (*it).fi <= X + K){
                dist.pb(getDist(mp(X, Y), (*it)));
                it++;
                if(sz(dist) >= L){
                    return L;
                }
            }
            s.insert(mp(X, Y));
        }else{
            s.erase(mp(ele.se, ele.fi.fi - K));
        }
    }
    return res;
}

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

    cin >> n >> L;
    for(int i = 1; i <= n; i++){
        cin >> A[i].fi >> A[i].se;
        pii val = mp(A[i].fi + A[i].se, A[i].se - A[i].fi);
        A[i] = val;
        //cerr << A[i] << '\n';
    }

    ll l = 1;
    ll p = (ll)4e9;
    ll mid;
    while(l < p){
        mid = (l + p) / 2;
        //cerr << l << ' ' << p << ' ' << mid << ' ' << count(mid) << '\n';
        if(count(mid) >= L){
            p = mid;
        }else{
            l = mid + 1;
        }
    }
   // debug(l);
    count(l - 1);
    while(sz(dist) < L){
        dist.pb(l);
    }
    sort(all(dist));
    //debug(dist);

    for(auto ele : dist){
        cout << ele << '\n';
    }
    
    return 0;
}

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