제출 #1198493

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

cyberland

#include<bits/stdc++.h>
#define pb push_back
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) {
    vector<vector<pair<int, int>>> edge(N);
    for (int i = 0; i < M; i ++) {
        edge[x[i]].pb({y[i], c[i]});
        edge[y[i]].pb({x[i], c[i]});
    }

    priority_queue<pair<int, int>> pq;
    pq.push({0, 0});
    vector<bool> visited(N, false);
    vector<int> dist(N, 1e9+1);
    dist[0] = 0;

    while (!pq.empty()) {
        int v = pq.top().second; pq.pop();

        if (visited[v]) continue;
        if (v == H) {break;}
        visited[v] = true;
        for (auto [u, w] : edge[v]) {
            if (dist[v] + w < dist[u]) {
                dist[u] = dist[v] + w;
                pq.push({-dist[u], u});
            }
        }
    }

    if (dist[H] == 1e9+1) {return (double)-1;}
    return (double)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