제출 #980101

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
980101		vjudge1	봉쇄 시간 (IOI23_closing)	C++17	8 / 100	71 ms	22096 KiB

closing

#include "closing.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector <ll>;
using vi = vector <int>;

const ll MAXN = 2E5+16;
vector <pair <ll, ll> > adj[MAXN];

int max_score (int n, int u1, int u2, ll k, vi u, vi v, vi w) {
    fill(adj, adj+n, vector <pair <ll, ll> > ({}));
    for (ll i = 0; i < n-1; i++) {
        adj[u[i]].push_back({ v[i], w[i] });
        adj[v[i]].push_back({ u[i], w[i] });
    }
    vll dis(n);
    vector <char> vis(n, false);
    priority_queue <pair <ll, ll> > pq;
    dis[u1] = 0;
    dis[u2] = 0;
    pq.push({ 0, u1 });
    pq.push({ 0, u2 });
    ll ans = 0;
    while (pq.size()) {
        ll u = pq.top().second; pq.pop();
        if (k-dis[u] < 0) break;
        k -= dis[u];
        vis[u] = true;
        ans++;
        for (auto [v, w] : adj[u]) {
            if (vis[v]) continue;
            dis[v] = dis[u]+w;
            pq.push({ -dis[v], v });
        }
    }
    return int(ans);
}

• 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