제출 #839961

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
839961		veehj	사이버랜드 (APIO23_cyberland)	C++17	15 / 100	66 ms	9812 KiB

cyberland

#include "cyberland.h"

#include <vector>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define F first
#define S second
#define pb push_back
#define sz(a) (int)a.size()
#define all(x) (x).begin(), (x).end()

double solve(int n, int m, int k, int h, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    vector<ll> dp(n, -1);
    vector<vector<pair<ll, ld>>> adj(n);
    for(int i=0; i<m; i++){
        adj[x[i]].pb({y[i], c[i]});
        adj[y[i]].pb({x[i], c[i]});
    }
    priority_queue<pair<ll, ld>, vector<pair<ll, ld>>, greater<pair<ll, ld>>> q;
    q.push({0, 0});
    while(!q.empty()){
        ll cst=q.top().S, nw=q.top().F;
        q.pop();
        if(arr[nw]==0) cst=0;
        if(arr[nw]==2) cst/=2;
        if(dp[nw]<=cst && dp[nw]!=-1) continue;
        dp[nw]=cst;
        for(auto& u : adj[nw]){
            if(dp[u.F]==-1 || dp[u.F]>cst+u.S){
                q.push({u.F, cst+u.S});
            }
        }
    }
    return dp[h]; 
}

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