제출 #988577

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

closing

#include "closing.h"

#include <bits/stdc++.h>
#include <functional>
#include <queue>
#define ll long long
#define ff first
#define ss second
#define ln endl
using namespace std;
vector<vector<int>> A;
ll n, x, y, k;
vector<pair<ll, pair<ll, ll>>> edge;
ll dijkstra(){
    priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> que;
    que.push({0, x});
    que.push({0, y});
    vector<bool> reachable(n, 0);
    while (!que.empty()){
        auto cur = que.top();
        que.pop();
        if (reachable[cur.ss] or k<cur.ff){
            continue;
        }
        // cout << cur.ss << ln;
        reachable[cur.ss]=1;
        k-=cur.ff;
        for (auto i:A[cur.ss]){
            auto v = edge[i].ss.ff^edge[i].ss.ss^cur.ss;
            if (reachable[v] or cur.ff+edge[i].ff>k) continue;
            que.push({cur.ff+edge[i].ff, v});
        }
    }
    ll ans=0;
    for (ll i=0; i<n; i++) {
        if (reachable[i]) {
            // cout << i << ln;
            ans++;
        }
    }
    return ans;
}
int max_score(int N, int X, int Y, long long K,
              std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
    A.resize(N);
    n=N; x=X; y=Y; k=K;
    for (ll i=0; i<n-1; i++){
        A[U[i]].push_back(i);
        A[V[i]].push_back(i);
        edge.push_back({W[i],{V[i], U[i]}});
    }
    return dijkstra();
}

• 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