Submission #945721

#	Time	Username	Problem	Language	Result	Execution time	Memory
945721		teacup	Road Construction (JOI21_road_construction)	C++14	5 / 100	209 ms	12452 KiB

road_construction

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
typedef vector<int> vi;
#define iii tuple<int,int,int>
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef map<int,int> mii;

#ifndef debug
	#define cerr if (0) cerr
#endif
int N, K;
vi X,Y;
int32_t main(){
	cin>>N>>K;
	for (int i=0; i<N; i++){
		int a,b; cin>>a>>b;
		X.emplace_back(a); Y.emplace_back(b);
	}
priority_queue<int, vi, greater<int>> PQ;
	
	if (N<=1000){
		for (int i=0; i<N; i++){
			for (int j=i+1; j<N; j++){
				PQ.push(abs(X[i]-X[j])+abs(Y[i]-Y[j]));
				//cout<<i<<" "<<j<<abs(X[i]-X[j])+abs(Y[i]-Y[j])<<"\n";
			}
		}
	}else{
		sort(X.begin(), X.end());
		for (int i=1; i<N; i++){
			PQ.push(abs(X[i]-X[i-1]));
		}
	}
	
	for (int i=0; i<K; i++){
		cout<<PQ.top()<<"\n";
		PQ.pop();
	}
}

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