oj.uz

Submission #749117

# Submission time Handle Problem Language Result Execution time Memory
749117 2023-05-27T11:11:39 Z gun_gan Cyberland (APIO23_cyberland) C++17
15 / 100
 755 ms 6356 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);
	d[0] = 0;
	pq.push({0, 0});

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

	while(!pq.empty()) {
		auto [x, v] = pq.top(); pq.pop();
		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});
			}
		} 
	}

	double res = d[H];
	if(res == 1e18) res = -1;
	return res;
}	

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

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

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 460 KB Correct.
2 Correct 25 ms 424 KB Correct.
3 Correct 24 ms 412 KB Correct.
4 Correct 25 ms 440 KB Correct.
5 Correct 24 ms 440 KB Correct.
6 Correct 20 ms 1220 KB Correct.
7 Correct 25 ms 1220 KB Correct.
8 Correct 10 ms 2264 KB Correct.
9 Correct 24 ms 372 KB Correct.
10 Correct 24 ms 372 KB Correct.

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 464 KB Correct.
2 Correct 93 ms 428 KB Correct.
3 Correct 98 ms 436 KB Correct.
4 Correct 755 ms 1072 KB Correct.
5 Correct 24 ms 340 KB Correct.

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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