Submission #984988

#	Time	Username	Problem	Language	Result	Execution time	Memory
984988		kim	Cyberland (APIO23_cyberland)	C++17	0 / 100	1926 ms	8788 KiB

cyberland

#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>;

vector<pii> adj[100005];
A d[100005];
priority_queue<B,vector<B>,greater<B>> pq;

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<M;++i) adj[U[i]].eb(V[i],W[i]), adj[V[i]].eb(U[i],W[i]);

    function<void(ll)> dijk=[&](ll lim){
        while(!pq.empty()){
            auto [w,u]=pq.top(); pq.pop();
            for(auto &[v,vw]:adj[u]){
                A w2={w.f,w.s+vw};
                if(w2.s>lim&&arr[v]==2) ++w2.f, w2.s/=2;
                if(d[v]>w2){
                    d[v]=w2;
                    pq.emplace(w2,v);
                }
            }
        }
    };

    ll l=0,r=1;
    while(l<r){
        ll mid=(l+r>>1);
        pq.emplace(A(0,0),0);
        d[0]=A(0,0);
        for(int i=1;i<N;++i){
            if(arr[i]==0) pq.emplace(A(0,0),i), d[i]=A(0,0);
            else d[i]=A(1e9,0);
        }
        dijk(mid);
        if(d[H].f>K) l=mid+1;
        else r=mid;
    }
    pq.emplace(A(0,0),0);
    d[0]=A(0,0);
    for(int i=1;i<N;++i){
        if(arr[i]==0) pq.emplace(A(0,0),i), d[i]=A(0,0);
        else d[i]=A(1e9,0);
    }
    dijk(l);
    return d[H].s;
}

Compilation message (stderr)

cyberland.cpp: In function 'double solve(int, int, int, int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
cyberland.cpp:38:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   38 |         ll mid=(l+r>>1);
      |                 ~^~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 19
• Subtask 5: 0 / 7
• Subtask 6: 0 / 16
• Subtask 7: 0 / 29
• Subtask 8: 0 / 3