Submission #1157970

#	Time	Username	Problem	Language	Result	Execution time	Memory
1157970		arkanefury	Road Construction (JOI21_road_construction)	C++17	0 / 100	10093 ms	31556 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 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;
map<pair<int, int>, int>check, mp1;
void solve(){
    cin >> n >> m;
    FOR(i, 1, n, 1)cin >> a[i] >> b[i], v.pb({a[i], b[i]}), mp1[{a[i], b[i]}] = 1;
    sort(all(v));
    FOR(i, 1, n, 1){
        a[i] = v[i-1].F,b[i] = v[i-1].S;
    }
    multiset<long long>st2;
    st2.in(1e18);
    long long ans = 1e18;
    FOR(i, 1, n, 1){
        FOR(j, i+1, min(n, i+3000), 1){
            check[{mp1[{a[i], b[i]}], mp1[{a[j], b[j]}]}] = 1;
            check[{ mp1[{a[j], b[j]}], mp1[{a[i], b[i]}] }] = 1;
           ans  = abs(a[i]-a[j]) + abs(b[i]-b[j]);
           if(m == st2.sz){
               if(*st2.rbegin() > ans)st2.erase(*st2.rbegin()), st2.in(ans);
           }
           else
                st2.in(ans); 
            }
    }
    v.clear();
    FOR(i, 1, n, 1)v.pb({b[i], a[i]});
    sort(all(v));
    FOR(i, 1, n, 1)a[i] = v[i-1].S, b[i] = v[i-1].F;
    FOR(i, 1, n, 1){
        FOR(j, i+1, min(n, i+3000), 1){
            if(check[{mp1[{a[i], b[i]}], mp1[{a[j], b[j]}]}])continue;
            ans  = abs(a[i]-a[j]) + abs(b[i]-b[j]);
           if(m == st2.sz){
               if(*st2.rbegin() > ans)st2.erase(*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: 0 / 5
• Subtask 2: 0 / 6
• Subtask 3: 0 / 7
• Subtask 4: 0 / 20
• Subtask 5: 0 / 27
• Subtask 6: 0 / 35