Submission #706700

#	Time	Username	Problem	Language	Result	Execution time	Memory
706700		Trisanu_Das	Sightseeing (NOI14_sightseeing)	C++17	15 / 25	3533 ms	128560 KiB

sightseeing

#include <bits/stdc++.h>
using namespace std;
 
int main() {
	int v, e, q; cin >> v >> e >> q;
	vector<pair<int, int> > adj[v + 1];
 
	while(e--){
		int u, v, w;
		cin >> u >> v >> w;
		adj[u].push_back({w, v});
		adj[v].push_back({w, u});
	}
 
	set<pair<int, int> > dij;
	vector<int> dp(v + 1, 0);
	dp[1] = 1e9 + 1;
	dij.insert({dp[1], 1});
	while(!dij.empty()){
		int u = dij.rbegin()->second;
		dij.erase(*dij.rbegin());
		for(pair<int, int> vv : adj[u]) {
			int quality = min(vv.first, dp[u]);
			if(quality > dp[vv.second]) {
				dp[vv.second] = quality;
				dij.insert({dp[vv.second], vv.second});
			}
		}
	}
	while(q--){
		int x; cin >> x; cout << dp[x] << '\n';
	}
}

• Subtask 1: 4 / 4
• Subtask 2: 5 / 5
• Subtask 3: 6 / 6
• Subtask 4: 0 / 10