趁还是第一,赶紧截图
/*************************************************************************
> File Name: hdu5711.cpp
> Author: TechMonster
> Mail: 928221136@qq.com
> Created Time: 三 7/ 6 15:23:25 2016
************************************************************************/
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<ctype.h>
#include<string>
#include<math.h>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
template <class T1, class T2>inline void gmax(T1 &a, T2 b) { if (b>a)a = b; }
template <class T1, class T2>inline void gmin(T1 &a, T2 b) { if (b<a)a = b; }
#define ls (o<<1)
#define rs (o<<1|1)
#define MS(x,y) memset(x,y,sizeof(x))
#define MC(x, y) memcpy(x, y, sizeof(x))
typedef long long LL;
const int INF = 0x3f3f3f3f;
const int N = 50010;
int n,m,K,l;
int a[20],b[20],mp[20][20];
int dis[70000][17],que[900];
bool can[70000],vis[70000];
void Floyd()
{
for(int i = 0; i <= n; ++i) mp[i][i] = 0;
for(int i = 0; i <= n; ++i)
for(int j = 0; j <= n; ++j)
for(int k = j+1; k <= n; ++k)
{
gmin(mp[j][k],mp[j][i]+mp[i][k]);
mp[k][j] = mp[j][k];
}
}
bool cmp(int a,int b)
{
return a > b;
}
void solve()
{
MS(mp,0x3f);MS(dis,0x3f);MS(can,0);MS(vis,0);
int u,v,w;
scanf("%d%d%d%d",&n,&m,&K,&l);
for(int i = 1; i <= n; ++i) scanf("%d",&a[i]);
for(int i = 1; i <= n; ++i) scanf("%d",&b[i]);
for(int i = 0; i < m; ++i)
{
scanf("%d%d%d",&u,&v,&w);
gmin(mp[u][v],w);
mp[v][u] = mp[u][v];
}
Floyd();
int top = 1<<n,sta;
for(int i = 1; i <= n; ++i)
dis[1<<(i-1)][i] = mp[0][i];
for(int i = 1; i < top; ++i)
for(int j = 1; j <= n; ++j)
{
if(dis[i][j] > l) continue;
if(dis[i][j] + mp[j][0] <= l) can[i] = 1;
for(int k = 1; k <= n; ++k)
{
if(i & (1<<(k-1))) continue;
sta = i | (1<<(k-1));
gmin(dis[sta][k],dis[i][j] + mp[j][k]);
}
}
int cnt,tem,ans = 0;
for(int i = top-1; i > 0; --i)
{
if(!can[i]) continue;
if(vis[i])
{
for(int j = 1; j <= n; ++j)
{
if(!(i & (1<<(j-1)))) continue;
vis[i ^ (1<<(j-1))] = 1;
}
continue;
}
vis[i] = 1;
cnt = 0;
for(int j = 1; j <= n; ++j)
{
if(!(i & (1<<(j-1)))) continue;
vis[i ^ (1<<(j-1))] = 1;
tem = a[j];
for(int k = 0; k < K; ++k)
{
que[cnt++] = tem;
tem -= b[j];
if(tem <= 0) break;
}
}
sort(que,que+cnt,cmp);
int ret = 0;
for(int j = 0; j < min(K,cnt); ++j)
ret += que[j];
gmax(ans,ret);
}
printf("%d\n",ans);
}
int main()
{
int T,cas = 0;
scanf("%d",&T);
while(T--)
printf("Case %d: ",++cas) ,solve();
return 0;
}
/*
2
1 1 3 2
5
3
0 1 1
3 6 3 5
10 7 5
2 3 1
0 1 3
0 2 1
0 3 1
1 2 2
2 3 3
1 3 4
*/