제출 #977698

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

cyberland

#define ll long long
#include <bits/stdc++.h>
#include "cyberland.h"

using namespace std;

const ll N=1e5+9;

ll vis[N],a[N],g;
pair<ll,ll>p;
vector<pair<ll,ll>>v[N];
vector<ll>o;
priority_queue<pair<ll,ll>>q;

void dfs(ll nd)
{
    if(vis[nd])return;
    vis[nd]=1;
    if(!a[nd])o.push_back(nd);
    for(auto i:v[nd])dfs(i.second);
}

double solve(int n, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {

    vector<ll>dis(n,1e18);
    double ans=1e9+9;
    for(ll i=0;i<n;++i)
    {
        a[i]=arr[i];
        vis[i]=0,v[i].clear();
    }

    for(ll i=0;i<M;++i)
    {
        v[x[i]].push_back({c[i],y[i]});
        v[y[i]].push_back({c[i],x[i]});
    }

    dfs(0);
    for(ll i=0;i<n;++i)vis[i]=0;

    dis[H]=0;

    q.push({0,H});

    while(q.size())
    {
        p=q.top();
        g=p.second;
        q.pop();

        if(vis[g])continue;
        vis[g]=1;

        for(auto i:v[g])
        {
            if(dis[g]+i.first<dis[i.second])
            {
                dis[i.second]=dis[g]+i.first;
                q.push({-dis[i.second],i.second});
            }
        }
    }

    o.push_back(0);

    for(auto i:o)ans=min(ans,double(dis[i]));

    if(ans==1e9+9)ans=-1;

    return ans;
}

• 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