제출 #848584

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

closing

#include "closing.h"

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

typedef long long ll;
typedef pair<int, int> pii;

int visited[MAX];
vector<pii> graph[MAX];
int max_score(int N, int X, int Y, long long K, vector<int> U, vector<int> V, vector<int> W)
{
    for(int i = 0; i < N; ++i) visited[i] = 0;
    for(int i = 0; i < N; ++i) graph[i].clear();
    for(int i = 0; i < N - 1; ++i) {
        graph[U[i]].push_back({V[i], W[i]});
        graph[V[i]].push_back({U[i], W[i]});
    }
    
    int ans = 0;
    priority_queue<pair<int, ll> > pq;
    pq.push({X, 0}); pq.push({Y, 0});
    while(!pq.empty()) {
        int node = pq.top().first;
        int dist = -pq.top().second;
        pq.pop();
        
        if(visited[node]) continue;
        visited[node] = 1;
        
        if(dist > K) break;
        K -= dist; ++ans;
        for(auto v : graph[node]) pq.push({v.first, -v.second});
    }
    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