Submission #804575

#	Time	Username	Problem	Language	Result	Execution time	Memory
804575		Theo830	Cyberland (APIO23_cyberland)	C++17	97 / 100	1027 ms	64836 KiB

cyberland

#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
#define f(i,a,b) for(int i = a;i < b;i++)
#define ll long long
#define ii pair<ll,ll>
#define id pair<double,ll>
#define F first
#define S second
#define pb push_back
priority_queue<id,vector<id>,greater<id> >pq;
bool v[100005] = {0};
double dist[100005][70];
vector<vector<ii> >adj;
ll H;
void dfs(ll idx){
    v[idx] = 1;
    for(auto x:adj[idx]){
        if(!v[x.F] && x.F != H){
            dfs(x.F);
        }
    }
}
double solve(int n, int m, int k, int h, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr) {
    double ans;
    H = h;
    adj.assign(n+5,vector<ii>());
    k = min(k,67);
    f(i,0,n){
        v[i] = 0;
        f(j,0,k+1){
            dist[i][j] = 1e18;
        }
    }
    f(i,0,m){
        adj[x[i]].pb(ii(y[i],c[i]));
        adj[y[i]].pb(ii(x[i],c[i]));
    }
    dfs(0);
    f(i,0,n){
        if((arr[i] == 0 && v[i]) || i == 0){
            pq.push(id(0,(k+1) * i));
            dist[i][0] = 0;
        }
    }
    ans = 1e18;
    if(k <= 30){
        while(!pq.empty()){
            id f = pq.top();
            pq.pop();
            double w = f.F;
            ll u = f.S / (k+1);
            ll ek = f.S % (k+1);
            if(dist[u][ek] < w){
                continue;
            }
            if(arr[u] == 2 && ek+1 <= k){
                for(auto x:adj[u]){
                    if(x.F == h){
                        ans = min(ans,dist[u][ek]/(double)2 + (double)x.S);
                    }
                    else if(dist[x.F][ek+1] > dist[u][ek]/(double)2 + (double)x.S){
                        dist[x.F][ek+1] = dist[u][ek]/(double)2 + (double)x.S;
                        pq.push(id(dist[x.F][ek+1],(k+1) * x.F + ek+1));
                    }
                }
            }
            for(auto x:adj[u]){
                if(x.F == h){
                    ans = min(ans,dist[u][ek] + x.S);
                }
                else if(dist[x.F][ek] > dist[u][ek] + x.S){
                    dist[x.F][ek] = dist[u][ek] + x.S;
                    pq.push(id(dist[x.F][ek],(k+1) * x.F + ek));
                }
            }
        }
    }
    else{
        while(!pq.empty()){
            id f = pq.top();
            pq.pop();
            double w = f.F;
            ll u = f.S / (k+1);
            ll ek = f.S % (k+1);
            if(dist[u][ek] < w){
                continue;
            }
            if(arr[u] == 2 && ek == 0){
                for(auto x:adj[u]){
                    if(x.F == h){
                        ans = min(ans,dist[u][ek]/(double)2 + (double)x.S);
                    }
                    else if(dist[x.F][ek+1] > (double)x.S){
                        dist[x.F][ek+1] = (double)x.S;
                        pq.push(id(dist[x.F][ek+1],(k+1) * x.F + ek+1));
                    }
                }
            }
            for(auto x:adj[u]){
                if(x.F == h){
                    ans = min(ans,dist[u][ek] + x.S);
                }
                else if(dist[x.F][ek] > dist[u][ek] + x.S){
                    dist[x.F][ek] = dist[u][ek] + x.S;
                    pq.push(id(dist[x.F][ek],(k+1) * x.F + ek));
                }
            }
        }
    }
    if(ans == 1e18){
        ans = -1;
    }
    return ans;
}

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