제출 #880347

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

cyberland

#include "cyberland.h"
#include<bits/stdc++.h>
#include <vector>
using namespace std;
#define ll long long
const ll INF=1e18;

vector<vector<pair<int,int>>>v;
vector<bool>v1,v2;

void dfs(int x){
    v1[x]=true;
    for(auto [y,z]:v[x]){
        if(!v1[y]) dfs(y);
    }
}

void dfss(int x){
    v2[x]=true;
    for(auto [y,z]:v[x]){
        if(!v2[y]) dfs(y);
    }
}

double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    // bool subtask=true;
    // for(int i=0;i<N;i++) if(arr[i]!=1) subtask=false;
    // if(subtask){
    v.resize(N);
        for(int i=0;i<M;i++){
            v[x[i]].push_back({y[i],c[i]});
            v[y[i]].push_back({x[i],c[i]});
        }
        vector<bool>vis(N,0);
        priority_queue<pair<ll,int>>q;
        vector<ll>dp(N,INF);
        v1.assign(N,0);
        v2.assign(N,0);
        dfs(0);
        dfss(H);
        dp[0]=0;
        q.push({0,0});
        for(int i=0;i<N;i++){
            if(arr[i]==0&&v1[i]&&v2[i]){
                dp[i]=0;
                q.push({0,i});
            }
        }
        while(!q.empty()){
            int x=q.top().second;
            q.pop();
            if(vis[x]) continue;
            vis[x]=true;
            for(auto [z,y]:v[x]){
                if(dp[x]+y<dp[z]){
                    dp[z]=dp[x]+y;
                    q.push({-dp[z],z});
                }
            }
        }
        if(dp[H]==INF) return -1.0;
        return 1.0*dp[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