# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
463695 | _Avocado_ | Toll (BOI17_toll) | C++14 | 3071 ms | 8372 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 <bits/stdc++.h>
#define int int64_t
using namespace std;
vector<vector<pair<int, int>>>graph;
vector<int>dijkstra(int s, int n){
priority_queue<pair<int, int>>pq;
vector<int>dist(n, -1);
pq.push({0, s});
while(!pq.empty()){
int d = -pq.top().first;
int u = pq.top().second;
pq.pop();
if(dist[u] != -1) continue;
dist[u] = d;
for(auto [v, w]: graph[u]){
pq.push({-(w+dist[u]), v});
}
}
return dist;
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |