Submission #1000449

#	Time	Username	Problem	Language	Result	Execution time	Memory
1000449		Mardonbekhazratov	Closing Time (IOI23_closing)	C++17	8 / 100	53 ms	17236 KiB

closing

// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
#include "closing.h"
#include <queue>
#include <vector>

using namespace std;

#define ff first
#define ss second

vector<vector<pair<int,int>>>v;
vector<bool>vis;

int max_score(int N, int X, int Y, long long K,
              vector<int> U, vector<int> V, vector<int> W){
    v.assign(N,vector<pair<int,int>>(0));
    vis.assign(N,false);
    for(int i=0;i<N-1;i++){
        v[U[i]].push_back({V[i],W[i]});
        v[V[i]].push_back({U[i],W[i]});
    }
    priority_queue<pair<long long,int>>q;
    int ans=2;
    vis[X]=true;
    vis[Y]=true;
    for(auto [z,w]:v[X]) q.push({-w,z});
    for(auto [z,w]:v[Y]) q.push({-w,z});
    while(!q.empty()){
        auto [d,x]=q.top();
        q.pop();
        if(K+d<0){
            break;
        }
        K+=d;
        vis[x]=true;
        ans++;
        for(auto [z,w]:v[x]) if(!vis[z]) q.push({d-w,z});
    }
    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