#include "cyberland.h"
#include<bits/stdc++.h>
using namespace std;
using db=double;
using pii=pair<int,int>;
using ll=long long;
#define eb emplace_back
#define f first
#define s second
const db eps=1e-8;
using A=pair<int,db>;
using B=pair<A,int>;
struct cmp{
bool operator()(const B &l,const B &r)const{
if(l.f.f!=r.f.f) return l.f.f>r.f.f;
return l.f.s-r.f.s > eps;
}
};
vector<pii> adj[100005];
A d[100005];
priority_queue<B,vector<B>,cmp> pq;
queue<int> q;
bitset<100005> vis;
double solve(int N, int M, int K, int H, std::vector<int> U, std::vector<int> V, std::vector<int> W, std::vector<int> arr) {
for(int i=0;i<N;++i) adj[i].clear();
for(int i=0;i<M;++i) adj[U[i]].eb(V[i],W[i]), adj[V[i]].eb(U[i],W[i]);
q.emplace(0);
vis.reset();
vis[0]=1;
while(!q.empty()){
int u=q.front(); q.pop();
for(auto &[v,w]:adj[u]){
if(!vis[v]) vis[v]=1, q.emplace(v);
}
}
if(!vis[H]) return -1;
for(int i=0;i<N;++i) if(arr[i]==0 && !vis[i]) arr[i]=1;
function<void(db)> dijk=[&](db lim){
while(!pq.empty()) pq.pop();
pq.emplace(A(0,0),0);
d[0]={0,0};
for(int i=1;i<N;++i){
if(arr[i]==0) pq.emplace(A(0,0),i), d[i]={0,0};
else d[i]={1e9,0};
}
while(!pq.empty()){
auto [w,u]=pq.top(); pq.pop();
if(u==H) return;
for(auto &[v,vw]:adj[u]){
A w2={w.f,w.s+vw};
if(arr[v]==2 && w2.s-lim>eps) ++w2.f, w2.s/=2;
if(d[v].f>w2.f || d[v].f==w2.f&&d[v].s-w2.s>eps){
d[v]=w2;
pq.emplace(w2,v);
}
}
}
};
db l=0,r=1e14;
while(r-l>eps){
db mid=(l+r)/2;
dijk(mid);
if(d[H].f>K) l=mid;
else r=mid;
}
dijk(l);
return d[H].s;
}
Compilation message
cyberland.cpp: In lambda function:
cyberland.cpp:57:47: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
57 | if(d[v].f>w2.f || d[v].f==w2.f&&d[v].s-w2.s>eps){
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
36 ms |
4184 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
92 ms |
4368 KB |
Correct. |
2 |
Correct |
147 ms |
4336 KB |
Correct. |
3 |
Correct |
131 ms |
4184 KB |
Correct. |
4 |
Correct |
150 ms |
4436 KB |
Correct. |
5 |
Correct |
147 ms |
4188 KB |
Correct. |
6 |
Correct |
137 ms |
4948 KB |
Correct. |
7 |
Correct |
313 ms |
4944 KB |
Correct. |
8 |
Correct |
190 ms |
5852 KB |
Correct. |
9 |
Correct |
87 ms |
4256 KB |
Correct. |
10 |
Correct |
87 ms |
4248 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
269 ms |
4432 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
557 ms |
8708 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
71 ms |
4184 KB |
Correct. |
2 |
Correct |
83 ms |
4184 KB |
Correct. |
3 |
Correct |
88 ms |
4400 KB |
Correct. |
4 |
Correct |
190 ms |
5108 KB |
Correct. |
5 |
Correct |
45 ms |
4188 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
121 ms |
4420 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
110 ms |
4388 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
112 ms |
4912 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |