// 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 = 76;
vector<pii> g[N];
int n, m, k, h, a[N];
double ans;
bool mrk[N][K];
void find_ans() {
ans = 1e18;
priority_queue<pd, vector<pd>, greater<pd>> q;
q.push({0, 0});
for (int i = 1; i < n; i++)
if (!a[i])
q.push({0, i});
while (!q.empty()) {
auto tmp = q.top();
q.pop();
int u = tmp.S % n, ck = tmp.S / n;
double w = tmp.F;
if (u == h) {
ans = min(ans, w);
mrk[u][ck] = true;
}
if (mrk[u][ck])
continue;
mrk[u][ck] = true;
for (auto i: g[u])
if (a[i.F] && !mrk[i.F][ck + (a[i.F] == 2)]) {
if (a[i.F] == 1)
q.push({w + i.S, i.F + ck * n});
else if (ck + 1 <= k)
q.push({(w + i.S) / 2, i.F + (ck + 1) * n});
}
}
if (ans == 1e18)
ans = -1;
}
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();
for (int j = 0; j <= k; ++j)
mrk[i][j] = false;
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
21 ms |
4440 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
17 ms |
4444 KB |
Correct. |
2 |
Correct |
20 ms |
4444 KB |
Correct. |
3 |
Correct |
20 ms |
4508 KB |
Correct. |
4 |
Correct |
21 ms |
4440 KB |
Correct. |
5 |
Correct |
20 ms |
4444 KB |
Correct. |
6 |
Correct |
18 ms |
5724 KB |
Correct. |
7 |
Correct |
24 ms |
5724 KB |
Correct. |
8 |
Correct |
11 ms |
7000 KB |
Correct. |
9 |
Correct |
19 ms |
4188 KB |
Correct. |
10 |
Correct |
19 ms |
4188 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
22 ms |
4476 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
189 ms |
14380 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
18 ms |
4444 KB |
Correct. |
2 |
Correct |
20 ms |
4444 KB |
Correct. |
3 |
Correct |
20 ms |
4580 KB |
Correct. |
4 |
Correct |
22 ms |
5908 KB |
Correct. |
5 |
Correct |
17 ms |
4188 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
21 ms |
4540 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
112 ms |
5000 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
248 ms |
5284 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |