Submission #589733

#	Time	Username	Problem	Language	Result	Execution time	Memory
589733		Valaki2	Road Construction (JOI21_road_construction)	C++14	5 / 100	68 ms	8452 KiB

road_construction

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define fi first
#define se second

inline int dist(pii a, pii b) {
    return abs(a.fi - b.fi) + abs(a.se - b.se);
}

int n, k;
vector<pii > points;

void solve() {
    cin >> n >> k;
    points.assign(n, mp(0, 0));
    for(int i = 0; i < n; i++) {
        cin >> points[i].fi >> points[i].se;
    }
    vector<int > v(n * (n - 1) / 2);
    int idx = -1;
    for(int i = 0; i < n; i++) {
        for(int j = i + 1; j < n; j++) {
            idx++;
            v[idx] = dist(points[i], points[j]);
        }
    }
    sort(v.begin(), v.end());
    for(int i = 0; i < k; i++) {
        cout << v[i] << "\n";
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    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