Submission #1006961

#	Time	Username	Problem	Language	Result	Execution time	Memory
1006961		3as8	Closing Time (IOI23_closing)	C++17	0 / 100	82 ms	30780 KiB

closing

#include "closing.h"

#include <vector>
#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 10;


#define ll long long
#define pll pair<ll, ll>

ll n;
vector<pair<ll, ll> > graph[N];
ll dist[N][2];

void dfs(ll startIndex, ll ind, ll p = -1, ll dep = 0) {


    dist[startIndex][ind] = dep;
    for(auto [el, w] : graph[startIndex]) {
        if(el == p) continue;

        dfs(el, ind, startIndex, dep + dep + w);
    }

}

int max_score(int N, int X, int Y, long long K, std::vector<int> U, std::vector<int> V, std::vector<int> W) {

    n = N;
    for(int i = 0 ; i < n; i++ ) {
        graph[i].clear();
    }

    for(int i = 0; i < n - 1; i++) {
        graph[U[i]].push_back({V[i], W[i]});
        graph[V[i]].push_back({U[i], W[i]});
    }

    dfs(X, 0);
    dfs(Y, 1);

    for(int i= 0; i < n; i++) {

        //cout<<i<<" "<<dist[i][0]<<" "<<dist[i][1]<<endl;
    }

    priority_queue<pll, vector<pll>, greater<pll> > pq;
    for(int i = 0; i < n; i++) {
        if(dist[i][0] < dist[i][1]) {
            pq.push({dist[i][0], i});
            dist[i][1] -= dist[i][0];
            dist[i][0] = -1;
        } else {
            pq.push({dist[i][1], i});
            dist[i][0] -= dist[i][1];
            dist[i][1] = -1;
        }
    }

    ll curr = 0;
    ll ans = 0;
    while(!pq.empty()) {

        auto [dista, node] = pq.top();
        pq.pop();

        //cout<<" = > "<<dista<<" "<<node<<endl;

        if(curr + dista <= K) {
            ans += 1;
            curr += dista;

            if(dist[node][0] != -1) {
                pq.push({dist[node][0], node});
                dist[node][0] = -1;
            }
             if(dist[node][1] != -1) {
                pq.push({dist[node][1], node});
                dist[node][1] = -1;
            }
        }  else break;
    }

    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 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