// cre: Nguyen Ngoc Hung - Train VOI 2024 :>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <unordered_set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <cstring>
#include <unordered_map>
#include <cmath>
#include <array>
#include <cassert>
#include <random>
using namespace std;
#define SORT_UNIQUE(v) sort(ALL(v)),(v).resize(unique(ALL(v))-(v).begin())
#define __nnhzzz__ signed main()
#define BIT(i,j) ((i>>j)&1LL)
#define MASK(i) (1LL<<i)
#define RALL(x) (x).rbegin(),(x).rend()
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) (int)(x).size()
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define ll long long
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define pii pair<int,int>
#define vpii vector<pii>
#define RESET(x,val) memset((x),(val),sizeof(x))
#define REPDIS(i,be,en,j) for(int i = (be); i<=(en); i+=j)
#define REPD(i,be,en) for(int i = (be); i>=(en); i--)
#define REP(i,be,en) for(int i = (be); i<=(en); i++)
//-------------------------------------------------------------//
const ll oo = 1e15;
const int LOG = 20,MAXN = 1e5+7,N = 1e2+3;
const int MOD = 1e9+7,MOD1 = 1e9+207,MOD2 = 1e9+407,MOD3 = 998244353;
//-------------------------------------------------------------//
template<typename T1, typename T2> bool mini(T1 &a, T2 b){if(a>b){a=b;return true;}return false;}
template<typename T1, typename T2> bool maxi(T1 &a, T2 b){if(a<b){a=b;return true;}return false;}
template<typename T> T gcd(T a, T b) { while(b) { a %= b; swap(a,b); } return a; }
template<typename T> T lcm(T a, T b) { return a/gcd(a,b)*b; }
/*
----------------------------------------------------------------
END OF TEMPLATE
----------------------------------------------------------------
Nguyen Ngoc Hung - nnhzzz
Training for VOI24 gold medal
----------------------------------------------------------------
*/
int spec[MAXN];
vpii adj[MAXN];
void solve(){
int n,k,m; cin >> n >> k >> m;
REP(i,0,k-1){
cin >> spec[i];
--spec[i];
}
REP(i,1,m){
int u,v,w; cin >> u >> v >> w;
--u; --v;
adj[u].emplace_back(v,w);
adj[v].emplace_back(u,w);
}
// using T = tuple<int,int,ll>; // w,mask,u
vector<vector<ll>> dis(MASK(k)|1,vector<ll>(n+3,oo));
REP(i,0,k-1){
dis[MASK(i)][spec[i]] = 0;
}
REP(state,0,MASK(k)-1){
for(int sub = (state-1)&state; sub!=0; sub = (sub-1)&state){
REP(i,0,n-1){
mini(dis[state][i],dis[sub][i]+dis[sub^state][i]);
}
}
using T = pair<ll,int>;
priority_queue<T,vector<T>,greater<T>> heap;
REP(i,0,n-1){
if(dis[state][i]!=oo){
heap.emplace(dis[state][i],i);
}
}
while(SZ(heap)!=0){
auto [w1,u] = heap.top(); heap.pop();
if(dis[state][u]!=w1){
continue;
}
for(auto [v,w]:adj[u]){
if(mini(dis[state][v],w1+w)){
heap.emplace(dis[state][v],v);
}
}
}
}
ll res = oo;
REP(i,0,n-1){
mini(res,dis[MASK(k)-1][i]);
}
cout << res;
}
__nnhzzz__{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#define name "test"
if(fopen(name".inp","r")){
freopen(name".inp","r",stdin);
freopen(name".out","w",stdout);
}
#define name1 "nnhzzz"
if(fopen(name1".inp","r")){
freopen(name1".inp","r",stdin);
freopen(name1".out","w",stdout);
}
int test = 1;
while(test--){
solve();
}
cerr << "\nTime elapsed: " << 1000*clock()/CLOCKS_PER_SEC << "ms\n";
return 0;
}
Compilation message
cities.cpp: In function 'void solve()':
cities.cpp:121:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
121 | auto [w1,u] = heap.top(); heap.pop();
| ^
cities.cpp:125:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
125 | for(auto [v,w]:adj[u]){
| ^
cities.cpp: In function 'int main()':
cities.cpp:144:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
144 | freopen(name".inp","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
cities.cpp:145:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
145 | freopen(name".out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
cities.cpp:149:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
149 | freopen(name1".inp","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
cities.cpp:150:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
150 | freopen(name1".out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
2676 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2644 KB |
Output is correct |
| 3 |
Correct |
2 ms |
2644 KB |
Output is correct |
| 4 |
Correct |
2 ms |
2644 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2680 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
330 ms |
26556 KB |
Output is correct |
| 2 |
Correct |
336 ms |
26660 KB |
Output is correct |
| 3 |
Correct |
189 ms |
18696 KB |
Output is correct |
| 4 |
Correct |
48 ms |
10896 KB |
Output is correct |
| 5 |
Correct |
177 ms |
21324 KB |
Output is correct |
| 6 |
Correct |
49 ms |
10888 KB |
Output is correct |
| 7 |
Correct |
3 ms |
2824 KB |
Output is correct |
| 8 |
Correct |
2 ms |
2880 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
2948 KB |
Output is correct |
| 2 |
Correct |
5 ms |
3028 KB |
Output is correct |
| 3 |
Correct |
4 ms |
2900 KB |
Output is correct |
| 4 |
Correct |
4 ms |
2772 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
755 ms |
32920 KB |
Output is correct |
| 2 |
Correct |
683 ms |
32820 KB |
Output is correct |
| 3 |
Correct |
408 ms |
24912 KB |
Output is correct |
| 4 |
Correct |
409 ms |
22804 KB |
Output is correct |
| 5 |
Correct |
113 ms |
13552 KB |
Output is correct |
| 6 |
Correct |
49 ms |
12444 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1489 ms |
45544 KB |
Output is correct |
| 2 |
Correct |
1478 ms |
45524 KB |
Output is correct |
| 3 |
Correct |
1468 ms |
45436 KB |
Output is correct |
| 4 |
Correct |
934 ms |
37476 KB |
Output is correct |
| 5 |
Correct |
753 ms |
29100 KB |
Output is correct |
| 6 |
Correct |
175 ms |
14824 KB |
Output is correct |
| 7 |
Correct |
59 ms |
12408 KB |
Output is correct |
