제출 #769941

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
769941		gromperen	사이버랜드 (APIO23_cyberland)	C++17	15 / 100	25 ms	5712 KiB

cyberland

#include "cyberland.h"

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const double INF = 1e18;

double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
	vector<double> dist(N, INF);
	vector<vector<pair<int,int>>> adj(N);
	for (int i = 0; i < M; ++i) {
		adj[x[i]].push_back({y[i], c[i]});
		adj[y[i]].push_back({x[i], c[i]});
	}

	priority_queue<pair<double,int>, vector<pair<double,int>>, greater<pair<double,int>>> pq;
	arr[0] = 0;


	pq.push({0,0});
	//for (int i = 0; i < N; ++i) {
		//if (arr[i] == 0) pq.push({0, i});
	//}


	while(!pq.empty()) {
		int cur = pq.top().second;
		double d = pq.top().first;
		pq.pop();
		if (dist[cur] < d) continue;
		dist[cur] = d;
		//if (arr[cur] == 0) return d;
		for (auto [nxt, cost] : adj[cur]) {
			if (arr[nxt] == 0 && dist[nxt] > 0) {
				dist[nxt] = 0;
				pq.push({dist[nxt], nxt});
			}
			if (dist[nxt] > d + cost) {
				dist[nxt] = d + cost;
				pq.push({dist[nxt], nxt});
			}

		}
	}
	if (abs(dist[H] - INF) < 0.01) return -1;
	return dist[H];


}

• 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