제출 #914182

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

closing

#include <bits/stdc++.h>
#include "closing.h"

using namespace std;
#define int long long

vector<vector<pair<int,int>>> edges;

signed max_score(signed N, signed rootX, signed rootY, long long K, std::vector<signed> U, std::vector<signed> V, std::vector<signed> W){
    edges.clear();
    edges.resize(N);
    for (int i = 0; i < N-1; i++)
    {
        edges[U[i]].push_back({V[i], W[i]});
        edges[V[i]].push_back({U[i], W[i]});
    }
    vector<int> visited(N);
    priority_queue<pair<int,int>> krusk;
    krusk.push({0,rootX});
    krusk.push({0,rootY});
    int sum=0;
    int cnt=-2;
    while(!krusk.empty()){
        int x=krusk.top().second, sumw=abs(krusk.top().first); krusk.pop();
        if(sum+sumw>K) continue;
        visited[x]=true;
        sum+=sumw;
        cnt++;
        for (auto u : edges[x])
        {
            int v=u.first,w=u.second;
            if(visited[v]) continue;
            krusk.push({-(sumw+w), v});
        }
        
    }
    return (int)cnt;
}

• 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