状压求条，过不了最后一个大样例

#include<bits/stdc++.h>
using namespace std;
int n,m,k;
long long c[11];
long long a[11][10001];
long long ans;
struct node
{
	int u,v;
	long long w;
	bool operator<(const node &x) const
	{
		return w<x.w;
	}
	bool operator>(const node &x) const
	{
		return w>x.w;
	}
};
struct nnode
{
	long long x;
	priority_queue<node,vector<node>,greater<node> > q;
}dp[(1<<11)];
bool vis[(1<<11)]; 
int fa[10011];
int find(int x)
{
	if(x==fa[x]) return x;
	fa[x]=find(fa[x]);
	return fa[x];
}
bool add(int x,int y)
{
	int xx=find(x);
	int yy=find(y);
	if(xx==yy) return 0;
	if(xx>yy) swap(xx,yy);
	fa[yy]=xx;
	return 1;
}
long long kur(priority_queue<node,vector<node>,greater<node> > &ret)
{
	priority_queue<node,vector<node>,greater<node> > q=ret;
	priority_queue<node,vector<node>,greater<node> >().swap(ret);
	for(int i=1;i<=n+k;i++) fa[i]=i;
	long long ans=0;
	while(!q.empty())
	{
		node X=q.top(); q.pop();
		int u=X.u;
		int v=X.v;
		long long w=X.w;
		if(add(u,v))
		{
			ans+=w;
			ret.push(X);
		}
	}
	return ans;
}
signed main()
{
	freopen("road.in","r",stdin);
	freopen("road.out","w",stdout);
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin>>n>>m>>k;
	for(int i=1;i<=m;i++)
	{
		int u,v;
		long long w; cin>>u>>v>>w;
		dp[0].q.push({u,v,w});
	}
	dp[0].x=kur(dp[0].q);
	vis[0]=1;
	ans=dp[0].x;
	for(int i=1;i<=k;i++)
	{
		cin>>c[i];
		for(int j=1;j<=n;j++) cin>>a[i][j];
	}
	for(int i=0;i<(1<<k)-1;i++)
	{
		for(int j=1;j<=k;j++)
		{
			if(ans<c[j]) continue;
			if((i|(1<<(j-1)))!=i) 
			{
				int nxt=(i|(1<<(j-1)));
				priority_queue<node,vector<node>,greater<node> > q=dp[i].q;
				for(int r=1;r<=n;r++) q.push({n+j,r,1ll*a[j][r]});
				long long f=1ll*kur(q);
				if(f<dp[nxt].x||vis[nxt]==0)
				{
					dp[nxt].x=1ll*f;
					dp[nxt].q=q;
					vis[nxt]=1;
					if(vis[nxt]) ans=min(1ll*ans,1ll*dp[nxt].x+c[j]);
				}
			}
		}
	}
	cout<<1ll*ans;
	return 0;
}