Submission #670825

#TimeUsernameProblemLanguageResultExecution timeMemory
670825dattranxxxRelay Marathon (NOI20_relaymarathon)C++11
25 / 100
1391 ms174444 KiB
#include<bits/stdc++.h> using namespace std; using ll = long long; #define int ll const int N = 1e5 + 5, inf = 1e16; vector<pair<int, int>> adj[N]; int special[N]; int n, m, k; priority_queue<pair<int, int>> q; int dis[N], src[N]; int dijkstra(int s, int t) { memset(dis, 0x3f, sizeof(dis)); q.emplace(0, s); dis[s] = 0; while (!q.empty()) { int d, u; tie(d, u) = q.top(); q.pop(); if (-d != dis[u]) continue; if (special[u] && u != s && u != t) return dis[u]; for (auto& p : adj[u]) { int v, w; tie(v, w) = p; if (dis[u] + w < dis[v]) dis[v] = dis[u] + w, q.emplace(-dis[v], v); } } return inf; } tuple<int, int, int> dijkstra0() { memset(dis, 0x3f, sizeof(dis)); for (int v = 0; v < n; ++v) if (special[v]) dis[v] = 0, src[v] = v, q.emplace(0, v); while (!q.empty()) { int d, u; tie(d, u) = q.top(); q.pop(); if (-d != dis[u]) continue; for (auto& p : adj[u]) { int v, w; tie(v, w) = p; if (dis[u] + w < dis[v]) dis[v] = dis[u] + w, src[v] = src[u], q.emplace(-dis[v], v); } } int res = inf, s = -1, t = -1; for (int u = 0; u < n; ++u) for (auto& p : adj[u]) { int v, w; tie(v, w) = p; if (src[u] != src[v] && dis[u] + dis[v] + w < res) res = dis[u] + dis[v] + w, s = src[u], t = src[v]; } assert(s != -1 & t != -1); return make_tuple(res, s, t); } signed main() { cin.tie(0)->sync_with_stdio(0); cout.tie(0); cin >> n >> m >> k; for (int i = 0, u, v, w; i < m; ++i) cin >> u >> v >> w, u--, v--, adj[u].emplace_back(v, w), adj[v].emplace_back(u, w); for (int i = 0, v; i < k; ++i) cin >> v, v--, special[v] = 1; int val1, val2, s, t, tmp1, tmp2; tie(val1, s, t) = dijkstra0(); special[s] = special[t] = 0; tie(val2, tmp1, tmp2) = dijkstra0(); cout << min(val1 + val2, dijkstra(s, t) + dijkstra(t, s)); return 0; }

Compilation message (stderr)

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from RelayMarathon.cpp:1:
RelayMarathon.cpp: In function 'std::tuple<long long int, long long int, long long int> dijkstra0()':
RelayMarathon.cpp:50:12: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   50 |   assert(s != -1 & t != -1);
      |          ~~^~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...