제출 #396383

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
396383		4fecta	Road Construction (JOI21_road_construction)	C++17	5 / 100	2105 ms	2097156 KiB

road_construction

#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define int ll
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define boost() cin.tie(0), cin.sync_with_stdio(0)

const int MN = 250005;

int n, k, x, y;
pii a[MN];

int cost(pii p, pii q) {
    return max(abs(p.f - q.f), abs(p.s - q.s));
}

bool cmp(pii p, pii q) {
    return cost(a[p.f], a[p.s]) > cost(a[q.f], a[q.s]);
}

int32_t main() {
    boost();

    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> x >> y;
        a[i] = {x + y, x - y};
    }
    vector<int> v;
    for (int i = 1; i <= n; i++) {
        for (int j = i + 1; j <= n; j++) {
            v.push_back(cost(a[i], a[j]));
        }
    }
    sort(v.begin(), v.end());
    for (int i = 1; i <= k; i++) printf("%lld\n", v[i - 1]);

    return 0;
}

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