제출 #973486

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

cyberland

#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
vector<vector<pair<int,double>>> al;
vector<int> nodes;

void dfs(int u, int p, int H, vector<int> a) {
    if (u==H) return;
    if (a[u]==0) nodes.push_back(u);
    for (auto v: al[u]) {
        if (v.first==p) continue;
        dfs(v.first,u,H,a);
    }
}
 
double solve(int N, int M, int K, int H, vector<int> x, vector<int>
y, vector<int> c, vector<int> a) {
    al.assign(N,vector<pair<int,double>>());
    nodes.clear();
    for (int i=0; i<M; i++) {
        al[x[i]].push_back({y[i],c[i]});
        al[y[i]].push_back({x[i],c[i]});
    }
    dfs(0,-1,H,a);
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> q;
    vector<int> dist(N,1e9);
    for (int i: nodes) {
        q.push({0,i});
        dist[i]=0;
    }
    while (!q.empty()) {
        int u=q.top().second; q.pop();
        for (auto v: al[u]) {
            if (dist[u]+v.second<dist[v.first]) {
                dist[v.first]=dist[u]+v.second;
                q.push({dist[v.first],v.first});
            }
        }
    }
    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