제출 #773055

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
773055		JakobZorz	Cyberland (APIO23_cyberland)	C++17	15 / 100	24 ms	7932 KiB

cyberland

#include "cyberland.h"
#include <vector>
#include <iostream>
#include <limits.h>
#include <queue>
#include <algorithm>
typedef long long ll;
const double MAX_DIST=1e18;
using namespace std;

int n,m,k,h;
vector<pair<int,double>>nodes[100000];
double dist[100000];

double solve(int N,int M,int K,int H,vector<int>x,vector<int>y,vector<int>c,vector<int>arr){
    n=N;
    m=M;
    k=K;
    h=H;
    for(int i=0;i<n;i++){
        nodes[i].clear();
        dist[i]=MAX_DIST;
    }
    for(int i=0;i<m;i++){
        nodes[x[i]].emplace_back(y[i],c[i]);
        nodes[y[i]].emplace_back(x[i],c[i]);
    }
    dist[0]=0;
    queue<int>q;
    for(int i=0;i<n;i++){
        if(arr[i]==0){
            dist[i]=0;
            q.push(i);
        }
    }
    q.push(0);
    while(!q.empty()){
        int curr=q.front();
        q.pop();
        for(pair<int,ll>ne:nodes[curr]){
            double new_dist=dist[curr]+ne.second;
            if(new_dist<dist[ne.first]){
                dist[ne.first]=new_dist;
                q.push(ne.first);
            }
        }
    }
    
    double res=dist[h];
    if(res==MAX_DIST)
        res=-1;

    return res;
}

• Subtask 1: 0 / 5
• Subtask 2: 8 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 19
• Subtask 5: 7 / 7
• Subtask 6: 0 / 16
• Subtask 7: 0 / 29
• Subtask 8: 0 / 3