// In the Name of Allah
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,unroll-loops,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
typedef long long ll;
typedef pair<double, int> pd;
#define F first
#define S second
#define pii pair<int, int>
#define pb push_back
#define pp pop_back
#define all(x) x.begin(), x.end()
const int N = 1e5 + 12, K = 77;
vector<pii> g[N];
int n, m, k, h, a[N];
double ans;
bool mrk[N][K], t[N];
void dfs(int u) {
t[u] = true;
if (u == h)
return;
for (auto i: g[u])
if (!t[i.F])
dfs(i.F);
}
void find_ans() {
dfs(0);
ans = 1e18;
if (!t[h]) {
ans = -1;
return;
}
priority_queue<pd, vector<pd>, greater<pd>> q[k + 1];
q[0].push({0, 0});
for (int i = 1; i < n; i++)
if (!a[i] && t[i])
q[0].push({0, i});
int pt = 0;
while (pt <= k) {
if (q[pt].empty()) {
++pt;
continue;
}
auto [w, u] = q[pt].top();
q[pt].pop();
if (u == h) {
ans = min(ans, w);
mrk[u][pt] = true;
}
if (mrk[u][pt])
continue;
mrk[u][pt] = true;
for (auto i: g[u])
if (a[i.F]) {
if (!mrk[i.F][pt])
q[pt].push({w + i.S, i.F});
if (a[i.F] == 2)
q[pt + 1].push({(w + i.S) / 2, i.F});
}
}
}
double solve(int ns, int ms, int ks, int hs, vector<int> xs, vector<int> ys, vector<int> ws, vector<int> as) {
n = ns, m = ms, k = min(ks, 75), h = hs;
for (int i = 0; i < m; i++)
g[xs[i]].pb({ys[i], ws[i]}), g[ys[i]].pb({xs[i], ws[i]});
for (int i = 0; i < n; i++)
a[i] = as[i];
find_ans();
for (int i = 0; i < n; i++) {
g[i].clear();
t[i] = false;
for (int j = 0; j <= k; ++j)
mrk[i][j] = false;
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
5 ms |
8640 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
4700 KB |
Correct. |
2 |
Correct |
20 ms |
4700 KB |
Correct. |
3 |
Correct |
26 ms |
4700 KB |
Correct. |
4 |
Correct |
26 ms |
4700 KB |
Correct. |
5 |
Correct |
23 ms |
4704 KB |
Correct. |
6 |
Correct |
24 ms |
5768 KB |
Correct. |
7 |
Correct |
24 ms |
5724 KB |
Correct. |
8 |
Correct |
12 ms |
7260 KB |
Correct. |
9 |
Correct |
19 ms |
4440 KB |
Correct. |
10 |
Correct |
19 ms |
4548 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
26 ms |
4700 KB |
Correct. |
2 |
Correct |
22 ms |
4696 KB |
Correct. |
3 |
Correct |
20 ms |
4700 KB |
Correct. |
4 |
Correct |
21 ms |
4444 KB |
Correct. |
5 |
Correct |
21 ms |
4444 KB |
Correct. |
6 |
Correct |
6 ms |
5724 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
92 ms |
25808 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
17 ms |
6748 KB |
Correct. |
2 |
Correct |
21 ms |
6748 KB |
Correct. |
3 |
Correct |
20 ms |
6736 KB |
Correct. |
4 |
Correct |
22 ms |
7616 KB |
Correct. |
5 |
Correct |
17 ms |
4444 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
6744 KB |
Correct. |
2 |
Correct |
18 ms |
6744 KB |
Correct. |
3 |
Correct |
37 ms |
15700 KB |
Correct. |
4 |
Correct |
20 ms |
7516 KB |
Correct. |
5 |
Correct |
19 ms |
4440 KB |
Correct. |
6 |
Correct |
19 ms |
4700 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
6 ms |
9288 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
8 ms |
10076 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |