제출 #1006726

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1006726		De3b0o	봉쇄 시간 (IOI23_closing)	C++17	0 / 100	59 ms	25376 KiB

closing

#include "closing.h"
#include<bits/stdc++.h>
#include<random>
#define ll long long
#define F first
#define S second
#define in insert
#define pb push_back
#define ppb pop_back()
#define d3 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define cans cout << ans << "\n";
#define yes cout << "Yes" << "\n";
#define no cout << "No" << "\n";
#define pll pair<ll,ll>
#define lin cout << "\n";
#define sqr 340
#define mod 1000000007
#define mid ((l+r)/2)
#define lc (2*n)
#define rc (2*n+1)

using namespace std;

ll n , x , y , k;
vector<pll> adj[200009];
ll vis[200009];

int max_score(int N, int X, int Y, long long K,std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
    n=N;
    x=X;
    y=Y;
    k=K;
    for(int i = 0 ; n-1>i ; i++)
    {
        adj[U[i]].pb({V[i],W[i]});
        adj[V[i]].pb({U[i],W[i]});
    }
    priority_queue<pll> q;
    q.push({0,x});
    q.push({0,y});
    ll ans = 0;
    while(!q.empty())
    {
        auto nod = q.top();
        q.pop();
        if(-nod.F>k)
            break;
        k+=nod.F;
        ans++;
        vis[nod.S]=1;
        for(auto it : adj[nod.S])
        {
            if(vis[it.F])
                continue;
            q.push({nod.F-it.S,it.F});
        }
    }
    return ans;
}

• 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