제출 #1262618

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1262618		PlayVoltz	Cities (BOI16_cities)	C++20	100 / 100	1274 ms	44720 KiB

cities

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
#include <chrono>
#include <fstream>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, k, m, a, b, c;
	cin>>n>>k>>m;
	vector<vector<int> > dj((1<<k), vector<int>(n+1, LLONG_MAX/2));
	vector<vector<pii> > graph(n+1);
	for (int i=0; i<k; ++i)cin>>a, dj[(1<<i)][a]=0;
	while (m--){
		cin>>a>>b>>c;
		graph[a].pb(mp(b, c));
		graph[b].pb(mp(a, c));
	}
	for (int i=1; i<=n; ++i)dj[0][i]=0;
	for (int mask=0; mask<(1<<k); ++mask){
		vector<bool> visited(n+1, 0);
		priority_queue<pii, vector<pii>, greater<pii> > pq;
		for (int i=1; i<=n; ++i)for (int j=0; j<k; ++j)dj[mask][i]=min(dj[mask][i], dj[(1<<j)][i]+dj[mask^(1<<j)][i]);
		for (int i=1; i<=n; ++i)if (dj[mask][i]!=LLONG_MAX/2)pq.push(mp(dj[mask][i], i));
		while (pq.size()){
			int node=pq.top().se;
			pq.pop();
			if (visited[node])continue;
			visited[node]=1;
			for (auto num:graph[node])if (!visited[num.fi]&&dj[mask][node]+num.se<dj[mask][num.fi]){
				dj[mask][num.fi]=dj[mask][node]+num.se;
				pq.push(mp(dj[mask][num.fi], num.fi));
			}
		}
	}
	cout<<*min_element(dj[(1<<k)-1].begin(), dj[(1<<k)-1].end());
}

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