제출 #1305460

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1305460		aaaaaaaa	봉쇄 시간 (IOI23_closing)	C++20	0 / 100	49 ms	17100 KiB

closing

#include "closing.h"
#include <bits/stdc++.h>
using namespace std;

const int mxN = 2e5 + 100;

vector<pair<int, int>> adj[mxN];

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) adj[i].clear();

    for(int i = 1; i <= N; ++i){
        adj[U[i]].push_back({V[i], W[i]});
        adj[V[i]].push_back({U[i], W[i]});
    }

    queue<pair<int, int>> pq;

    pq.push({0, X}), pq.push({0, Y});

    vector<bool> vis(N + 5, 0);

    vis[X] = vis[Y] = 1;

    int ans = 0;

    vector<int> dist;

    while(pq.size()){
        auto tp = pq.front();
        pq.pop();
        dist.push_back(tp.first);
        vis[tp.second] = 1;
        for(auto it : adj[tp.second]){
            if(!vis[it.first]){
                pq.push({it.second + tp.first, it.second});
                vis[it.first] = 1;
            }
        }
    }

    sort(dist.begin(), dist.end());

    for(auto it : dist){
        K -= it;
        if(K < 0) break;
        ans += 1;
    }

    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