oj.uz

Submission #124569

# Submission time Handle Problem Language Result Execution time Memory
124569 2019-07-03T14:01:20 Z NMAC427 Sightseeing (NOI14_sightseeing) C++17
15 / 25
 3500 ms 141652 KB 
// https://oj.uz/problem/view/NOI14_sightseeing

#include <bits/stdc++.h>

#define int int32_t
#define coutV(x) for (const auto& e: x) {cerr << e << " ";} cerr << "\n"

using namespace std;

int V, E, Q;

vector<vector<pair<int, int>>> adj;

signed main() {
	
	#ifndef __APPLE__
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	#endif

	cin >> V >> E >> Q;
	adj.resize(V);

	for (int i = 0; i < E; i++) {
		int v1, v2, q;
		cin >> v1 >> v2 >> q;

		adj[v1 - 1].emplace_back(v2 - 1, q);
		adj[v2 - 1].emplace_back(v1 - 1, q);
	}


	// Dijkstra

	vector<int> visited (V, -1);
	priority_queue<pair<int, int>> pq;
	pq.push({INT32_MAX, 0});

	while (!pq.empty()) {
		auto top = pq.top();
		pq.pop();

		int v = top.second;
		int pathQ = top.first;

		if (visited[v] != -1 && visited[v] > pathQ) {
			continue;
		}

		visited[v] = pathQ;

		for (const auto& child: adj[v]) {
			int childQ = min(child.second, pathQ);
			if (visited[child.first] != -1 && visited[child.first] >= childQ) continue;
			visited[child.first] = childQ;
			pq.push({childQ, child.first});
		}
	}

	for (int i = 0; i < Q; i++) {
		int x;
		cin >> x;

		cout << visited[x - 1] << "\n";
	}
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 3 ms 376 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 4216 KB Output is correct
2 Correct 34 ms 3576 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3141 ms 103408 KB Output is correct
2 Execution timed out 3544 ms 141652 KB Time limit exceeded