Submission #778947

#	Time	Username	Problem	Language	Result	Execution time	Memory
778947		bachhoangxuan	Road Construction (JOI21_road_construction)	C++17	100 / 100	1543 ms	13448 KiB

road_construction

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
//const int inf=1e18;
const int mod=1e9+7;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
/*
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
*/
//const int iroot=power(3,mod-2);
const int base=101;

void solve(){
    int n,k;cin >> n >> k;
    vector<pii> p(n);
    for(int i=0;i<n;i++){int x,y;cin >> x >> y;p[i]={x+y,x-y};}
    sort(p.begin(),p.end());
    vector<int> ans;
    auto check = [&](int m,int t){
        int cnt=0,j=0;
        set<pii> s;
        for(int i=0;i<n;i++){
            while(j<i && p[i].fi-p[j].fi>m) s.erase({p[j].se,j++});
            auto it=s.lower_bound({p[i].se-m,0});
            while(it!=s.end() && it->fi<=p[i].se+m){
                if(++cnt>k) return false;
                if(t) ans.push_back(max(p[i].fi-p[it->se].fi,abs(p[i].se-p[it->se].se)));
                it++;
            }
            s.insert({p[i].se,i});
        }
        return true;
    };
    int l=0,r=4e9;
    while(r>l){
        int mid=(l+r+1)>>1;
        if(check(mid,0)) l=mid;
        else r=mid-1;
    }
    check(l,1);
    sort(ans.begin(),ans.end());
    for(int x:ans) cout << x << '\n';
    for(int i=0;i<k-(int)ans.size();i++) cout << l+1 << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Compilation message (stderr)

road_construction.cpp: In lambda function:
road_construction.cpp:64:63: warning: operation on 'j' may be undefined [-Wsequence-point]
   64 |             while(j<i && p[i].fi-p[j].fi>m) s.erase({p[j].se,j++});
      |                                                              ~^~

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