| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 472468 | ZaZo_ | Toll (BOI17_toll) | C++14 | 3077 ms | 6196 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 ZAZO ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
using namespace std;
vector<pair<int,int>>edges[50001];
int k , n , m , o ;
int djk(int s , int e)
{
int dist[n+1];
for(int i = 0 ; i < n+1 ; i ++) dist[i]=1e15;
priority_queue<pair<int,int>>pq;
dist[s]=0;
pq.push({0,s});
while(!pq.empty())
{
int c = -pq.top().first , u = pq.top().second;
pq.pop();
for(int i = 0 ; i < edges[u].size() ; i++)
{
if(dist[edges[u][i].first] > dist[u] + edges[u][i].second)
{
dist[edges[u][i].first] = dist[u] + edges[u][i].second;
pq.push({-dist[edges[u][i].first],edges[u][i].first});
}
}
}
return dist[e];
}
int32_t main() {
ZAZO
cin >> k >> n >> m >> o ;
for(int i = 0 ; i < m ; i ++)
{
int a , b , t;
cin >> a >> b >> t;
edges[a].push_back({b,t});
edges[b].push_back({a,t});
}
while(o--)
{
int a , b;
cin >> a >> b;
int ans=djk(a,b);
if(ans==1e15) cout<<"-1"<<endl;
else
cout<<ans<<endl;
}
}
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... | ||||
