oj.uz

Submission #749124

# Submission time Handle Problem Language Result Execution time Memory
749124 2023-05-27T11:24:36 Z gun_gan Cyberland (APIO23_cyberland) C++17
44 / 100
 44 ms 8396 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<ll> d(N, 1e18), dd(N, 1e18);
	{
		d[H] = 0;
		pq.push({0, H});

		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) {
					d[u] = x + w;
					pq.push({-d[u], u});
				}
			} 
		}
	}
	{
		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;
	double res = 1e18;
	for(int i = 0; i < N; i++) if(!arr[i] && dd[i] != 1e18) res = min(res, (double)d[i]);
	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 17 ms 468 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 488 KB Correct.
2 Correct 32 ms 432 KB Correct.
3 Correct 28 ms 468 KB Correct.
4 Correct 30 ms 448 KB Correct.
5 Correct 41 ms 460 KB Correct.
6 Correct 28 ms 1344 KB Correct.
7 Correct 32 ms 1320 KB Correct.
8 Correct 15 ms 2480 KB Correct.
9 Correct 27 ms 340 KB Correct.
10 Correct 27 ms 340 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 428 KB Correct.
2 Correct 29 ms 480 KB Correct.
3 Correct 27 ms 452 KB Correct.
4 Correct 29 ms 400 KB Correct.
5 Correct 28 ms 388 KB Correct.
6 Correct 6 ms 1236 KB Correct.

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 468 KB Correct.
2 Correct 36 ms 444 KB Correct.
3 Correct 26 ms 448 KB Correct.
4 Correct 27 ms 1176 KB Correct.
5 Correct 23 ms 400 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 444 KB Correct.
2 Correct 23 ms 476 KB Correct.
3 Correct 44 ms 8396 KB Correct.
4 Correct 17 ms 1072 KB Correct.
5 Correct 26 ms 368 KB Correct.
6 Correct 25 ms 468 KB Correct.

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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