Submission #900598

#	Time	Username	Problem	Language	Result	Execution time	Memory
900598		Trisanu_Das	Cyberland (APIO23_cyberland)	C++17	68 / 100	1822 ms	324944 KiB

cyberland

#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
 
const int MAX_N = 1e5 + 10, MAX_K = 100;
 
typedef long double ld;
 
ld dist[2][MAX_N][MAX_K];
vector<pair<int, int> > adj[MAX_N];
ld pw[MAX_K];
 
double solve(int N, int M, int K, int H, std::vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
	for(int i = 0; i < N; i ++) adj[i].resize(0);
	for(int i = 0; i < M; i ++) {
		adj[x[i]].push_back({y[i], c[i]});
		adj[y[i]].push_back({x[i], c[i]});
	}
	K = min(K, MAX_K - 1);
	for(int i = 0; i < N; i ++) for(int j = 0; j <= K; j ++) dist[0][i][j] = dist[1][i][j] = 1e18;
	for(int left = K; left >= 0; left --) {
		priority_queue<pair<ld, int> > pq;
		for(int i = 0; i < N; i ++) {
			if(i == 0) {
				dist[0][i][left] = 0;
				pq.push({0, i});
			}
			if(dist[1][i][left] < 1e17) pq.push({-dist[1][i][left], i + MAX_N});
		}
		while(!pq.empty()) {
			auto curr = pq.top(); pq.pop();
			curr.first *= -1;
			bool used = curr.second / MAX_N;
			curr.second %= MAX_N;
			if(curr.second == H) continue;
			if(curr.first > dist[used][curr.second][left]) continue;
			for(const auto &it : adj[curr.second]) {
				ld new_cost = curr.first + it.second;
				if(dist[0][it.first][left] > new_cost) {
					dist[0][it.first][left] = new_cost;
					pq.push({-new_cost, it.first});
				}
			}
		}
		for(int i = 0; i < N; i ++) {
			if(left == 0) continue;
			if(arr[i] == 2) dist[1][i][left - 1] = dist[0][i][left] / 2.0;
			else if(arr[i] == 0 && dist[0][i][left] < 1e17) dist[1][i][left - 1] = 0;
		}
	}
	ld ret = min(dist[0][H][0], dist[1][H][0]);
	if(ret > 1e17) return -1;
	return ret;
}

• Subtask 1: 5 / 5
• Subtask 2: 8 / 8
• Subtask 3: 13 / 13
• Subtask 4: 19 / 19
• Subtask 5: 7 / 7
• Subtask 6: 16 / 16
• Subtask 7: 0 / 29
• Subtask 8: 0 / 3