제출 #1152994

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

cyberland

#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using vll = vector<ll>;
using ld = long double;


double solve(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr) {
    
    vector<vector<pair<ll,ll>>> adj(N+1);
    for(int i = 0; i < M; i++){
        ll a = x[i];
        ll b = y[i];
        ll w = c[i];
        adj[a].push_back({b,w});
        adj[b].push_back({a,w});
    }


    // first BFS: check which 0s we can actually reach
    vector<bool> works(N+1,0);
    vector<bool> vis(N+1,0);

    vis[0] = 1;
    queue<ll> q;
    q.push(0);
    while(!q.empty()){
        ll at = q.front();
        q.pop();
        for(pair<ll,ll> p : adj[at]){
            ll node = p.first;
            if(vis[node]) continue;
            if(node == H) continue;

            vis[node] = 1;
            works[node] = 1;
            q.push(node);
        }
    }

    vis.clear();
    queue<pair<ll,ll>> qq;

    ll mn = 1e18;

    vis[H] = 1;
    qq.push({H,0});
    while(!qq.empty()){
        pair<ll,ll> temp = qq.front();
        qq.pop();
        ll at = temp.first;
        ll dist = temp.second;
    
        for(pair<ll,ll> edge : adj[at]){
            if(vis[edge.first]) continue;
            vis[edge.first] = 1;
        
            if((arr[edge.first] == 0 and works[edge.first]) or edge.first == 0){
                mn = min(dist+edge.second, mn);
            }

            qq.push({edge.first, edge.second+dist});
        }
    }

    return mn;
    
    // return -1;
}

• 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