#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
using namespace std;
int n,m,k,E,d,cnt,dis[21],head[21];
bool block[21],inq[21],flag[101][21];
long long t[101][101],f[101];
struct edge{
int next,to,w;
}e[801];
void insert(int u,int v,int w){
e[++cnt]=(edge){head[u],v,w};
head[u]=cnt;
}
int spfa(int a,int b){
queue<int> q;int now,i;
memset(block,0,sizeof(block));
memset(dis,127/3,sizeof(dis));
memset(inq,0,sizeof(inq));
for(int i=a;i<=b;i++)
for(int j=1;j<=m;j++)
if(flag[i][j])block[j]=1;
q.push(1);inq[1]=1;dis[1]=0;
while(!q.empty()){
now=q.front();q.pop();i=head[now];
while(i){
if(!block[e[i].to]&&dis[e[i].to]>dis[now]+e[i].w){
dis[e[i].to]=dis[now]+e[i].w;
if(!inq[e[i].to]){q.push(e[i].to);inq[e[i].to]=1;}
}
i=e[i].next;
}
inq[now]=0;
}
return dis[m];
}
long long Min(long long a,long long b){
if(a<b)return a;else return b;
}
inline int read(){
int x=0;char ch=getchar();
while(ch<'0'||ch>'9')ch=getchar();
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x;
}
int main(){
n=read();m=read();k=read();E=read();
for(int i=1;i<=E;i++){
int a=read(),b=read(),c=read();
insert(a,b,c);insert(b,a,c);
}
d=read();
for(int i=1;i<=d;i++){
int P=read(),a=read(),b=read();
for(int j=a;j<=b;j++)
flag[j][P]=1;
}
for(int i=1;i<=n;i++)
for(int j=i;j<=n;j++)
t[i][j]=spfa(i,j);
for(int i=1;i<=n;i++){
f[i]=t[1][i]*i;
for(int j=0;j<i;j++)
f[i]=Min(f[i],f[j]+k+t[j+1][i]*(i-j));
}
printf("%lld",f[n]);
return 0;
}
[Bzoj1003][ZJOI2006]物流运输trans
最新推荐文章于 2018-03-24 05:10:52 发布