제출 #993981

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

closing

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

vector<vector<pair<ll,ll>>>graph;
vector<bool> vis;
void dfs(vector<ll> &dist, int x, ll d){
    vis[x] = true;
    dist[x] = d;
    for (auto [y, w] : graph[x]){
        if (!vis[y]){
            dfs(dist, y, d + w);
        }
    }
}
int max_score(int N, int X, int Y, ll K, vector<int> U, vector<int> V, vector<int> W){
	graph.assign(N,vector<pair<ll,ll>>());
	for(int i=0;i<(N-1);i++){
		graph[U[i]].push_back({V[i],W[i]});
		graph[V[i]].push_back({U[i],W[i]});
	}
	//Calculo de distancia.
	vis.assign(N,false);
	vector<ll>distX(N);
	dfs(distX,X,0);
	vis.assign(N,false);
	vector<ll>distY(N);
	dfs(distY,Y,0);
	vector<ll>closing(N,0);
	priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>>prioridad;
	for(int i=0;i<N;i++){
		prioridad.push({distX[i],i});
	}
	for(int i=0;i<N;i++){
		prioridad.push({distY[i],i});
	}
	int ans=0;
	while(!prioridad.empty()){
		ll peso=prioridad.top().first;
		ll nodo=prioridad.top().second;
		prioridad.pop();
		if((K+closing[nodo])>=peso){
			K+=closing[nodo];
			K-=peso;
			closing[nodo]=peso;
			ans++;
		}
	}
	return 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