Submission #1232655

#	Time	Username	Problem	Language	Result	Execution time	Memory
1232655		shenfe1	Road Construction (JOI21_road_construction)	C++20	5 / 100	2425 ms	2106096 KiB

road_construction

#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")

using namespace std;

#define pb push_back
#define sz(v) (int)v.size()
#define all(v) v.begin(),v.end()
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define int ll

const int MAX=2.5e5+10;
const int mod=1e9+7;
const int inf=2e9;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int binpow(int a,int n){
    if(!n)return 1;
    if(n&1)return a*binpow(a,n-1)%mod;
    int k=binpow(a,n/2);
    return k*k%mod;
}

int n,k;
int x[MAX],y[MAX];
int p[MAX];

void solve(){
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>x[i]>>y[i];
    }
    vector<int> ans;
    for(int i=1;i<=n;i++){
        for(int j=1;j<i;j++){
            ans.pb(abs(x[i]-x[j])+abs(y[i]-y[j]));
        }
    }
    sort(all(ans));
    for(int i=0;i<k;i++)cout<<ans[i]<<" ";
    cout<<"\n";
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--)solve();
}

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