#include <bits/stdc++.h>
using namespace std;
int n, m, k;
const int oo = 1e9+10;
int calc(vector<int> &a, vector<int> &b, vector<vector<pair<int, int>>> &edges) {
priority_queue<pair<int,int>> q;
for(int x : a) {
q.push({0, x});
}
vector<bool> fix(n), seen(n);
for(int x : b) {
fix[x] = 1;
}
while(!q.empty()) {
pair<int,int> p = q.top(); q.pop();
if(fix[p.second]) return -p.first;
if(seen[p.second]) continue;
seen[p.second] = 1;
for(const pair<int,int> &to : edges[p.second]) {
q.push({p.first - to.second, to.first});
}
}
return oo;
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
cin >> n >> m >> k;
vector<vector<pair<int, int>>> edges(n);
for(int i = 0; i < m; ++i) {
int u, v, w;
cin >> u >> v >> w; --u, --v;
edges[u].push_back({v, w});
edges[v].push_back({u, w});
}
vector<int> special(k);
for(int &i : special) cin >> i, --i;
int ans = oo;
for(int it = 0; it < 20; ++it) {
vector<int> start[2], end[2];
for(int i = 0; i < k / 2; ++i) {
start[rand() & 1].push_back(special[i]);
}
for(int i = k / 2; i < k; ++i) {
end[rand() & 1].push_back(special[i]);
}
ans = min(ans, calc(start[0], end[0], edges) + calc(start[1], end[1], edges));
}
cout << ans << '\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
114 ms |
5616 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
