Submission #1357920

#	Time	Username	Problem	Language	Result	Execution time	Memory
1357920		maya_s	Closing Time (IOI23_closing)	C++20	8 / 100	137 ms	44972 KiB

closing

#include "closing.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;

void calc_dist(ll n, ll p, vector<ll> &dist, vector<vector<pll>> &g){
    for(auto[i, d]: g[n]) if(i != p){
        dist[i] = dist[n] + d;
        calc_dist(i, n, dist, g);
    }
}

int max_score(int N, int X, int Y, long long k, vector<int> u, vector<int> v, vector<int> w)
{
    ll n = N, x = X, y = Y;
    vector<vector<pll>> g(n);
    for(ll i = 0; i < n-1; i++) g[u[i]].push_back({v[i], w[i]}), g[v[i]].push_back({u[i], w[i]});
    vector<vector<ll>> dist(2, vector<ll>(n));
    calc_dist(x, -1, dist[0], g);
    calc_dist(y, -1, dist[1], g);
    priority_queue<pll, vector<pll>, greater<pll>> pq;
    for(ll i = 0; i < n; i++) pq.push({dist[0][i], i}), pq.push({dist[1][i], i});
    ll ans = 0;
    while(pq.size()){
        auto[d, node] = pq.top(); pq.pop();
        if(k - d < 0) continue;
        k -= d;
        ans++;
    }
    return ans;
}

• 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