Submission #1081894

#	Time	Username	Problem	Language	Result	Execution time	Memory
1081894		LaMatematica14	Closing Time (IOI23_closing)	C++17	8 / 100	114 ms	27592 KiB

closing

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

int max_score(int N, int X, int Y, long long K,vector<int> U, vector<int> V, vector<int> W) {
    vector<vector<array<long long, 2>>> adj(N);
    for (long long i = 0; i < N-1; i++ ) {
        adj[U[i]].push_back({V[i], W[i]});
        adj[V[i]].push_back({U[i], W[i]});
    }
    vector<long long> d;
    vector<long long> dx(N, 1e15); dx[X] = 0;
    priority_queue<pair<long long, long long>> pq; 
    pq.push({0, X});
    while (!pq.empty()) {
        long long a = pq.top().second; pq.pop();
        for (auto x : adj[a]) {
            if (dx[x[0]] > dx[a]+x[1]) {
                dx[x[0]] = dx[a]+x[1];
                pq.push({-dx[x[0]], x[0]});
            }
        }
    }
    vector<long long> dy(N, 1e15); dy[Y] = 0;
    pq.push({0, Y});
    while (!pq.empty()) {
        long long a = pq.top().second; pq.pop();
        for (auto x : adj[a]) {
            if (dy[x[0]] > dy[a]+x[1]) {
                dy[x[0]] = dy[a]+x[1];
                pq.push({-dy[x[0]], x[0]});
            }
        }
    }
    for (long long i = 0; i < N; i++) {
        d.push_back(dx[i]); d.push_back(dy[i]);
    }
    sort(d.begin(), d.end());
    long long att = 0, k = 0;
    while (k < 2*N && att+d[k] <= K) {
        att += d[k]; k++;
    }
    return k;
}

• Subtask 0: 0 / 0
• Subtask 1: 8 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 9
• Subtask 6: 0 / 11
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 17