제출 #1157832

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1157832		gazizmadi11	Road Construction (JOI21_road_construction)	C++20	65 / 100	10091 ms	10324 KiB

road_construction

//gm  --- akezhon
#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define pb push_back
#define pf push_front
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define tm (tl+tr)/2
#define TL v+v, tl, tm
#define TR v+v+1, tm+1, tr
#define DA l <= tl && tr <= r
#define NE r < tl || tr < l
#define double long double
#define int long long 
using namespace std;

const int N=2.5e5+7;
const int mod=998244353;
const int inf=2e10;

int n, k;
pii a[N];

int check(int l, int r, int d){
    if(l==r)return 0;
    int m = (l+r)/2;
    vector<pii>v1, v2;
    // set<int>st1, st2;
    //possible y's on each side
    for(int i=l; i <= r; i++){
        if(abs(a[m].F-a[i].F) > d)continue;
        if(i <= m)v1.pb(a[i]);
        else v2.pb(a[i]);

        // if(i <= m)st1.insert(a[i].S);
        // else st2.insert(a[i].S);
    }
    int ans=0;
    for(auto x : v1){
        for(auto y : v2){
            if(abs(x.F-y.F)+abs(x.S-y.S) <= d)ans++;
            if(ans > k)return inf;
        }
    }
    return ans+check(l, m, d)+check(m+1, r, d);
}
vector<int>vec;
void show(int l, int r, int d){
    if(l==r)return;
    int m = (l+r)/2;
    vector<pii>v1, v2;
    // set<int>st1, st2;
    //possible y's on each side
    for(int i=l; i <= r; i++){
        if(abs(a[m].F-a[i].F) > d)continue;
        if(i <= m)v1.pb(a[i]);
        else v2.pb(a[i]);

        // if(i <= m)st1.insert(a[i].S);
        // else st2.insert(a[i].S);
    }
    int ans=0;
    for(auto x : v1){
        for(auto y : v2){
            if(abs(x.F-y.F)+abs(x.S-y.S) <= d)vec.pb(abs(x.F-y.F)+abs(x.S-y.S));
        }
    }
    show(l, m, d);
    show(m+1, r, d);
}
void AlemAmenov(){
    cin >> n >> k;
    for(int i=1; i <= n; i++){
        cin >> a[i].F >> a[i].S;
    }
    sort(a+1, a+1+n);
    int l=0, r=4e9, ans;
    while(l <= r){
        int m=(l+r)/2;
        if(k <= check(1, n, m))r=m-1, ans=m;
        else l=m+1;
    }
    if(check(1, n, ans) != k)ans--;
    show(1, n, ans);
    while(vec.size() != k)vec.pb(ans+1);
    sort(all(vec));
    for(int i : vec){
        cout << i << '\n';
    }
}
signed main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int RealName=1;
    // cin >> RealName;

    // freopen("newbarn.in", "r", stdin);
    // freopen("newbarn.out", "w", stdout);

    while(RealName--)
        AlemAmenov();
    
return 0;
}

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