Submission #971665

#	Time	Username	Problem	Language	Result	Execution time	Memory
971665		Nomio	Cyberland (APIO23_cyberland)	C++17	15 / 100	25 ms	7248 KiB

cyberland

#include <bits/stdc++.h>
using namespace std;
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> a) {
	vector<pair<int, int>> v[n];
	for(int i = 0; i < m; i++) {
		v[x[i]].push_back({y[i], c[i]});
		v[y[i]].push_back({x[i], c[i]});
	}
	priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;
	vector<ll> dis(n, 1e18);
	dis[0] = 0;
	pq.push({0, 0});
	while(!pq.empty()) {
		ll x = pq.top().first;
		int y = pq.top().second;
		pq.pop();
		if(dis[y] != x) continue;
		for(pair<int, int> p : v[y]) {
			int X = p.first;
			int Y = p.second;
			if(a[X] == 0 && dis[X] != 0) {
				dis[X] = 0;
				pq.push({0, X});	
			} else if(dis[X] > dis[y] + Y) {
				dis[X] = dis[y] + Y;
				pq.push({dis[X], X});
			}
		}
	}
	if(dis[h] == 1e18) {
		return -1;
	}
	queue<int> q;
	q.push(h);
	bool vis[n] {};
	vis[0] = vis[h] = 1;
	ll S = dis[h];
	while(!q.empty()) {
		int X = q.front();
		q.pop();
		if(a[X] == 0) S = min(S, dis[X]);
		for(pair<int, int> p : v[X]) {
			if(!vis[p.first]) {
				vis[p.first] = 1;
				q.push(X);
			}
		}
	}
	return S;
}
//
//int main() {
//	cout << solve(4, 4, 30, 3, {0, 0, 1, 2}, {1, 2, 3, 3}, {5, 4, 2, 4}, {1, 0, 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