제출 #979464

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

cyberland

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

    int dist = -1;
    vector<bool> seen(N, false);
    priority_queue<pair<double,int>> pq;
    pq.push({(double) 0, 0});
    while (!pq.empty()){
        double d = -pq.top().first;
        int cur = pq.top().second;
        pq.pop();
        if (cur == H){
            dist = d;
            break;
        }
        if (seen[cur]) continue;
        seen[cur] = true;
        for (pair<int,int> next : g[cur]) pq.push({-(d+next.second), next.first});
    }

    unordered_set<int> s;
    seen.clear();
    seen.resize(N, false);
    queue<int> q;
    q.push(0);
    while (!q.empty()){
        int cur = q.front();
        q.pop();
        if (cur == H) continue;
        if (seen[cur]) continue;
        seen[cur] = true;
        if (arr[cur] == 0) s.insert(cur);
        for (pair<int,int> next : g[cur]) q.push(next.first);
    }

    seen.clear();
    seen.resize(N, false);
    while (!pq.empty()) pq.pop();
    pq.push({(double) 0, H});
    while (!pq.empty()){
        double d = -pq.top().first;
        int cur = pq.top().second;
        pq.pop();
        if (s.find(cur) != s.end()){
            if (d < dist) return d;
            else break;
        }
        if (seen[cur]) continue;
        seen[cur] = true;
        for (pair<int,int> next : g[cur]) pq.push({-(d+next.second), next.first});
    }

    return dist;
}

• 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