제출 #1070437

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1070437		Marco_Escandon	Closing Time (IOI23_closing)	C++17	8 / 100	69 ms	24804 KiB

closing

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define x first
#define y second
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<ll,ll>>> cad(n+2);
    for(int i=0; i<n-1; i++)
    {
        cad[U[i]].push_back({V[i],W[i]});
        cad[V[i]].push_back({U[i],W[i]});
    }
    priority_queue<pair<ll,ll>> q;q.push({0,X});q.push({0,Y});
    vector<ll> v(n+2,-1);
    ll cont=0;
    while(!q.empty())
    {
        pair<ll,ll> a=q.top();q.pop();
        if(K>=-a.x&&v[a.y]==-1)
        {
            v[a.y]=-a.x;
            K+=a.x;
            cont++;
            for(auto i:cad[a.y])
            {
                q.push({a.x+-i.y,i.x});
            }
        }
    }
    return cont;
}

• 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