# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
759293 |
2023-06-16T03:48:44 Z |
hazzle |
Cities (BOI16_cities) |
C++17 |
|
2665 ms |
48604 KB |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("avx2")
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define all(m) (m).begin(), (m).end()
#define rall(m) (m).rbegin(), (m).rend()
#define vec vector
#define sz(a) (int) (a).size()
#define mpp make_pair
#define mtt make_tuple
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair <ll, ll> pll;
typedef pair <int, int> pii;
typedef tuple <int, int, int> tui;
template <typename T>
using prq = priority_queue <T>;
template <typename T>
using pgq = priority_queue <T, vec <T>, greater <T>>;
template <typename T> bool umin(T &a, T b) { return a > b ? a = b, 1 : 0; }
template <typename T> bool umax(T &a, T b) { return a < b ? a = b, 1 : 0; }
const ll inf = 1e18;
inline int solve(){
int n, k, m;
cin >> n >> k >> m;
vec <int> ve(k);
for (auto &i: ve) cin >> i, --i;
vec <vec <pii>> g(n);
for (int i = 0; i < m; ++i){
int u, v, w;
cin >> u >> v >> w, --u, --v;
g[u].push_back({v, w});
g[v].push_back({u, w});
}
vec <vec <ll>> d(n, vec <ll> (1 << k, inf));
for (int i = 0; i < k; ++i){
d[ve[i]][1 << i] = 0;
}
for (int msk = 1; msk < (1 << k); ++msk){
pgq <pll> q;
for (int i = 0; i < n; ++i){
for (int sub = msk; sub; sub = (sub - 1) & msk){
umin(d[i][msk], d[i][sub] + d[i][msk ^ sub]);
}
if (d[i][msk] != inf){
q.emplace(d[i][msk], i);
}
}
while(!q.empty()){
auto [ds, u] = q.top(); q.pop();
if (ds > d[u][msk]) continue;
for (auto &[v, w]: g[u]){
if (umin(d[v][msk], d[u][msk] + w)){
q.emplace(d[v][msk], v);
}
}
}
}
// for (int msk = 1; msk < (1 << k); ++msk){
// cout << bitset <3> (msk) << ":\n";
// for (int i = 0; i < n; ++i){
// cout << " " << i + 1 << " -> " << d[i][msk] << "\n";
// }
// }
ll ans = inf;
for (int i = 0; i < n; ++i){
umin(ans, d[i][(1 << k) - 1]);
}
cout << ans << "\n";
return 0;
}
inline void precalc(){}
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int tst = 1; //cin >> tst;
precalc();
while(tst--) solve();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
316 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
320 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
555 ms |
29636 KB |
Output is correct |
2 |
Correct |
549 ms |
29600 KB |
Output is correct |
3 |
Correct |
299 ms |
21696 KB |
Output is correct |
4 |
Correct |
54 ms |
8492 KB |
Output is correct |
5 |
Correct |
239 ms |
24204 KB |
Output is correct |
6 |
Correct |
42 ms |
8460 KB |
Output is correct |
7 |
Correct |
2 ms |
596 KB |
Output is correct |
8 |
Correct |
1 ms |
468 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
596 KB |
Output is correct |
2 |
Correct |
4 ms |
596 KB |
Output is correct |
3 |
Correct |
3 ms |
468 KB |
Output is correct |
4 |
Correct |
3 ms |
468 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1358 ms |
35884 KB |
Output is correct |
2 |
Correct |
1324 ms |
35864 KB |
Output is correct |
3 |
Correct |
827 ms |
27980 KB |
Output is correct |
4 |
Correct |
596 ms |
23112 KB |
Output is correct |
5 |
Correct |
122 ms |
11512 KB |
Output is correct |
6 |
Correct |
58 ms |
10088 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2665 ms |
48604 KB |
Output is correct |
2 |
Correct |
2658 ms |
48500 KB |
Output is correct |
3 |
Correct |
2607 ms |
48432 KB |
Output is correct |
4 |
Correct |
1754 ms |
40544 KB |
Output is correct |
5 |
Correct |
1120 ms |
29396 KB |
Output is correct |
6 |
Correct |
200 ms |
12976 KB |
Output is correct |
7 |
Correct |
65 ms |
10028 KB |
Output is correct |