oj.uz

Submission #749135

# Submission time Handle Problem Language Result Execution time Memory
749135 2023-05-27T11:46:22 Z gun_gan Cyberland (APIO23_cyberland) C++17
44 / 100
 3000 ms 9008 KB 
#include <bits/stdc++.h>
#include "cyberland.h"
using namespace std;
typedef long long ll;

double solve(int N, int M, int K, int H, vector<int> x, vector<int>
y, vector<int> c, vector<int> arr) {
	vector<vector<pair<int,int>>> g(N);
	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]});
	}
	priority_queue<pair<ll,ll>> pq;

	vector<double> d(N, 1e18), dd(N, 1e18);
	
	{
		dd[0] = 0;
		pq.push({0, 0});

		while(!pq.empty()) {
			auto [x, v] = pq.top(); pq.pop();
			x = -x;
			if(dd[v] < x) continue;
			for(auto [u, w] : g[v]) {
				if(dd[u] > x + w && u != H) {
					dd[u] = x + w;
					pq.push({-dd[u], u});
				}
			} 
		}
	}

	arr[0] = 0;
	for(int i = 0; i < N; i++) if(!arr[i] && dd[i] == 1e18) arr[i] = 1;

	{
		for(int i = 0; i < N; i++) {
			if(!arr[i] && dd[i] != 1e18) {
				d[i] = 0;
				pq.push({0, i});
			}
		}

		while(!pq.empty()) {
			auto [x, v] = pq.top(); pq.pop();
			x = -x;
			if(d[v] < x) continue;
			for(auto [u, w] : g[v]) {
				if(d[u] > x + w && u != H) {
					d[u] = x + w;
					pq.push({-d[u], u});
				}
			} 
		}
	}


	double res = 1e18;

	for(auto [u, w] : g[H]) {
		res = min(res, d[u] + w);
	}

	for(int k = 1; k <= K; k++) {
		vector<double> nd(N, 1e18);

		for(int i = 0; i < N; i++) {
			nd[i] = d[i];
			if(arr[i] == 2 && nd[i] != 1e18) nd[i] /= 2;
			if(nd[i] != 1e18) pq.push({-nd[i], i});
		}

		while(!pq.empty()) {
			auto [x, v] = pq.top(); pq.pop();
			x = -x;
			if(nd[v] < x) continue;
			for(auto [u, w] : g[v]) {
				if(nd[u] > x + w && u != H) {
					nd[u] = x + w;
					pq.push({-nd[u], u});
				}
			} 
		}

		swap(nd, d);
		for(auto [u, w] : g[H]) {
			res = min(res, d[u] + w);
		}
	}

	if(res == 1e18) res = -1;
	return res;
}	

// int main() {
// 	cin.tie(0); ios_base::sync_with_stdio(0);

// 	cout << fixed << setprecision(1) << solve(4, 4, 30, 3, {0, 0, 1, 2}, {1, 2, 3, 3}, {5, 4, 2, 4}, {1, 0, 2, 1}) << '\n';
// 	cout << fixed << setprecision(1) << solve(3, 2, 30, 2, {1, 2}, {2, 0}, {12, 4}, {1, 2, 1}) << '\n';
// }

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 444 KB Correct.
2 Correct 143 ms 484 KB Correct.
3 Correct 127 ms 448 KB Correct.
4 Correct 133 ms 468 KB Correct.
5 Correct 127 ms 460 KB Correct.
6 Correct 158 ms 1840 KB Correct.
7 Correct 221 ms 1788 KB Correct.
8 Correct 93 ms 3160 KB Correct.
9 Correct 82 ms 396 KB Correct.
10 Correct 86 ms 396 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 440 KB Correct.
2 Correct 149 ms 440 KB Correct.
3 Correct 133 ms 460 KB Correct.
4 Correct 94 ms 408 KB Correct.
5 Correct 90 ms 396 KB Correct.
6 Correct 34 ms 1492 KB Correct.

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 500 KB Correct.
2 Correct 70 ms 460 KB Correct.
3 Correct 75 ms 484 KB Correct.
4 Correct 89 ms 1412 KB Correct.
5 Correct 48 ms 420 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 468 KB Correct.
2 Correct 64 ms 456 KB Correct.
3 Correct 49 ms 9008 KB Correct.
4 Correct 57 ms 1264 KB Correct.
5 Correct 59 ms 340 KB Correct.
6 Correct 72 ms 476 KB Correct.

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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