oj.uz

Submission #837014

# Submission time Handle Problem Language Result Execution time Memory
837014 2023-08-24T19:48:07 Z aZvezda Cyberland (APIO23_cyberland) C++17
0 / 100
 3000 ms 68796 KB 
#include "cyberland.h"

#include <bits/stdc++.h>

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

typedef long double ld;

ld dist[MAX_N][MAX_K];

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

bool used[MAX_N];

void dfs(int x) {
	if(used[x]) { return; }
	used[x] = true;

	for(const auto &it : g[x]) {
		dfs(it.first);
	}
}

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 < M; i ++) {
		g[x[i]].push_back({y[i], c[i]});
		g[y[i]].push_back({x[i], c[i]});
	}

	dfs(0);

	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[i][j] = 1e18;
		}
	}

	std::priority_queue<std::pair<ld, std::pair<int, int> > > pq;

	for(int i = 0; i < N; i ++) {
		if((used[i] && arr[i] == 0) || i == 0) {
			for(int j = 0; j <= K - (int)(i != 0); j ++) {
				dist[i][j] = 0;
				pq.push({0, {i, j}});
			}
		}
	}

	while(!pq.empty()) {
		auto curr = pq.top(); pq.pop();
		curr.first *= -1;
		if(curr.first > dist[curr.second.first][curr.second.second]) {
			continue;
		}
		if(curr.second.second > 0 && arr[curr.second.second] == 2) {
			if(curr.first < dist[curr.second.first][curr.second.second - 1]) {
				pq.push({curr.first, {curr.second.first, curr.second.second - 1}});
			}
		}
		for(const auto &it : g[curr.second.first]) {
			ld new_dist = curr.first + it.second / pw[curr.second.second];
			if(new_dist < dist[it.first][curr.second.second]) {
				dist[it.first][curr.second.second] = new_dist;
				pq.push({-new_dist, {it.first, curr.second.second}});
			}
		}
	}

	return dist[N - 1][0];
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3058 ms 2904 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1627 ms 5804 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 2017 ms 7692 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 1079 ms 68796 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 1606 ms 5320 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1636 ms 11008 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 2320 ms 6300 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 2368 ms 6248 KB Wrong Answer.
2 Halted 0 ms 0 KB -