제출 #968429

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
968429		saayan007	사이버랜드 (APIO23_cyberland)	C++17	8 / 100	3213 ms	2097152 KiB

cyberland

#include "bits/stdc++.h"
#include "cyberland.h"
using namespace std;
 
#include <vector>
 
void dfs(int x, int p, vector<pair<int, double>> adj[], double dist[], vector<int> &arr, int H) {
    if(arr[x] == 0) dist[x] = 0;
    if(x == H) return;
    for(auto [y, w] : adj[x]) {
        if(y == p) continue;
        dfs(y, x, adj, dist, arr, H);
    }
}

double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    vector<pair<int, double>> adj[N];
    for(int i = 0; i < M; ++i) {
        adj[x[i]].emplace_back(y[i], c[i]);
        adj[y[i]].emplace_back(x[i], c[i]);
    }
 
    double dist[N];
    for(int i = 0; i < N; ++i) dist[i] = -1;
    dist[0] = 0;
 
    dfs(0, -1, adj, dist, arr, H);
 
    priority_queue<pair<double, int>> pq;
    for(int i = 0; i < N; ++i) {
        if(arr[i] == 0 || i == 0) {
            dist[i] = 0;
            pq.emplace(-dist[i], i);
        }
    }
 
    while(!pq.empty()) {
        int a = pq.top().second;
        double d = -pq.top().first;
        pq.pop();
        if(dist[a] < d || a == H) {
            continue;
        }
 
        for(auto [b, w] : adj[a]) {
            if(dist[b] == -1 || d + w < dist[b]) {
                dist[b] = d + w;
                pq.emplace(-dist[b], b);
            }
        }
    }
 
    return dist[H];
}

• Subtask 1: 0 / 5
• Subtask 2: 8 / 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