Submission #990833

#	Time	Username	Problem	Language	Result	Execution time	Memory
990833		12345678	Road Construction (JOI21_road_construction)	C++17	6 / 100	478 ms	57576 KiB

road_construction

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=250005;

ll n, k, x[nx], y;
set<pair<ll, ll>> s;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>k;
    for (int i=0; i<n; i++) cin>>x[i]>>y;
    sort(x, x+n);
    priority_queue<tuple<ll, ll, ll>, vector<tuple<ll, ll, ll>>, greater<tuple<ll, ll, ll>>> pq;
    for (int i=0; i<n-1; i++) pq.push({x[i+1]-x[i], i, i+1}), s.insert({i, i+1});
    for (int t=1; t<=k; t++)
    {
        auto [d, a, b]=pq.top();
        pq.pop();
        cout<<d<<'\n';
        if (a!=0&&s.find({a-1, b})==s.end()) pq.push({x[b]-x[a-1], a-1, b}), s.insert({a-1, b});
        if (b!=n-1&&s.find({a, b+1})==s.end()) pq.push({x[b+1]-x[a], a, b+1}), s.insert({a, b+1});
    }
}

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