CSU 1116 Kingdoms

#include <bits/stdc++.h>

using namespace std;
int g[18][18], p[18];
const int N(1<<18);
int dp[N], co[N];
int T, n, m, k, u, v, c, ans;
inline int ones(int x){
	int res=0;
	for(int i=1; i<=n; i++){
		if(x&1<<i) res++;
	}
	return res;
}
inline void trans(int s, int i){
	for(int j=1; j<=n; j++){
		if(g[i][j]&&!(s&1<<j)&&co[s]+g[i][j]<=k){
			int t=s|1<<j;
			dp[t]=dp[s]+p[j];
			ans=max(ans, dp[t]);
			co[t]=co[t]?min(co[t], co[s]+g[i][j]):co[s]+g[i][j];
		}
	}
}
int main(){
	freopen("in", "r", stdin);
	for(cin>>T; T--;){
		cin>>n>>m>>k;
		for(int i=1; i<=n; i++) cin>>p[i];
		for(;m--;){
			cin>>u>>v>>c;
			if(!g[u][v]||g[u][v]>c) g[u][v]=g[v][u]=c;
		}
		dp[1<<1]=ans=p[1], co[1<<1]=0;
		for(int i=1; i<n; i++){ //iterate over ones
			for(int j=1<<1, tot=1<<n+1; j<tot; j++){	//iterate over state
				if(ones(j)==i&&dp[j]){
					for(int k=1; k<=n; k++){	//iterate over bits
						if(j&1<<k){
							trans(j, k);
						}
					}
				}
			}

		}
		printf("%d\n", ans);
		memset(dp, 0, sizeof(dp));
		memset(co, 0, sizeof(co));
		memset(g, 0, sizeof(g));
	}
}