Submission #749117

#	Time	Username	Problem	Language	Result	Execution time	Memory
749117		gun_gan	Cyberland (APIO23_cyberland)	C++17	15 / 100	755 ms	6356 KiB

cyberland

#include <bits/stdc++.h>
#include "cyberland.h"
using namespace std;
typedef long long ll;

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,int>>> g(N);
	for(int i = 0; i < M; i++) {
		g[x[i]].push_back({y[i], c[i]});
		g[y[i]].push_back({x[i], c[i]});
	}
	priority_queue<pair<ll,ll>> pq;
	vector<ll> d(N, 1e18);
	d[0] = 0;
	pq.push({0, 0});

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

	while(!pq.empty()) {
		auto [x, v] = pq.top(); pq.pop();
		if(d[v] < x) continue;
		for(auto [u, w] : g[v]) {
			if(d[u] > x + w) {
				d[u] = x + w;
				pq.push({d[u], u});
			}
		} 
	}

	double res = d[H];
	if(res == 1e18) res = -1;
	return res;
}	

// int main() {
// 	cin.tie(0); ios_base::sync_with_stdio(0);

// 	cout << fixed << setprecision(1) << solve(3, 1, 30, 2, {1}, {2}, {12}, {1, 2, 1}) << '\n';
// }

• 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