제출 #839997

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

closing

#include "closing.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;

ll n, x, y, ch[202020], ans;
ll k;
vector<pll> adj[202020];
priority_queue<pll> pq;

int max_score(int N, int X, int Y, ll K, vector<int> U, vector<int> V, vector<int> W) {
    n = N, x = X, y = Y, k = K;

    ans = 0;
    for (ll i = 0; i < n; i++) ch[i] = 0;
    for (ll i = 0; i < n; i++) adj[i].clear();
    if (!pq.empty()) pq.pop();

    for (ll i = 0; i < (ll)U.size(); i++) {
        adj[U[i]].push_back({V[i], W[i]});
        adj[V[i]].push_back({U[i], W[i]});
    }

    pq.push({-0, x});
    pq.push({-0, y});

    while (!pq.empty()) {
        ll v = pq.top().second; ll w = -pq.top().first;
        pq.pop();
        //cout << v << " " << w << "\n";
        if (k - w >= 0) {
            ans++;
            k -= w;
        }
        else break;
        
        ch[v] = 1;
        for (ll i = 0; i < (ll)adj[v].size(); i++) {
            if (ch[adj[v][i].first] == 1) continue;
            pq.push({-w-adj[v][i].second, adj[v][i].first});
        }
    }

    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