제출 #919156

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
919156		XXBabaProBerkay	사이버랜드 (APIO23_cyberland)	C++17	0 / 100	33 ms	7384 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, ll>>> adj(N);
	for (int i = 0; i < M; i++)
	{
		adj[x[i]].emplace_back(y[i], c[i]);
		adj[y[i]].emplace_back(x[i], c[i]);
	}

	queue<int> Q;
	vector<bool> vis(N + 1, 0);
	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])
			{
				vis[i.F] = 1;
				Q.push(i.F);
			}
	}
 
	priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> PQ;
	vector<ll> dist(N, 1e18);

	for (int i = 0; i < N; i++)
		if (vis[i] && !arr[i])
		{
			dist[i] = 0;
			PQ.emplace(0, i);
		}
 
	while (!PQ.empty())
	{
		auto [d, u] = PQ.top();
		PQ.pop();
 
		if (d != dist[u])
			continue;
 
		ll t = (arr[u] == 0 ? 0 : dist[u]);
		for (pair<int, ll> i : adj[u])
		{
			auto [v, w] = i;
			if (dist[v] > t + w)
				PQ.emplace(dist[v] = t + w, v);
		}
	}
 
	return (dist[H] == 1e18 ? -1.0 : double(dist[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