#include <bits/stdc++.h>
#include "cyberland.h"
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define sz size()
#define ll long long
#define pii pair <int, ll>
#define piii pair <ll, int>
const int N = 1e5 + 5;
vector <pii> v[N];
priority_queue <piii, vector <piii>, greater <piii>> q;
ll dis[N];
bool vis[N];
void dfs (int x) {
vis[x] = 1;
for (pii i : v[x]) {
if (vis[i.ff]) continue;
dfs (i.ff);
}
}
double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
for (int i = 0; i < M; ++i) {
// cout << i << " --> " << x[i] << " " << y[i];
v[x[i]].pb ({y[i], (ll)c[i]});
v[y[i]].pb ({x[i], (ll)c[i]});
}
for (int i = 0; i < N; ++i) {
dis[i] = 1e14;
}
vis[H] = 1;
dfs (0);
vis[H] = 0;
q.push ({0, H});
dis[H] = 0;
while (!q.empty()) {
int x = q.top().ss;
q.pop();
for (pii i : v[x]) {
if (dis[i.ff] > dis[x] + i.ss) {
dis[i.ff] = dis[x] + i.ss;
q.push({dis[i.ff], i.ff});
}
}
}
// for (int i = 0; i < N; ++i) {
// cout << i << " -- > " << dis[i] << " " << vis[i] << "\n";
// }
// exit(0);
double jogap = -1;
for (int i = 0; i < N; ++i) {
if (!i or (!arr[i] and vis[i])) {
if (jogap == -1) {
jogap = (double)dis[i];
}
else jogap = min (jogap, (double)dis[i]);
}
}
for (int i = 0; i < N; ++i) {
v[i].clear();
vis[i] = 0;
}
return jogap;
}
//int main() {
// freopen ("input.txt", "r", stdin);
// int T;
// assert(1 == scanf("%d", &T));
// while (T--) {
// int N,M,K,H;
// assert(4 == scanf("%d %d %d\n%d", &N, &M, &K, &H));
// std::vector<int> x(M);
// std::vector<int> y(M);
// std::vector<int> c(M);
// std::vector<int> arr(N);
// for (int i=0;i<N;i++)
// assert(1 == scanf("%d", &arr[i]));
// for (int i=0;i<M;i++)
// assert(3 == scanf("%d %d %d", &x[i], &y[i], &c[i]));
// printf("%.12lf\n", solve(N, M, K, H, x, y, c, arr));
// }
//}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
14 ms |
3672 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
17 ms |
3676 KB |
Correct. |
2 |
Correct |
20 ms |
3676 KB |
Correct. |
3 |
Correct |
19 ms |
3676 KB |
Correct. |
4 |
Correct |
25 ms |
3932 KB |
Correct. |
5 |
Correct |
20 ms |
3712 KB |
Correct. |
6 |
Correct |
18 ms |
4536 KB |
Correct. |
7 |
Correct |
22 ms |
4496 KB |
Correct. |
8 |
Correct |
10 ms |
5212 KB |
Correct. |
9 |
Correct |
28 ms |
3580 KB |
Correct. |
10 |
Correct |
27 ms |
3576 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
30 ms |
3648 KB |
Correct. |
2 |
Correct |
26 ms |
3672 KB |
Correct. |
3 |
Correct |
19 ms |
3676 KB |
Correct. |
4 |
Correct |
19 ms |
3420 KB |
Correct. |
5 |
Correct |
21 ms |
3416 KB |
Correct. |
6 |
Correct |
5 ms |
4184 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
24 ms |
8260 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
16 ms |
3676 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
18 ms |
3780 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
25 ms |
3676 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
18 ms |
3676 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |