Submission #919469

#	Time	Username	Problem	Language	Result	Execution time	Memory
919469		dosts	Cyberland (APIO23_cyberland)	C++17	97 / 100	2838 ms	141716 KiB

cyberland

#pragma GCC optimize("O3,unroll-loops")
#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;

vector<pair<int,int>> edges[100000];

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) {
    K = min(K,60);
    for (int i=0;i<N;i++) edges[i].clear();
    for (int i=0;i<M;i++) {
        edges[x[i]].push_back({y[i],c[i]});
        edges[y[i]].push_back({x[i],c[i]});
    }
    double dp[N][K+1];
    for (int i=0;i<N;i++) {
        for (int j=0;j<=K;j++) dp[i][j] = 2e18;
    }
    using wtf = pair<double,pair<int,int>>;
    priority_queue<wtf,vector<wtf>,greater<wtf>> pq;
    pq.push({0,{0,0}});
    while (!pq.empty()) {
        wtf f = pq.top();
        pq.pop();
        double cost = f.first;
        int used = f.second.second;
        int city = f.second.first;
        if (dp[city][used] <= cost) continue;
        dp[city][used] = cost;
        if (city != H) {
            for (auto it : edges[city]) {
                int dest = it.first;
                int go = it.second;
                if (!arr[dest]) {
                    pq.push({0,{dest,used}});
                }
                else if (arr[dest]==1) {
                    pq.push({cost+go,{dest,used}});                
                }
                else {
                    if (used!=K) pq.push({(cost+go)/2,{dest,used+1}});
                    pq.push({cost+go,{dest,used}});                
                }
            }
        }
    }
    double ans = 2e18;
    for (int i=0;i<=K;i++) ans = min(ans,dp[H][i]);
    return ans==2e18?-1: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