#include <iostream>
#include <vector>
#include <queue>
using namespace std;
#define int long long
const int INF=1e18;
void dijkstra(int a,vector<vector<pair<int,int>>>& g,vector<int>& dist){
for(int i=0;i<dist.size();i++)dist[i]=INF;
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});
}
}
}
}
void build(int n,int l,int r,vector<int>& t,vector<int>& li){
if(l==r)t[n]=li[l];
else{
int mid=(r+l)/2;
build(n<<1,l,mid,t,li);
build((n<<1)+1,mid+1,r,t,li);
t[n]=min(INF,t[n<<1]+t[(n<<1)+1]);
}
//cout<<l<<' '<<r<<' '<<t[n]<<'\n';
}
int val(int n,int l,int r,vector<int>& t,int a,int b){
if(a>b)return INF;
if(l>b||r<a)return 0;
if(l>=a&&r<=b)return t[n];
int mid=(r+l)/2;
int vall=val(n<<1,l,mid,t,a,b);
int valr=val((n<<1)+1,mid+1,r,t,a,b);
//cout<<vall<<' '<<valr<<'\n';
return min(INF,vall+valr);
}
signed main(){
int n,m,o,k,x,y,w;
cin>>k>>n>>m>>o;
if(k==1){
vector<long long> dist(n,INF),t(n*4);
dist[n-1]=0;
while(m--){
cin>>x>>y>>w;
dist[x]=min(dist[x],w);
}
build(1,0,n-1,t,dist);
while(o--){
cin>>x>>y;
int ans=val(1,0,n-1,t,x,y-1);
if(x==y)cout<<0<<'\n';
else if(ans==INF)cout<<-1<<'\n';
else cout<<ans<<'\n';
}
}else{
vector<vector<pair<int,int>>> g(n,vector<pair<int,int>>());
vector<long long> dist(n,INF);
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:8: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]
8 | for(int i=0;i<dist.size();i++)dist[i]=INF;
| ~^~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
56 ms |
2260 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
296 KB |
Output is correct |
5 |
Correct |
3 ms |
340 KB |
Output is correct |
6 |
Correct |
3 ms |
308 KB |
Output is correct |
7 |
Correct |
3 ms |
356 KB |
Output is correct |
8 |
Correct |
59 ms |
2604 KB |
Output is correct |
9 |
Correct |
62 ms |
2636 KB |
Output is correct |
10 |
Correct |
23 ms |
2404 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
94 ms |
4424 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 |
20 ms |
356 KB |
Output is correct |
8 |
Correct |
19 ms |
416 KB |
Output is correct |
9 |
Correct |
59 ms |
2380 KB |
Output is correct |
10 |
Correct |
127 ms |
5728 KB |
Output is correct |
11 |
Correct |
95 ms |
4552 KB |
Output is correct |
12 |
Correct |
78 ms |
3912 KB |
Output is correct |
13 |
Correct |
142 ms |
5864 KB |
Output is correct |
14 |
Correct |
90 ms |
3908 KB |
Output is correct |
15 |
Correct |
65 ms |
3268 KB |
Output is correct |
16 |
Correct |
63 ms |
3276 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
56 ms |
2260 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
296 KB |
Output is correct |
5 |
Correct |
3 ms |
340 KB |
Output is correct |
6 |
Correct |
3 ms |
308 KB |
Output is correct |
7 |
Correct |
3 ms |
356 KB |
Output is correct |
8 |
Correct |
59 ms |
2604 KB |
Output is correct |
9 |
Correct |
62 ms |
2636 KB |
Output is correct |
10 |
Correct |
23 ms |
2404 KB |
Output is correct |
11 |
Correct |
94 ms |
4424 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
0 ms |
212 KB |
Output is correct |
14 |
Correct |
0 ms |
212 KB |
Output is correct |
15 |
Correct |
0 ms |
212 KB |
Output is correct |
16 |
Correct |
0 ms |
212 KB |
Output is correct |
17 |
Correct |
20 ms |
356 KB |
Output is correct |
18 |
Correct |
19 ms |
416 KB |
Output is correct |
19 |
Correct |
59 ms |
2380 KB |
Output is correct |
20 |
Correct |
127 ms |
5728 KB |
Output is correct |
21 |
Correct |
95 ms |
4552 KB |
Output is correct |
22 |
Correct |
78 ms |
3912 KB |
Output is correct |
23 |
Correct |
142 ms |
5864 KB |
Output is correct |
24 |
Correct |
90 ms |
3908 KB |
Output is correct |
25 |
Correct |
65 ms |
3268 KB |
Output is correct |
26 |
Correct |
63 ms |
3276 KB |
Output is correct |
27 |
Correct |
0 ms |
212 KB |
Output is correct |
28 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
29 |
Halted |
0 ms |
0 KB |
- |