| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 628684 | Iwanttobreakfree | Toll (BOI17_toll) | C++17 | 136 ms | 5852 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 <iostream>
#include <vector>
#include <queue>
using namespace std;
#define int long long
void dijkstra(int a,vector<vector<pair<int,int>>>& g,vector<int>& dist){
for(int i=0;i<dist.size();i++)dist[i]=1e18;
dist[a]=0;
priority_queue<pair<int,int>> pq;
pq.push({0,a});
while(pq.size()){
int u=pq.top().second,d=-pq.top().first;
pq.pop();
if(d>dist[u])continue;
for(auto v:g[u]){
if(dist[v.first]>dist[u]+v.second){
dist[v.first]=dist[u]+v.second;
pq.push({-dist[v.first],v.first});
}
}
}
}
signed main(){
int n,m,o,k,x,y,w;
cin>>k>>n>>m>>o;
vector<vector<pair<int,int>>> g(n,vector<pair<int,int>>());
vector<long long> dist(n,1e18);
while(m--){
cin>>x>>y>>w;
//x--;y--;
g[x].push_back({y,w});
//g[y].push_back({x,w});
}
dijkstra(0,g,dist);
while(o--){
cin>>x>>y;
if(dist[y]==1e18)cout<<-1<<'\n';
else cout<<dist[y]<<'\n';
}
}
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... | ||||
