Submission #404910

#	Time	Username	Problem	Language	Result	Execution time	Memory
404910		dvdg6566	Road Construction (JOI21_road_construction)	C++14	5 / 100	2181 ms	2097156 KiB

road_construction

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector<ll> vi;
typedef vector<pi> vpi;
#define pb emplace_back
#define f first 
#define s second
#define mp make_pair
#define SZ(x) (ll)x.size()
#define ALL(x) x.begin(),x.end()
#define lb lower_bound
#define ub upper_bound
 
const ll MAXN=250100;
const ll MAXK=19;

ll N,K,a,b;
vpi V;
vector<pair<pi,int>> A;
vpi ans;
ll W;

ll d(int a,int b){
    return abs(V[a].f-V[b].f) + abs(V[a].s-V[b].s);
}

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>N>>K;
    for(ll i=0;i<N;++i){
        cin>>a>>b;
        V.pb(a,b);
        A.pb(mp(b-a,b+a),i);
    }
    vi ans;
    for(int i=0;i<N;++i)for(int j=i+1;j<N;++j){
        ans.pb(d(i,j));
    }
    sort(ALL(ans));
    for(int i=0;i<K;++i)cout<<ans[i]<<'\n';
}

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