제출 #944947

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
944947		bngybongybrd	Road Construction (JOI21_road_construction)	C++17	5 / 100	10130 ms	1078832 KiB

road_construction

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

int n, k;
vector<pair<int, pair<int, int>>> towns;
map<pair<int, int>, int> check;
vector<int> cost;

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> n >> k;

    for(int i = 0; i < n; i++){
        int x, y;
        cin >> x >> y;
        towns.push_back({i, {x, y}});
    }

    for(auto i: towns){
        for(auto j: towns){
            if(i.first == j.first) continue;
            if(check.count({i.first, j.first}) == 1 || check.count({j.first, i.first}) == 1) continue;
            int sum = 0;
            sum += abs(i.second.first - j.second.first) + abs(i.second.second - j.second.second);
            cost.push_back(sum);
            check[{i.first, j.first}] = 1;
        }
    }
    sort(cost.begin(), cost.end());
    for(int i = 0; i < k; i++){
        cout << cost.at(i) << "\n";
    }

    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