oj.uz

Submission #985048

# Submission time Handle Problem Language Result Execution time Memory
985048 2024-05-17T10:02:03 Z kim Cyberland (APIO23_cyberland) C++17
44 / 100
 964 ms 9980 KB 
#include "cyberland.h"
#include<bits/stdc++.h>
using namespace std;
using db=long double;
using pii=pair<int,int>;
using ll=long long;
#define eb emplace_back
#define f first
#define s second
const db eps=1e-14;

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();
        if(u==H) continue;
        for(auto &[v,w]:adj[u]){
            if(!vis[v]) vis[v]=1, q.emplace(v);
        }
    }
    if(!vis[H]) return -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(vis[i]&&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) continue;
            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){
      |                                   ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 63 ms 3672 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 432 ms 3848 KB Correct.
2 Correct 528 ms 3984 KB Correct.
3 Correct 515 ms 4092 KB Correct.
4 Correct 533 ms 3828 KB Correct.
5 Correct 522 ms 3676 KB Correct.
6 Correct 721 ms 6740 KB Correct.
7 Correct 964 ms 6588 KB Correct.
8 Correct 416 ms 7516 KB Correct.
9 Correct 297 ms 3676 KB Correct.
10 Correct 292 ms 3920 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 677 ms 3880 KB Correct.
2 Correct 656 ms 3836 KB Correct.
3 Correct 629 ms 3928 KB Correct.
4 Correct 380 ms 3772 KB Correct.
5 Correct 355 ms 3676 KB Correct.
6 Correct 177 ms 6684 KB Correct.

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 354 ms 9980 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 244 ms 3836 KB Correct.
2 Correct 283 ms 4404 KB Correct.
3 Correct 302 ms 3924 KB Correct.
4 Correct 554 ms 6780 KB Correct.
5 Correct 145 ms 3760 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 316 ms 3900 KB Correct.
2 Correct 230 ms 3852 KB Correct.
3 Correct 31 ms 8788 KB Correct.
4 Correct 291 ms 6728 KB Correct.
5 Correct 185 ms 3676 KB Correct.
6 Correct 281 ms 3920 KB Correct.

Subtask #7
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 324 ms 3944 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 317 ms 3924 KB Wrong Answer.
2 Halted 0 ms 0 KB -