제출 #976049

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

cyberland

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

using namespace std;

#define lim 100005
#define OYY INT_MAX
#define fi first
#define se second

int n,m,k,h;

int vis[lim],dist[lim];

vector<pair<int,int>> v[lim];

inline int dij(int node){
	for(int i=0;i<n;i++){
		vis[i]=0;
		dist[i]=OYY;
	}
	
	priority_queue<pair<int,int>> pq;
	pq.push({0,0}); // cur distance --- cur node
	
	dist[0]=0;
	
	while(!pq.empty()){
		int node=pq.top().se;
		pq.pop();
		if(vis[node])continue;
		vis[node]=1;
		for(auto go:v[node]){
			if(dist[node]+go.se<dist[go.fi]){
				dist[go.fi]=dist[node]+go.se;
				pq.push({-dist[go.fi],go.fi});
			}
		}
	}
	
	return dist[h];
} 

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<m;i++){
		v[x[i]].push_back({y[i],c[i]});
		v[y[i]].push_back({x[i],c[i]});
	}
	int cev=dij(0);
	
	for(int i=0;i<n;i++){
		v[i].clear();
	}
	
	return cev;
}

• 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