#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
toll.cpp: In function 'void dijkstra(long long int, std::vector<std::vector<std::pair<long long int, long long int> > >&, std::vector<long long int>&)':
toll.cpp:7:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
7 | for(int i=0;i<dist.size();i++)dist[i]=1e18;
| ~^~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
59 ms |
3424 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
102 ms |
4448 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
18 ms |
376 KB |
Output is correct |
8 |
Correct |
17 ms |
392 KB |
Output is correct |
9 |
Correct |
56 ms |
3440 KB |
Output is correct |
10 |
Correct |
136 ms |
5780 KB |
Output is correct |
11 |
Correct |
94 ms |
4504 KB |
Output is correct |
12 |
Correct |
74 ms |
3884 KB |
Output is correct |
13 |
Correct |
122 ms |
5852 KB |
Output is correct |
14 |
Correct |
91 ms |
3904 KB |
Output is correct |
15 |
Correct |
64 ms |
3256 KB |
Output is correct |
16 |
Correct |
65 ms |
3244 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
59 ms |
3424 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |