bzoj1003： [ZJOI2006]物流运输

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
#define rep(i,s,t) for(int i=s;i<=t;i++)
#define dwn(i,s,t) for(int i=s;i>=t;i--)
#define clr(x,c) memset(x,c,sizeof(x))
#define qwq(x) for(edge *o=head[x];o;o=o->next)
int read(){
	int x=0,f=1;char c=getchar();
	while(!isdigit(c)) {
		if(c==‘-‘) f=-1;c=getchar();
	}
	while(isdigit(c)) x=x*10+c-‘0‘,c=getchar();
	return x;
} 
const int nmax=105;
const int maxn=10005;
const int inf=0x7f7f7f7f;
struct edge{
	int to,dist;edge *next;
};
edge es[maxn],*pt=es,*head[nmax];
int dis[nmax],dp[nmax],n,m,K,e,P;bool vis[nmax][nmax],on[nmax];
void add(int u,int v,int d){
	pt->to=v;pt->dist=d;pt->next=head[u];head[u]=pt++;
	pt->to=u;pt->dist=d;pt->next=head[v];head[v]=pt++;
}
struct node{
	int x,dist;
	node(int x,int dist):x(x),dist(dist){};
	node(){};
	bool operator<(const node&rhs)const{
	  return dist>rhs.dist;}
};
priority_queue<node>q;
int get(int s,int t){
	clr(on,1);
	rep(i,1,m) rep(j,s,t) if(!vis[i][j]) on[i]=0;
	clr(dis,0x7f);dis[1]=0;q.push(node(1,0));
	node oo;int tx,td;
	while(!q.empty()){
		oo=q.top();q.pop();
		tx=oo.x;td=oo.dist;
		if(dis[tx]!=td) continue;
		qwq(tx) if(on[o->to]&&dis[o->to]>td+o->dist){
			dis[o->to]=td+o->dist;
			q.push(node(o->to,dis[o->to]));
		}
	}
	if(dis[m]==inf) return inf;
	else return dis[m]*(t-s+1);
}
void mins(int &a,int b){
	if(a>b) a=b;
}
int main(){
	n=read(),m=read(),K=read(),e=read();int u,v,d;
	rep(i,1,e) u=read(),v=read(),d=read(),add(u,v,d);
	P=read();clr(vis,1);
	rep(i,1,P) {
		u=read(),v=read(),d=read();
		rep(j,v,d) vis[u][j]=0;
	}
	rep(i,1,n) {
		dp[i]=get(1,i);
		rep(j,2,i) mins(dp[i],dp[j-1]+get(j,i)+K);
	}
	printf("%d\n",dp[n]);
	return 0;
}