Submission #1059643

#	Time	Username	Problem	Language	Result	Execution time	Memory
1059643		tolbi	Closing Time (IOI23_closing)	C++17	8 / 100	67 ms	24656 KiB

closing

#include "closing.h"

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

int max_score(int N, int X, int Y, long long K,
  std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
    vector<vector<pair<int,long long>>> arr(N);
    for (int i = 0; i < N-1; i++){
        arr[U[i]].push_back({V[i],W[i]});
        arr[V[i]].push_back({U[i],W[i]});
    }
    priority_queue<array<long long,3>,vector<array<long long,3>>,greater<array<long long,3>>> pq;
    pq.push({0,X,1});
    pq.push({0,Y,0});
    int say = 0;
    vector<int> vis(N,0);
    while (pq.size()){
        int node = pq.top()[1];
        long long w = pq.top()[0];
        int flag = pq.top()[2];
        pq.pop();
        if (vis[node]&(1<<flag)) continue;
        vis[node]+=(1<<flag);
        if (K<w) break;
        say++;
        K-=w;
        for (auto it : arr[node]){
            pq.push({w+it.second,it.first,flag});
        }
    }
    return say;
}

• 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