제출 #1157688

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1157688		timoni	Road Construction (JOI21_road_construction)	C++20	5 / 100	10107 ms	380096 KiB

road_construction

// made by Tima
// 2025 will be a golden year...
//BREAK YOUR LIMITS!!!!
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define int long long
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define pii pair<int,int>
#define tpii pair <pair <int,int> , int>
using namespace std;
using namespace __gnu_pbds;
const int N = 3e5 + 5;
int mod = 1e9 + 7;
const int INF = 1e18;
int n,k,a[N],b[N];
void Gold(){
	cin >> n >> k;
	for(int i = 1 ; i <= n ; i++){
		cin >> a[i] >> b[i];
	}
	multiset <int> q;
	for(int i = 1 ; i <= n ; i++){
		for(int j = i + 1 ; j <= n ; j++){
			// cout << abs(a[i] - a[j]) + abs(b[i] - b[j]) << '\n';
			q.insert(abs(a[i] - a[j]) + abs(b[i] - b[j]));
		}
	}
	int cnt = 0;
	for(auto it : q){
		cout << it << '\n';
		cnt++;
		if(cnt == k){
			break;
		}
	}
}
signed main(/*Zhunussov Temirlan*/){
	//freopen("txt.in","r",stdin);freopen("txt.out","w",stdout);
	ios_base::sync_with_stdio(0);cin.tie(0);
	srand(time(0));
	int TT = 1;
	// cin >> TT;
	for(int i = 1 ; i <= TT ; i++){
		//cout << "Case " << i << ": ";
		Gold();
	}
}

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