# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
113706 | 2019-05-28T01:42:46 Z | thebes | Cities (BOI16_cities) | C++14 | 3423 ms | 262144 KB |
#include <bits/stdc++.h> using namespace std; const int MN = 1e5+5; typedef long long ll; typedef pair<ll,ll> pii; struct reeee{ll n, m, d;}; bool ww[MN][1<<6]; ll n, m, k, i, x, y, w, vs[MN][1<<6], ans = 1LL<<60; vector<pii> adj[MN]; vector<ll> heh; struct pq{bool operator()(const reeee&i,const reeee&j){return i.d>j.d;}}; priority_queue<reeee,vector<reeee>,pq> q; int main(){ for(scanf("%lld%lld%lld",&n,&k,&m),i=1;i<=k;i++){ scanf("%lld",&x); heh.push_back(x); } for(i=1;i<=m;i++){ scanf("%lld%lld%lld",&x,&y,&w); adj[x].push_back({y,w}); adj[y].push_back({x,w}); } memset(vs,0x3f,sizeof(vs)); for(i=0;i<heh.size();i++) q.push({heh[i], 1<<i, 0}); while(q.size()){ auto v = q.top(); q.pop(); if(v.m==(1<<k)-1) ans = min(ans, v.d); if(ww[v.n][v.m]) continue; vs[v.n][v.m] = v.d; ww[v.n][v.m] = 1; for(int mm=0;mm<(1<<k);mm++){ if(v.d+vs[v.n][mm]<vs[v.n][v.m|mm]){ vs[v.n][v.m|mm]=v.d+vs[v.n][mm]; q.push({v.n, v.m|mm, v.d+vs[v.n][mm]}); } } for(auto w : adj[v.n]){ if(v.d+w.second<vs[w.first][v.m]){ vs[w.first][v.m]=v.d+w.second; q.push({w.first, v.m, v.d+w.second}); } } } printf("%lld\n",ans); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 43 ms | 52856 KB | Output is correct |
2 | Correct | 41 ms | 52856 KB | Output is correct |
3 | Correct | 40 ms | 52864 KB | Output is correct |
4 | Correct | 40 ms | 52828 KB | Output is correct |
5 | Correct | 39 ms | 52856 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1188 ms | 94304 KB | Output is correct |
2 | Correct | 1078 ms | 81352 KB | Output is correct |
3 | Correct | 540 ms | 70616 KB | Output is correct |
4 | Correct | 144 ms | 62428 KB | Output is correct |
5 | Correct | 520 ms | 75652 KB | Output is correct |
6 | Correct | 136 ms | 62148 KB | Output is correct |
7 | Correct | 46 ms | 53240 KB | Output is correct |
8 | Correct | 43 ms | 52984 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 50 ms | 53876 KB | Output is correct |
2 | Correct | 50 ms | 53432 KB | Output is correct |
3 | Correct | 47 ms | 53216 KB | Output is correct |
4 | Correct | 47 ms | 53436 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3423 ms | 121460 KB | Output is correct |
2 | Correct | 2986 ms | 122428 KB | Output is correct |
3 | Correct | 2049 ms | 91260 KB | Output is correct |
4 | Correct | 1853 ms | 120236 KB | Output is correct |
5 | Correct | 411 ms | 78724 KB | Output is correct |
6 | Correct | 154 ms | 68380 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1689 ms | 262144 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |