제출 #57067

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
57067		IvanC	Cities (BOI16_cities)	C++17	51 / 100	6035 ms	115704 KiB

cities

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

typedef long long ll;
typedef pair<ll,ll> ii;
typedef tuple<ll,int,int> trinca;

const int MAXN = 2*1e5 + 10;
const int MAXK = 7;
const int MAXL = 35;
const ll INF = 1e15;

vector<ii> grafo[MAXN]; 
ll matriz[MAXN][MAXK];
int N,K,M,qual[MAXK],processado[MAXN];
int jafoi[MAXN][MAXL];

void Dijkstra(int idx){
	memset(processado,0,sizeof(processado));
	priority_queue<ii, vector<ii> , greater<ii> > pq;
	pq.push(ii(0,qual[idx]));
	while(!pq.empty()){
		ii davez = pq.top();
		pq.pop();
		int v = davez.second;
		ll path = davez.first;
		if(processado[v]) continue;
		processado[v] = 1;
		matriz[v][idx] = path;
		for(ii aresta : grafo[v]){
			int u = aresta.first;
			ll w = aresta.second;
			pq.push(ii(path + w,u));
		}
	}
}

int main(){
	cin.tie(0);ios_base::sync_with_stdio(0);
	cin >> N >> K >> M;
	for(int i = 0;i<K;i++){
		cin >> qual[i];
	}
	for(int i = 1;i<=M;i++){
		int u,v,w;
		cin >> u >> v >> w;
		grafo[u].push_back(ii(v,w));
		grafo[v].push_back(ii(u,w));
	}
	for(int i = 0;i<K;i++) Dijkstra(i);
	set<trinca> pq;
	for(int i = 0;i<K;i++){
		pq.insert(make_tuple(0,(1 << i),qual[i]));
	}
	int alvo = (1 << K) - 1;
	while(!pq.empty()){
		trinca davez = *(pq.begin());
		pq.erase(pq.begin());
		ll path = get<0>(davez);
		int bitmask = get<1>(davez), v = get<2>(davez);
		if(jafoi[v][bitmask]) continue;
		jafoi[v][bitmask] = 1;
		if(bitmask == alvo){
			cout << path << endl;
			return 0;
		}
		for(int i = 0;i<K;i++){
			if(bitmask & (1 << i)) continue;
			int mascara = bitmask | (1 << i);
			if(!jafoi[v][mascara]) pq.insert(make_tuple(path + matriz[v][i],mascara, v ));
		}
		for(ii aresta : grafo[v]){
			int u = aresta.first;
			ll w = aresta.second;
			if(!jafoi[u][bitmask]) pq.insert(make_tuple(path + w,bitmask,u));
		}
	}
	
	return 0;
	
}

• Subtask 1: 22 / 22
• Subtask 2: 14 / 14
• Subtask 3: 15 / 15
• Subtask 4: 0 / 23
• Subtask 5: 0 / 26