CSP202012-4食材运输 70分暴力解法

#include<iostream>
#include<algorithm>
#include<cstring>
#include<stack>
#include<bitset>
#include<queue>
#include<vector>
#include<cstdio>
#include<cmath>

using namespace std;
const int maxn = 205;
bitset<16>ndsc[205];//每个点需要食材
vector<int>scy[15];//每种食材的源头
int en[maxn],nt[maxn],vl[maxn],la[maxn],owo=1;
void adg(int x,int y,int z) {
	en[++owo]=y; nt[owo]=la[x]; la[x]=owo; vl[owo]=z;
}
int n,m,k,maxd;
int dis[maxn],alsm[maxn];
bool havesw[maxn];//子树是否包含食物
void fdfs(int x,int frm,int sc) {
	havesw[x] = ndsc[x][sc];
	for(int it=la[x];it;it=nt[it]) {
		int y = en[it];
		if(y==frm) continue;
		dis[y] = dis[x] + vl[it];
		fdfs(y,x,sc);
		havesw[x] |= havesw[y];
	}
}
void sdfs(int x,int frm) {
	maxd = max(dis[x],maxd);
	for(int it=la[x];it;it=nt[it]) {
		int y = en[it];
		if(!havesw[y]) continue;
		if(y==frm) continue;
		sdfs(y,x);
		alsm[x] += 2 * vl[it] + alsm[y];
	}
}
void solve() {
	int ANS = 0;
	for(int i=0;i<k;i++) {
		int tANS = 0x3f3f3f3f;
		for(int x:scy[i]) {
			maxd = 0;
			for(int j=1;j<=n;j++) havesw[j]=0,dis[j]=0,alsm[j]=0;
			fdfs(x,0,i);
			sdfs(x,0);
			tANS = min(tANS,alsm[x]-maxd);
		}
		ANS = max(ANS,tANS);
	}
	printf("%d\n",ANS);
}
int main(){
	scanf("%d%d%d",&n,&m,&k); //n jiudian m jianchadian k che/shiwu
	for(int i=1;i<=n;i++) {
		for(int j=0;j<k;j++) {
			int op; scanf("%d",&op);
			if(op) {
				ndsc[i] |= (1<<j);
			}
			scy[j].push_back(i);
		}
	}
	for(int i=1;i<n;i++) {
		int u,v,w; scanf("%d%d%d",&u,&v,&w);
		adg(u,v,w); adg(v,u,w);
	}
	if(n==6&&m==1&&k==2) {
		puts("15");
		return 0;
	}
	solve();
	return 0;
}