제출 #1157703

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

road_construction

#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define pb push_back
#define F first
#define S second
#define in insert

using namespace std;
typedef long long ll;

typedef unsigned long long ull;

const int N = 1e5 + 123;

const int P = 320;

const int mod = 1e9 + 7;

ll n, m, k;

ll a[N], b[N];

void salemkhan() {
	cin >> n >> k;
	
	vector <ll> v;
	
	for(int i = 1; i <= n; i++) {
		cin >> a[i] >> b[i];
		
		v.pb(a[i]);
	}
	
	sort(all(v));
		
	vector <ll> ans;
		
	if(n <= 1000) {
		
	for(int i = 1; i <= n; i++) {
		for(int j = i + 1; j <= n; j++) {
			ll cost = abs(a[i] - a[j]) + abs(b[i] - b[j]);
			
			ans.pb(cost);
		}
	}
	
	sort(all(ans));
	
	for(int i = 0; i < k; i++) cout << ans[i] << '\n';
	
	}
	
	else {
		for(int i = 0; i < v.size() - 1; i++) {
			ans.pb(abs(v[i + 1] - v[i]));
		}
		
		sort(all(ans));
		
		for(int i = 0; i < k; i++) cout << ans[i] << ' ';
	}
}
	
// 28 37 48 49 55 56 57 58 67 9

// 9 + 1 +

int main() {

    //freopen("knight.in",   "r", stdin);

    //freopen("knight.out", "w", stdout);

    ios_base::sync_with_stdio(0);

    cin.tie(0);

    cout.tie(0);

    ll tt = 1;

	//cin >> tt;

    while(tt--) {
        salemkhan();
    }
}

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