제출 #919938

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
919938		XXBabaProBerkay	사이버랜드 (APIO23_cyberland)	C++17	44 / 100	39 ms	11856 KiB

cyberland

#include <bits/stdc++.h>
using namespace std;

#define F first
#define S second

using ll = long long;

const int INF = 1e9 + 7;

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

	queue<int> Q;
	vector<bool> vis(N);
	Q.push(0);
	vis[0] = 1;
	while (!Q.empty())
	{
		int u = Q.front();
		Q.pop();

		for (pair<int, int> i : adj[u])
			if (!vis[i.F] && i.F != H)
			{
				vis[i.F] = 1;
				Q.push(i.F);
			}
	}

	priority_queue<pair<double, int>, vector<pair<double, int>>, greater<pair<double, int>>> PQ;
	vector<double> dist(N, 1e18);

	for (int i = 1; i < N; i++)
		if (vis[i] && !arr[i])
		{
			dist[i] = 0;
			PQ.emplace(0, i);
		}

	dist[0] = 0;
	PQ.emplace(0, 0);
	while (!PQ.empty())
	{
		auto [d, u] = PQ.top();
		PQ.pop();

		if (d != dist[u])
			continue;

		for (pair<int, double> i : adj[u])
		{
			auto [v, w] = i;
			if (dist[v] > dist[u] + w)
				PQ.emplace(dist[v] = dist[u] + w, v);
		}
	}

	vector<double> dist2(N, 1e18);
	
	for (int i = 1; i < N; i++)
		if (vis[i] && !arr[i])
		{
			dist2[i] = 0;
			PQ.emplace(0, i);
		}

	dist2[0] = 0;
	PQ.emplace(0, 0);
	while (!PQ.empty())
	{
		auto [d, u] = PQ.top();
		PQ.pop();

		if (d != dist2[u])
			continue;

		for (pair<int, double> i : adj[u])
		{
			auto [v, w] = i;
			if (arr[v] == 2 && dist2[v] > min(dist2[u] + w, dist[u] + w / 2.0))
				PQ.emplace(dist2[v] = min(dist2[u] + w, dist[u] + w / 2.0), v);
			else if (arr[v] != 2 && dist2[v] > dist2[u] + w)
				PQ.emplace(dist2[v] = dist2[u] + w, v);
		}
	}

	return (dist[H] == 1e18 ? -1 : (double)dist[H]);
}

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