Submission #917809

#	Time	Username	Problem	Language	Result	Execution time	Memory
917809		XXBabaProBerkay	Cyberland (APIO23_cyberland)	C++17	15 / 100	28 ms	6740 KiB

cyberland

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

#define F first
#define S second

using ll = long long;

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]);
	}

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

	dist[0] = 0;
	PQ.emplace(0, 0);
	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: 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