#include<bits/stdc++.h>
using namespace std;
#define int long long
#define tii tuple<int,int,int>
#define pii pair<int,int>
const int maxn = 1e5+5, INF=0x3f3f3f3f3f3f3f3f;
map<int,int> tot[maxn];
vector<tii> adj[maxn];
int dist[maxn];
void dijkstra(){
priority_queue<pii, vector<pii>, greater<pii>> pq;
for(int i=0; i<maxn; i++) dist[i]=INF;
pq.push({0,1});
dist[1]=0;
while(pq.size()){
auto[d,u] = pq.top(); pq.pop();
if(d>dist[u]) continue;
for(auto[b,c,p] : adj[u]){
if(dist[b]>dist[u]+p){
dist[b] = dist[u]+p, pq.push({dist[b], b});
}
}
}
}
int32_t main(){
int n, m; cin >> n >> m;
for(int i=0; i<m; i++){
int a,b,c,p; cin>>a>>b>>c>>p;
adj[a].push_back({b,c,p});
adj[b].push_back({a,c,p});
}
for(int i=1; i<=n; i++){
for(auto[b,c,p] : adj[i])
tot[i][c]+=p;
for(auto&[b,c,p] : adj[i])
p=min(p,tot[i][c]-p);
}
dijkstra();
cout << (dist[n]==INF ? -1:dist[n]) << '\n';
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
8028 KB |
Output is correct |
2 |
Correct |
2 ms |
8028 KB |
Output is correct |
3 |
Correct |
2 ms |
8028 KB |
Output is correct |
4 |
Correct |
2 ms |
8024 KB |
Output is correct |
5 |
Correct |
2 ms |
8284 KB |
Output is correct |
6 |
Correct |
2 ms |
8028 KB |
Output is correct |
7 |
Correct |
2 ms |
8360 KB |
Output is correct |
8 |
Correct |
2 ms |
8284 KB |
Output is correct |
9 |
Incorrect |
4 ms |
8540 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
74 ms |
18240 KB |
Output is correct |
2 |
Correct |
34 ms |
13016 KB |
Output is correct |
3 |
Correct |
111 ms |
20044 KB |
Output is correct |
4 |
Correct |
58 ms |
14876 KB |
Output is correct |
5 |
Incorrect |
256 ms |
36776 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
8028 KB |
Output is correct |
2 |
Correct |
2 ms |
8028 KB |
Output is correct |
3 |
Correct |
2 ms |
8028 KB |
Output is correct |
4 |
Correct |
2 ms |
8024 KB |
Output is correct |
5 |
Correct |
2 ms |
8284 KB |
Output is correct |
6 |
Correct |
2 ms |
8028 KB |
Output is correct |
7 |
Correct |
2 ms |
8360 KB |
Output is correct |
8 |
Correct |
2 ms |
8284 KB |
Output is correct |
9 |
Incorrect |
4 ms |
8540 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |