Submission #1060404

#	Time	Username	Problem	Language	Result	Execution time	Memory
1060404		n1k	Closing Time (IOI23_closing)	C++17	8 / 100	99 ms	38196 KiB

closing

#include "closing.h"
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

int max_score(int N, int X, int Y, long long K, vector<int> U, vector<int> V, vector<int> W){
    vector<vector<array<int, 2>>> g(N);
    vector c(2, vector<ll>(N));

    for(int i=0; i<N-1; i++){
        g[U[i]].push_back({V[i], W[i]});
        g[V[i]].push_back({U[i], W[i]});
    }
    function<void(int, int, vector<ll>&)> dfs = [&](int u, int p, vector<ll> &c){
        for(auto [v, cost]:g[u]){
            if(v==p){
                continue;
            }
            c[v]+=c[u] + cost;
            dfs(v, u, c);
        }
    };

    dfs(X, -1, c[0]);
    dfs(Y, -1, c[1]);

    int ans = 0;
    vector vis(2, vector<int>(N));
    priority_queue<array<ll, 3>, vector<array<ll, 3>>, greater<array<ll, 3>>> pq;
    // (cost, node, start x or y)
    pq.push({0, X, 0});
    pq.push({0, Y, 1});
    while(pq.size()){
        auto [cost, u, start] = pq.top();
        pq.pop();
        if(vis[start][u]){
            continue;
        }
        vis[start][u]=1;
        if(K<cost){
            break;
        }
        cerr << u << " " << cost << " " << start << endl;
        ans++;
        K-=cost;
        for(auto [v, _]:g[u]){
            pq.push({c[start][v], v, start});
        }
    }
    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