# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
425447 | errorgorn | 관광 (NOI14_sightseeing) | C++17 | 3602 ms | 248964 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <vector>
#include <utility>
#include <queue>
#include <cstring>
#include <algorithm>
using namespace std;
typedef pair<int,int> ii;
vector<ii> al[500005];
vector<ii>::iterator it;
priority_queue<ii> pq;
int v,e,q,w[500005];
int main(){
//freopen("input.txt","r",stdin);
int a,b,c;
scanf("%d%d%d",&v,&e,&q);
memset(w,-1,sizeof(w));
w[1]=100000000;
pq.push(ii (100000000,1));
while (e--){
scanf("%d%d%d",&a,&b,&c);
al[a].push_back( ii(b,c));
al[b].push_back(ii (a,c));
}
while (!pq.empty()){
a=pq.top().first,b=pq.top().second,pq.pop();
if (w[b]!=a) continue;
for (it=al[b].begin();it!=al[b].end();it++){
if (w[(*it).first]<min(a,(*it).second)){
w[(*it).first]=min(a,(*it).second);
pq.push(ii (w[(*it).first],(*it).first));
}
}
}
while (q--){
scanf("%d",&a);
printf("%d\n",w[a]);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |