代码

#include <cstdio>
#include <cctype>
#include <cstring>
#include <algorithm>
#define il inline
#define rgi register int
#define sp putchar(' ')
#define el putchar('\n')
using namespace std;
il int ri() {
    register int o1 = 0;
    register bool o2 = 0;
    register char o3;
    while (!isdigit(o3 = getchar())) o2 |= o3 == '-';
    while (isdigit(o3)) o1 = (o1 << 1) + (o1 << 3) + (o3 ^ 48), o3 = getchar();
    return o2 ? -o1 : o1;
}
il void wi(int o1) {
    if (o1 < 0)
        putchar('-'), o1 = -o1;
    rgi o2 = o1 / 10;
    if (o2)
        wi(o2);
    putchar((o1 - (o2 << 1) - (o2 << 3)) ^ 48);
}
const int maxn = 1e5 + 5;
const int maxm = 2e5 + 5;
const int maxt = 1e3 + 5;
const int inf = 0x3f3f3f3f;
int n, m, a, b, c, t, f[maxn][maxt], ans = inf;
struct edge {
    int u, v, p, q;
} e[maxm];
il int calc(int x) { return a * x * x + b * x + c; }
il bool cmp(edge o1, edge o2) { return o1.p <= o2.p; }
signed main() {
    //freopen("route.in", "r", stdin);
    //freopen("route.out", "w", stdout);
    n = ri(), m = ri(), a = ri(), b = ri(), c = ri();
    for (rgi i = 1; i <= m; ++i) {
        e[i].u = ri(), e[i].v = ri(), e[i].p = ri(), e[i].q = ri();
        t = max(t, e[i].q);
    }
    memset(f, 0x3f, sizeof(f));
    f[1][0] = 0;
    sort(e + 1, e + m + 1, cmp);
    for (rgi i = 1; i <= m; ++i)
        for (rgi j = 0; j <= e[i].p; ++j) {
            if (f[e[i].u][j] == inf)  //没车
                continue;
            f[e[i].v][e[i].q] = min(f[e[i].v][e[i].q], f[e[i].u][j] + calc(e[i].p - j));
        }
    for (rgi i = 0; i <= t; ++i) ans = min(ans, f[n][i] + i);
    wi(ans);
    return 0;
}

评测结果