제출 #983207

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

cyberland

#include <vector>
#include <queue>
#include <climits>
using namespace std;

struct Edge {
    int to;
    int cost;
};

double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    const int INF = INT_MAX;
    vector<vector<Edge>> graph(N);
    
    // Build the graph
    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]});
    }
    
    // Dijkstra's algorithm
    vector<int> dist(N, INF);
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    dist[0] = 0;
    pq.push({0, 0});
    
    while (!pq.empty()) {
        int d = pq.top().first;
        int u = pq.top().second;
        pq.pop();
        
        if (dist[u] < d) continue;
        
        for (const auto& edge : graph[u]) {
            int v = edge.to;
            int w = edge.cost;
            
            // Apply special ability if available
            if (arr[v] == 2) {
                w /= 2;
                if (K > 0) {
                    w = min(w, dist[u]);
                    K--;
                }
            } else if (arr[v] == 0) {
                w = 0;
            }
            
            if (dist[v] > dist[u] + w) {
                dist[v] = dist[u] + w;
                pq.push({dist[v], v});
            }
        }
    }
    
    // Return the minimum time to reach Cyberland
    return dist[H] == INF ? -1 : dist[H];
}

• 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