제출 #983307

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
983307		vjudge1	사이버랜드 (APIO23_cyberland)	C++17	20 / 100	26 ms	7104 KiB

cyberland

#include <vector>
#include <queue>
#include <limits>

using namespace std;

double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    // Initialize the graph
    vector<vector<pair<int, int>>> graph(N);
    for (int i = 0; i < M; ++i) {
        graph[x[i]].push_back({y[i], c[i]});
        graph[y[i]].push_back({x[i], c[i]});
    }
    
    // Initialize distances
    vector<double> dist(N, numeric_limits<double>::max());
    dist[0] = 0;  // Distance from your country to itself is 0
    
    // Priority queue to store {distance, country} pairs
    priority_queue<pair<double, int>, vector<pair<double, int>>, greater<pair<double, int>>> pq;
    pq.push({0, 0});  // Start from your country
    
    while (!pq.empty()) {
        int u = pq.top().second;
        double d = pq.top().first;
        pq.pop();
        
        // Check if we have reached Cyberland
        if (u == H) return d;
        
        // Check if we have used up all divide-by-2 abilities
        int remaining_divide_by_2 = K;
        if (arr[u] == 2) remaining_divide_by_2--;
        
        for (auto& edge : graph[u]) {
            int v = edge.first;
            int cost = edge.second;
            double new_dist = d + cost;
            
            // Apply special ability of the country
            if (arr[v] == 0) new_dist = d;  // Passing time becomes 0
            else if (arr[v] == 2 && remaining_divide_by_2 > 0) {  // Divide-by-2 ability
                new_dist = d + cost / 2.0;
                remaining_divide_by_2--;
            }
            
            // Update the distance if the new path is shorter
            if (new_dist < dist[v]) {
                dist[v] = new_dist;
                pq.push({new_dist, v});
            }
        }
    }
    
    // If Cyberland is unreachable
    return -1;
}

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