Submission #389783

#TimeUsernameProblemLanguageResultExecution timeMemory
389783strawberry2005Sightseeing (NOI14_sightseeing)C++17
15 / 25
3569 ms262144 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long const int mod = 1e9+7; #define deb(x) cout<<#x<<": "<<x<<endl int iceil(int a, int b) { return (a + b - 1) / b; } vector<pair<int,int>> adj[500001]; vector<int> widest(500001,-mod); priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>> pq; signed main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.precision(20); #ifdef strawberryshaker2005 freopen("input.txt", "r", stdin); #endif int n,k,q; cin>>n>>k>>q; for(int i=0;i<k;i++){ ll a,b,c; cin>>a>>b>>c; adj[a].push_back({b,c}); adj[b].push_back({a,c}); } widest[1]=mod;pq.push({1,0}); while(!pq.empty()){ ll cur_node=pq.top().first,cur_d=pq.top().second; pq.pop(); for(pair<int,int> x:adj[cur_node]){ ll dist=max(widest[x.first],min(widest[cur_node],x.second)); if(dist>widest[x.first]){ widest[x.first]=dist; pq.push({x.first,dist}); } } } for(int i=0;i<q;i++){ ll f; cin>>f; cout<<widest[f]<<endl; } return(0); }

Compilation message (stderr)

sightseeing.cpp: In function 'int main()':
sightseeing.cpp:37:36: warning: unused variable 'cur_d' [-Wunused-variable]
   37 |         ll cur_node=pq.top().first,cur_d=pq.top().second;
      |                                    ^~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...