// headers
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
// types
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using dbl = double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using piipi = pair<pii, int>;
using pipii = pair<int, pii>;
using plpii = pair<ll, pii>;
using ppii = pair<pii, pii>;
// loops
#define forx(i, x, y) for (int i = (x); i <= (y); ++i)
#define forn(i, n) for (int i = 0; i < (n); ++i)
#define for1(i, n) for (int i = 1; i <= (n); ++i)
#define rofx(i, x, y) for (int i = x; i >= y; --i)
#define rofn(i, n) for (int i = n-1; i >= 0; --i)
#define rof1(i, n) for (int i = n; i >= 1; --i)
#define fora(x, v) for (auto x : v)
// define shortcuts
#define all(x) begin(x), end(x)
#define pb push_back
#define eb emplace_back
#define F first
#define S second
#define X first
#define Y second
#define MP make_pair
#define MT make_tuple
// functions
template<class T> inline bool hasbit(T x, int i) { return x&(1<<i); }
template<class T> inline T togbit(T x, int i) { return x|(1<<i); }
template<class T> inline T setbit(T x, int i) { return x|(1<<i); }
template<class T> inline T rembit(T x, int i) { return x&~(1<<i); }
template<class T> inline bool setmax(T &a, const T &b) { return b > a ? a = b, true : false; }
template<class T> inline bool setmin(T &a, const T &b) { return b < a ? a = b, true : false; }
template<class T> int compress(vector<T> &v) { sort(all(v)); v.resize(unique(all(v))-v.begin()); return v.size(); }
// read functions
int read_int() { int x; scanf("%d", &x); return x; }
ll read_ll() { ll x; scanf("%" SCNd64, &x); return x; }
ull read_ull() { ull x; scanf("%" SCNu64, &x); return x; }
dbl read_dbl() { dbl x; scanf("%lf", &x); return x; }
void _R(int &x) { x = read_int(); }
void _R(ll &x) { x = read_ll(); }
void _R(dbl &x) { x = read_dbl(); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
// print functions
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const ll &x) { printf("%" PRId64, x); }
void _W(const ull &x) { printf("%" PRIu64, x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
// pseudo-random number generator
template<class T, T x1, T x2, T x3, int y1, int y2, int y3>
struct PRNG {
using S = typename make_signed<T>::type;
T s;
PRNG(T _s = 0) : s(_s) {}
T next() {
T z = (s += x1);
z = (z ^ (z >> y1)) * x2;
z = (z ^ (z >> y2)) * x3;
return z ^ (z >> y3);
}
T next(T n) { return next() % n; }
S next(S l, S r) { return l + next(r - l + 1); }
T operator()() { return next(); }
T operator()(T n) { return next(n); }
S operator()(S l, S r) { return next(l, r); }
static T gen(T s) { return PRNG(s)(); }
template<class U>
void shuffle(U first, U last) {
size_t n = last - first;
for (size_t i = 0; i < n; i++) swap(first[i], first[next(i + 1)]);
}
};
PRNG<uint32_t, 0x9E3779B1, 0x85EBCA6B, 0xC2B2AE35, 16, 13, 16> r32;
PRNG<uint64_t, 0x9E3779B97F4A7C15, 0xBF58476D1CE4E5B9, 0x94D049BB133111EB, 30, 27, 31> r64;
// program
int _main();
int main() {
//ios::sync_with_stdio(false), cin.tie(0);
//time_t begin = clock();
int ret = _main();
//time_t end = clock();
//fprintf(stderr, "Program took %.3f seconds to compute\n", ((double)end-begin)/CLOCKS_PER_SEC);
return ret;
}
/************************************************************
CODE STARTS BELOW THIS POINT
************************************************************/
const int N = 100010;
const int K = 6;
const ll INF = 1e18;
int n, k, m;
ll dist[1<<K][N];
bool vis[1<<K][N];
vector<pii> G[N];
void dijkstra(ll dist[], bool vis[])
{
priority_queue<pli, vector<pli>, greater<pli>> Q;
for1(u, n) if (dist[u] != INF)
Q.push({dist[u], u});
while (!Q.empty()) {
int u = Q.top().S;
ll d = Q.top().F;
Q.pop();
if (vis[u]) continue;
vis[u] = true;
fora(v, G[u]) if (!vis[v.F] && setmin(dist[v.F], d+v.S))
Q.push({dist[v.F], v.F});
}
}
int _main()
{
R(n, k, m);
forn(conf, 1<<k) for1(u, n) dist[conf][u] = INF;
forn(i, k) {
int u; R(u);
dist[1<<i][u] = 0;
}
forn(i, m) {
int u, v, w;
R(u, v, w);
G[u].eb(v, w);
G[v].eb(u, w);
}
forn(conf, 1<<k) {
for (int sub = conf; sub; sub = (sub-1)&conf) {
int neg = conf-sub;
for1(u, n)
setmin(dist[conf][u], dist[sub][u]+dist[neg][u]);
}
dijkstra(dist[conf], vis[conf]);
}
ll ans = INF;
for1(u, n) setmin(ans, dist[(1<<k)-1][u]);
W(ans);
return 0;
}
Compilation message
cities.cpp: In function 'll read_ll()':
cities.cpp:49:42: warning: format '%ld' expects argument of type 'long int*', but argument 2 has type 'll* {aka long long int*}' [-Wformat=]
ll read_ll() { ll x; scanf("%" SCNd64, &x); return x; }
~~^
cities.cpp: In function 'ull read_ull()':
cities.cpp:50:45: warning: format '%lu' expects argument of type 'long unsigned int*', but argument 2 has type 'ull* {aka long long unsigned int*}' [-Wformat=]
ull read_ull() { ull x; scanf("%" SCNu64, &x); return x; }
~~^
cities.cpp: In function 'void _W(const ll&)':
cities.cpp:60:44: warning: format '%ld' expects argument of type 'long int', but argument 2 has type 'll {aka long long int}' [-Wformat=]
void _W(const ll &x) { printf("%" PRId64, x); }
~^
cities.cpp: In function 'void _W(const ull&)':
cities.cpp:61:45: warning: format '%lu' expects argument of type 'long unsigned int', but argument 2 has type 'ull {aka long long unsigned int}' [-Wformat=]
void _W(const ull &x) { printf("%" PRIu64, x); }
~^
cities.cpp: In function 'int read_int()':
cities.cpp:48:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
int read_int() { int x; scanf("%d", &x); return x; }
~~~~~^~~~~~~~~~
cities.cpp: In function 'll read_ll()':
cities.cpp:49:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
ll read_ll() { ll x; scanf("%" SCNd64, &x); return x; }
~~~~~^~~~~~~~~~~~~~~~
cities.cpp: In function 'ull read_ull()':
cities.cpp:50:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
ull read_ull() { ull x; scanf("%" SCNu64, &x); return x; }
~~~~~^~~~~~~~~~~~~~~~
cities.cpp: In function 'dbl read_dbl()':
cities.cpp:51:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
dbl read_dbl() { dbl x; scanf("%lf", &x); return x; }
~~~~~^~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
2724 KB |
Output is correct |
| 2 |
Correct |
4 ms |
2788 KB |
Output is correct |
| 3 |
Correct |
4 ms |
2864 KB |
Output is correct |
| 4 |
Correct |
5 ms |
2940 KB |
Output is correct |
| 5 |
Correct |
5 ms |
3196 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
862 ms |
22408 KB |
Output is correct |
| 2 |
Correct |
854 ms |
22508 KB |
Output is correct |
| 3 |
Correct |
619 ms |
22508 KB |
Output is correct |
| 4 |
Correct |
155 ms |
22508 KB |
Output is correct |
| 5 |
Correct |
592 ms |
22508 KB |
Output is correct |
| 6 |
Correct |
160 ms |
22508 KB |
Output is correct |
| 7 |
Correct |
8 ms |
22508 KB |
Output is correct |
| 8 |
Correct |
9 ms |
22508 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
12 ms |
22508 KB |
Output is correct |
| 2 |
Correct |
11 ms |
22508 KB |
Output is correct |
| 3 |
Correct |
10 ms |
22508 KB |
Output is correct |
| 4 |
Correct |
9 ms |
22508 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1628 ms |
29416 KB |
Output is correct |
| 2 |
Correct |
1705 ms |
29436 KB |
Output is correct |
| 3 |
Correct |
1148 ms |
29436 KB |
Output is correct |
| 4 |
Correct |
930 ms |
29436 KB |
Output is correct |
| 5 |
Correct |
350 ms |
29436 KB |
Output is correct |
| 6 |
Correct |
172 ms |
29436 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3388 ms |
43720 KB |
Output is correct |
| 2 |
Correct |
3548 ms |
47928 KB |
Output is correct |
| 3 |
Correct |
3497 ms |
52292 KB |
Output is correct |
| 4 |
Correct |
2331 ms |
52292 KB |
Output is correct |
| 5 |
Correct |
1764 ms |
52292 KB |
Output is correct |
| 6 |
Correct |
409 ms |
52292 KB |
Output is correct |
| 7 |
Correct |
234 ms |
52292 KB |
Output is correct |
