Submission #983340

#	Time	Username	Problem	Language	Result	Execution time	Memory
983340		crispxx	Cyberland (APIO23_cyberland)	C++17	15 / 100	87 ms	5912 KiB

cyberland

#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tree <int, null_type, less<int>, rb_tree_tag, 
		tree_order_statistics_node_update> ordered_set;
typedef pair<double, int> pii;
#define nl '\n'
#define vt vector
#define ar array
#define pb push_back
#define ff first
#define ss second

const int INF = INT_MAX;
double solve(int N, int M, int K, int H, vt<int> x, vt<int> y, vt<int> c, vt<int> arr) {
	int n = N, m = M, k = K, h = H;
	vt<pair<int, int>> adj[n];
	for(int i = 0; i < M; i++) {
		adj[x[i]].pb({y[i], c[i]});
		adj[y[i]].pb({x[i], c[i]});
	}
	vector<double> d(N, numeric_limits<double>::max());
	priority_queue<pii, vt<pii>, greater<pii>> q;
	d[0] = 0;
	q.push({0, 0});
	while(!q.empty()) {
		int u = q.top().ss;
		double res = q.top().ff;
		q.pop();
		
		if(u == h) return res;
		int ch = k;
		if(arr[u] == 2) ch--, res/=2;
		for(auto &edge : adj[u]) {
			int v = edge.ff;
			int c = edge.ss;
			double nw = res + c;
			
			if(arr[v] == 0) nw = res;
			if(arr[v] == 2 && ch) {
				nw = res + c / 2.;
				ch--;
			}
			
			if(nw < d[v]) {
				d[v] = nw;
				q.push({nw, v});
			}
		}
	}
	return -1;
}

Compilation message (stderr)

cyberland.cpp: In function 'double solve(int, int, int, int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
cyberland.cpp:20:13: warning: unused variable 'm' [-Wunused-variable]
   20 |  int n = N, m = M, k = K, h = 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