제출 #1157926

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1157926		arkanefury	Road Construction (JOI21_road_construction)	C++17	12 / 100	9595 ms	21044 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;
void solve(){
    cin >> n >> m;
    vector<pair<int, int>>v;
    FOR(i, 1, n, 1)cin >> a[i] >> b[i], v.pb({b[i], a[i]});
    sort(all(v));
    FOR(i, 1, n, 1){
        b[i] = v[i-1].F, a[i] = v[i-1].S;
    }
    multiset<int>st;
    st.in(1e18);
    ans = 1e18;
    FOR(i, 1, n, 1){
        FOR(j, i+1, min(n, i+15000), 1){
           ans  = abs(a[i]-a[j]) + abs(b[i]-b[j]);
           if(m == st.sz){
               if(*st.rbegin() > ans)st.erase(*st.rbegin()), st.in(ans);
           }
           else
                st.in(ans);
            }
    }
    for(auto i : st){
        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: 0 / 6
• Subtask 3: 7 / 7
• Subtask 4: 0 / 20
• Subtask 5: 0 / 27
• Subtask 6: 0 / 35