代码

/*
Author: QAQ Automaton
Lang: C++
Prog: route.cpp
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include<bits/stdc++.h>
#define int long long
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define Debug debug("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define all(x) x.begin(),x.end()
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define inf 0x3f3f3f3f3f3f3f3f3f3f3f3f3f3f3f3f
const double eps=1e-8;
const double pi=acos(-1.0);
template<class T>int chkmin(T &a,T b){return a>b?a=b,1:0;}
template<class T>int chkmax(T &a,T b){return a<b?a=b,1:0;}
template<class T>T sqr(T a){return a*a;}
template<class T>T mmin(T a,T b){return a<b?a:b;} template<class T>T mmax(T a,T b){return a>b?a:b;}
template<class T>T aabs(T a){return a<0?-a:a;}
template<class T>int dcmp(T a,T b){return a>b;}
template<int *a>int cmp_a(int x,int y){return a[x]<a[y];}
#define min mmin
#define max mmax
#define abs aabs
namespace io {
	const int SIZE = (1 << 21) + 1;
	char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int f, qr;
	// getchar
	#define gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *iS ++)
	// print the remaining part
	inline void flush () {
		fwrite (obuf, 1, oS - obuf, stdout);
		oS = obuf;
	}
	// putchar
	inline void putc (char x) {
		*oS ++ = x;
		if (oS == oT) flush ();
	}
	// input a signed integer
	inline bool read (signed &x) {
		for (f = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f = -1;else if(c==EOF)return 0;
		for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= f;
		return 1;
	}

	inline bool read (long long &x) {
		for (f = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f = -1;else if(c==EOF)return 0;
		for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= f;
		return 1;
	}
	inline bool read (char &x) {
		x=gc();
		return x!=EOF;
	}
	inline bool read(char *x){
		while((*x=gc())=='\n' || *x==' '||*x=='\r')if(*x==EOF)return 0;
		while(!(*x=='\n'||*x==' '||*x=='\r'))*(++x)=gc();
		*x=0;
		return 1;
	}
	template<typename A,typename ...B>
	inline bool read(A &x,B &...y){
		return read(x)&&read(y...);
	}
	// print a signed integer
	inline bool write (signed x) {
		if (!x) putc ('0'); if (x < 0) putc ('-'), x = -x;
		while (x) qu[++ qr] = x % 10 + '0',  x /= 10;
		while (qr) putc (qu[qr --]);
		return 0;
	}

	inline bool write (long long x) {
		if (!x) putc ('0'); if (x < 0) putc ('-'), x = -x;
		while (x) qu[++ qr] = x % 10 + '0',  x /= 10;
		while (qr) putc (qu[qr --]);
		return 0;
	}
	inline bool write (char x) {
		putc(x);
		return 0;
	}
	inline bool write(const char *x){
		while(*x){putc(*x);++x;}
		return 0;
	}
	inline bool write(char *x){
		while(*x){putc(*x);++x;}
		return 0;
	}
	template<typename A,typename ...B>
	inline bool write(A x,B ...y){
		return write(x)||write(y...);
	}
	//no need to call flush at the end manually!
	struct Flusher_ {~Flusher_(){flush();}}io_flusher_;
}
using io :: read;
using io :: putc;
using io :: write;
int x[200005],y[200005],p[200005],q[200005];
int f[200005],ans;
vector<pii> st[1005],ed[1005];
struct DP{
	deque<pii> q;
	void insert(pii a){
		while(q.size()>1 && (a.y-q[0].y)*(a.x-q[1].x)<=(a.y-q[1].y)*(a.x-q[0].x))q.pop_front();
		q.push_front(a);
	}
	int query(int w){
		int t=q.size();
		while(t>1 && (q[t-2].y-q[t-1].y)<=(q[t-2].x-q[t-1].x)*w){--t;q.pop_back();}
		if(q.size()){
			return q.back().x*w-q.back().y;
		}
		else return -inf;

	}
};
DP dp[100005];
signed main(){
        int n,m,a,b,c;
	read(n,m,a,b,c);
	ed[0].push_back(make_pair(1,0));
	for(int i=1;i<=m;++i){
		read(x[i],y[i],p[i],q[i]);
		st[p[i]].push_back(make_pair(x[i],i));
		ed[q[i]].push_back(make_pair(y[i],i));
	}
	ans=inf;
	for(int i=0;i<=1000;++i){
		for(auto j:ed[i])if(f[j.y]<(ll)inf){
			
			dp[j.x].insert(make_pair(i,a*i*i+f[j.y]-b*i));
//			write(j.x,"pushed",i,' ',a*i*i+f[j.y]-b*i,'\n');
			if(j.x==n){
//				write(i,' ',j.x,' ',' ',j.y,' ',f[j.y],'\n');
				chkmin(ans,f[j.y]+i);
			}
		}
		for(auto j:st[i]){
			f[j.y]=a*i*i+b*i+c-dp[j.x].query(2*a*i);
//			write(x[j.x],' ',y[j.x],' ',j.y,' ',f[j.y],'\n');
		}
	}
	write(ans,'\n');
	return 0;
}

评测结果