제출 #1157985

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1157985		arkanefury	Road Construction (JOI21_road_construction)	C++17	100 / 100	4288 ms	48564 KiB

road_construction

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define in insert
#define lb lower_bound
#define F first
#define S second
#define sz size()
#define int long long
#define all(v) v.begin(),v.end()
#define FOR1(x, n) for(int j = x; j <= n; j ++)
#define FOR(x, n, m, d) for(int x = n; x <= m; x += d)
#define FORR(x, n, m, d) for(int x = n; x >= m; x -= d)
#define nikita ios_base::sync_with_stdio(0), cin.tie(0);
const int N =  3e5+5;
int n,m,k,sum=0,x,y, ans, r, cnt, l, mod = 1e9+7, dp[N], a[N], b[N];
string s, str;
multiset<pair<int, int>>st;
vector<pair<int, int>>v;
void yzero(){
    l = 1, r = 1e10;
    cnt = 0;
    while(l <= r){
        ans = 0;
        int md = (l + r) >> 1;
        FOR(i, 1, n, 1){
            cnt++;
            pair<int, int>ko = *st.lb({md + a[i]+1, i});
            if(ko.S==1e10)ko.F = v[v.sz-1].F, ko.S = n;
            else ko.F = v[ko.S-2].F, ko.S--;
            ans += (ko.S - i);
        }
        if(ans >= m)r = md - 1;
        else l = md + 1;
    }
    multiset<int>st1;
    FOR(i, 1, n, 1){
        pair<int, int>ko = *st.lb({l + a[i]+1, i});
        if(ko.S == 1e10)ko.F = a[n], ko.S=n;
        else ko.F = v[ko.S-2].F, ko.S--;
        FOR(j, i+1, ko.S, 1)st1.in(a[j]-a[i]);
    }
    for(auto i : st1){
        cout << i << '\n';
        m--;
        if(!m)return;
    }
}
void solve(){
    cin >> n >> m;
    int ok = -1e10;
    FOR(i, 1, n, 1)cin >> a[i] >> b[i], v.pb({a[i], b[i]}), ok = max(ok, b[i]);
    if(!ok){
        
        sort(all(v));
    FOR(i, 1, n,  1){
        st.in({v[i-1].F, i});
    }
    FOR(i,1,n,1)a[i] = v[i-1].F;
    st.in({1e10, 1e10});
    yzero();
    return;
    
    }
    
    sort(all(v));
    FOR(i, 1, n, 1){
        a[i] = v[i-1].F,b[i] = v[i-1].S;
    }
    multiset<int>st2;
    st2.in(1e18);
    ans = 1e18;
    FOR(i, 1, n, 1){
        FOR(j, i+1, min(n, i+5000), 1){
           ans  = abs(a[i]-a[j]) + abs(b[i]-b[j]);
           if(m == st2.sz){
               if(*st2.rbegin() > ans)st2.erase(st2.find(*st2.rbegin())), st2.in(ans);
           }
           else{
                st2.in(ans);
            }
            }
    }
    for(auto i : st2){
        cout<<i<<'\n';
        m --;
        if(!m)break;
    }
}
signed main(){
    nikita
    int tt = 1;
    if(!tt)cin >> tt;
    FOR(i, 1, tt, 1)solve();
}

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