#include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
using namespace std;
int n,m;
struct dataa{
int ne,c,p;
};
vector<dataa>v[100005];
typedef pair<ll,int> pp;
ll d[100005],sum[200005];
int met[200005],tb;
void iswn(){
cin >> n >> m;
for(int i = 1;i <= m;i++){
int x,y,ci,pi;cin >> x >> y >> ci >> pi;
v[x].push_back({y,ci,pi});
v[y].push_back({x,ci,pi});
}
for(int i = 1;i <= n;i++)d[i] = 1e17;
d[1] = 0;
priority_queue<pp,vector<pp>,greater<pp>>pq;
pq.push({0,1});
while(pq.size() != 0){
ll dx = pq.top().f;
int x = pq.top().s;
pq.pop();
if(dx != d[x])continue;
tb++;
int sc = 0;
for(int i = 0;i < v[x].size();i++){
int ci = v[x][i].c;
ll pi = v[x][i].p;
if(met[ci] != tb){
sc++;
met[ci] = tb;
sum[ci] = 0;
}
sum[ci] += pi;
}
ll midel1 = 1e17;
if(sc != m)midel1 = 0;
else{
for(int i = 0;i < v[x].size();i++){
int ci = v[x][i].c;
midel1 = min(midel1,sum[ci]);
}
}
for(int i = 0;i < v[x].size();i++){
int ci = v[x][i].c;
ll pi = v[x][i].p;
ll val = sum[ci]-pi;
val = min(val,midel1+pi);
int u = v[x][i].ne;
if(d[u] > dx+val){
d[u] = dx+val;
pq.push({d[u],u});
}
}
}
if(d[n] == 1e17)cout << -1;
else cout << d[n];
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
if(fopen("ROBOT1.INP","r")){
freopen("ROBOT1.INP","r",stdin);
freopen("ROBOT1.OUT","w",stdout);
}
int ts = 1;//cin >> ts;
while(ts--)iswn();
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
Main.cpp: In function 'int main()':
Main.cpp:68:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
68 | freopen("ROBOT1.INP","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:69:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
69 | freopen("ROBOT1.OUT","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |