oj.uz

Submission #837056

# Submission time Handle Problem Language Result Execution time Memory
837056 2023-08-24T20:38:01 Z aZvezda Cyberland (APIO23_cyberland) C++17
68 / 100
 1939 ms 322032 KB 
#include "cyberland.h"

#include <bits/stdc++.h>

const int MAX_N = 1e5 + 10;
const int MAX_K = 100;

typedef long double ld;

ld dist[2][MAX_N][MAX_K];

std::vector<std::pair<int, int> > g[MAX_N];

ld pw[MAX_K];

double solve(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr) {
	for(int i = 0; i < N; i ++) {
		g[i].resize(0);
	}

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

	K = std::min(K, MAX_K - 1);

	pw[0] = 1;
	for(int i = 1; i <= K; i ++) {
		pw[i] = (pw[i - 1] * 2.0);
	}

	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 --) {
		std::priority_queue<std::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 : g[curr.second]) {
				ld new_cost = curr.first + (long long)it.second / pw[left];
				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];
			} else if(arr[i] == 0) {
				if(dist[0][i][left] < 1e17) {
					dist[1][i][left - 1] = 0;
				}
			}
		}
	}

	ld ret = std::min(dist[0][H][0], dist[1][H][0]);
	if(ret > 1e17) {
		return -1;
	}

	return ret;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 2904 KB Correct.
2 Correct 46 ms 2772 KB Correct.

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 5940 KB Correct.
2 Correct 199 ms 5844 KB Correct.
3 Correct 196 ms 5844 KB Correct.
4 Correct 209 ms 5892 KB Correct.
5 Correct 209 ms 5880 KB Correct.
6 Correct 291 ms 34028 KB Correct.
7 Correct 387 ms 33452 KB Correct.
8 Correct 182 ms 65452 KB Correct.
9 Correct 123 ms 3028 KB Correct.
10 Correct 122 ms 3028 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 426 ms 5836 KB Correct.
2 Correct 439 ms 5924 KB Correct.
3 Correct 385 ms 6012 KB Correct.
4 Correct 217 ms 3024 KB Correct.
5 Correct 234 ms 3028 KB Correct.
6 Correct 122 ms 28856 KB Correct.

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 353 ms 189608 KB Correct.
2 Correct 265 ms 5940 KB Correct.
3 Correct 236 ms 5972 KB Correct.
4 Correct 244 ms 5932 KB Correct.
5 Correct 147 ms 3028 KB Correct.

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 5960 KB Correct.
2 Correct 128 ms 5992 KB Correct.
3 Correct 129 ms 5964 KB Correct.
4 Correct 206 ms 33848 KB Correct.
5 Correct 79 ms 3028 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 5908 KB Correct.
2 Correct 189 ms 6060 KB Correct.
3 Correct 205 ms 244612 KB Correct.
4 Correct 202 ms 25288 KB Correct.
5 Correct 135 ms 3028 KB Correct.
6 Correct 222 ms 5976 KB Correct.

Subtask #7
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 6040 KB Correct.
2 Correct 41 ms 8148 KB Correct.
3 Incorrect 968 ms 306912 KB Wrong Answer.
4 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 849 ms 6020 KB Correct.
2 Correct 119 ms 8148 KB Correct.
3 Correct 1939 ms 322032 KB Correct.
4 Incorrect 517 ms 25008 KB Wrong Answer.
5 Halted 0 ms 0 KB -