最短路问题
更新最短路径的时候考虑最小花费
(注:博客作为交流使用,切勿抄袭应付作业)
#include<bits/stdc++.h>
using namespace std;
const int maxn = 500+7, INF = 0x7f7f7f7f;
int n, m, fir, en;
int u, v, l, h, cnt;
int head[maxn], d[maxn], d1[maxn], vis[maxn];
struct edge {
int u, l, h;
int next;
}e[2*maxn*maxn];
void init() {
scanf("%d %d %d %d", &n, &m, &fir, &en);
cnt = 0;
memset(head, -1, sizeof head);
for(int i = 0; i < m; ++i) {
scanf("%d %d %d %d", &u, &v, &l, &h);
e[cnt].u = v; e[cnt].l = l; e[cnt].h = h; e[cnt].next = head[u]; head[u] = cnt++;
e[cnt].u = u; e[cnt].l = l; e[cnt].h = h; e[cnt].next = head[v]; head[v] = cnt++;
}
}
void solve() {
memset(d, INF, sizeof d);
memset(d1, INF, sizeof d1);
memse