Submission #1370304

#	Time	Username	Problem	Language	Result	Execution time	Memory
1370304		dssfsuper2	Closing Time (IOI23_closing)	C++20	0 / 100	66 ms	17100 KiB

closing

#include "closing.h"

#include <vector>
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
vector<vector<pii>> adj;
int n;
void dfs(int node, int cdist=0){

}
int max_score(int N, int X, int Y, long long K, vector<int> U, vector<int> V, vector<int> W){
    n=N;
    adj.assign(n+1, {});
    for(int i = 0;i<n-1;i++){
        //cerr << U[i] << ' ' << V[i] << ' ' << W[i] << " e\n";
        adj[U[i]].push_back({V[i], W[i]});
        adj[V[i]].push_back({U[i], W[i]});
    }
    int spent=0;
    int res =0;
    set<vector<int>> avl={{0, X, -1}, {0, Y, -1}};
    while(spent<K && !avl.empty()){
        auto top = *(avl.begin());
        //cerr << top[0] << ' ' << top[1] << ' ' << top[2] << " h\n";
        avl.erase(avl.begin());
        auto f=top[0];
        if(spent+f>K)break;
        spent+=f;
        res++;
        for(auto thing:adj[top[1]]){
            if(thing.first==top[2])continue;
            avl.insert({f+thing.second, thing.first, top[1]});
        }
    }
    return res;
}

• 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