rt，求调悬关。

提交记录

代码：

#include <bits/stdc++.h>
#define fin(str) freopen(str,"r",stdin)
#define fout(str) freopen(str,"w",stdout)
#define ll long long
using namespace std;
const int maxn=1505;
const int maxm=6e3+5;
const int inf=0x3f3f3f3f;
struct edge{
	int to,w,next;
};
struct graph{
	edge e[maxm<<1];
	int n,tot=1,h[maxn];
	inline graph(){
		tot=1;
		memset(h,0,sizeof(h));
	}
	inline void addEdge(int x,int y,int z){
		e[++tot]=(edge){y,z,h[x]};
		h[x]=tot;
	}
	inline void link(int x,int y,int z) {addEdge(x,y,z),addEdge(y,x,0); }
	inline void link2(int x,int y,int z) {addEdge(x,y,z),addEdge(y,x,z); }
	int d[maxn],cur[maxn],inq[maxn];
	queue <int> q;
	inline bool bfs(int s,int t){
		memset(d,-1,sizeof(d));
		q.push(s),d[s]=0,inq[s]=true;
		while (!q.empty()){
			int x=q.front();
			q.pop();
			cur[x]=h[x];
			inq[x]=false;
			for (int i=h[x];i;i=e[i].next){
				int v=e[i].to;
				if (e[i].w && d[v]==-1){
					d[v]=d[x]+1;
					if (!inq[v]){
						inq[v]=true;
						q.push(v);
					}
				}
			}
		}
		return d[t]!=-1;
	}
	inline int dinic(int x,int t,int flow){
		if (x==t) return flow;
		int rest=flow;
		for (int i=cur[x];i&&rest;i=e[i].next){
			int v=e[i].to;
			cur[x]=i;
			if (e[i].w && d[v]==d[x]+1){
				int nw=dinic(v,t,min(e[i].w,rest));
				if (!nw) d[v]=-1;
				e[i].w-=nw,e[i^1].w+=nw;
				rest-=nw;
			}
		}
		return flow-rest;
	}
	inline int min_cut(int s,int t){
		int ans=0;
		while (bfs(s,t)) ans+=dinic(s,t,inf);
		return ans;
	}
	vector <int> vec;
	int vis[maxn];
	inline void dfs(int x){
		vis[x]=true;
		vec.push_back(x);
		for (int i=h[x];i;i=e[i].next){
			int v=e[i].to;
			if (!vis[v] && (e[i^1].w && e[i].w)) dfs(v);
		}
	}
	inline vector <int> check(int s){
		memset(vis,false,sizeof(vis));
		vec.clear();
		dfs(s);
		return vec;
	}
}ans,g;
int n,m,q;
int u[maxm],v[maxm],w[maxm];
vector <int> vec,Xnxt,Ynxt;
mt19937 rnd(time(0));
inline void solve(vector <int> vec){
	if (vec.size()<=1) return ;
	int x=rnd()%vec.size(),y=rnd()%(vec.size()-1);
	if (y>=x) y++;
	x=vec[x],y=vec[y];
	g.tot=1,memset(g.h,0,sizeof(g.h));
	for (int i=1;i<=m;i++) g.link2(u[i],v[i],w[i]);
	int res=g.min_cut(x,y);
	ans.link2(x,y,res);
	g.check(x);
	Xnxt.clear(),Ynxt.clear();
	for (int i=0;i<vec.size();i++){
		if (g.vis[vec[i]]) Xnxt.push_back(vec[i]);
		else Ynxt.push_back(vec[i]);
	}
	solve(Xnxt);
	solve(Ynxt);
}
const int maxlog=21;
int tim,fa[maxn],siz[maxn],dep[maxn],son[maxn],top[maxn],id[maxn],val[maxn];
int st[maxn][maxlog];
inline void dfs1(int x,int f,int d){
	fa[x]=f;
	dep[x]=d;
	siz[x]=1;
	int maxx=-1;
	for (int i=ans.h[x];i;i=ans.e[i].next){
		int v=ans.e[i].to;
		if (v==f) continue;
		val[v]=ans.e[i].w;
		dfs1(v,x,d+1);
		siz[x]+=siz[v];
		if (siz[v]>maxx){
			maxx=siz[v];
			son[x]=v;
		}
	}
}
inline void dfs2(int x,int topf){
	id[x]=++tim;
	top[x]=topf;
	if (son[x]) dfs2(son[x],topf);
	for (int i=ans.h[x];i;i=ans.e[i].next){
		int v=ans.e[i].to;
		if (v==fa[x] || v==son[x]) continue;
		dfs2(v,v);
	}
}
inline void build(){
	for (int i=1;i<=n;i++) st[id[i]][0]=val[i];
	for (int j=1;(1<<j)<=n;j++){
		for (int i=1;i+(1<<j)-1<=n;i++){
			st[i][j]=min(st[i][j-1],st[i+(1<<(j-1))][j-1]);
		}
	}
}
inline int queryst(int l,int r){
	if (l>r) return inf;
	int p=log2(r-l+1);
	return min(st[l][p],st[r-(1<<p)+1][p]);
}
inline int query(int x,int y){
	int res=inf;
	while (top[x]!=top[y]){
		if (dep[top[x]]<dep[top[y]]) swap(x,y);
		res=min(res,queryst(id[top[x]],id[x]));
		x=fa[top[x]];
	}
	if (dep[x]<dep[y]) swap(x,y);
	res=min(res,queryst(id[y]+1,id[x]));
	return res;
}
int T;
inline void solve(){
	memset(son,0,sizeof(son));
	ans.tot=1,memset(ans.h,0,sizeof(ans.h)),tim=0;
	scanf("%d%d",&n,&m),vec.clear();
	for (int i=1;i<=m;i++) scanf("%d%d%d",&u[i],&v[i],&w[i]);
	for (int i=1;i<=n;i++) vec.push_back(i);
	solve(vec);
//	printf("qwq\n");
	dfs1(1,0,1);
	dfs2(1,1);
	build();
	scanf("%d",&q);
	for (int i=1,x;i<=q;i++){
		scanf("%d",&x);
		int res=0;
		for (int j=1;j<=n;j++){
			for (int k=j+1;k<=n;k++){
				if (query(j,k)<=x) res++;
			}
		}
		printf("%d\n",res);
	}
	printf("\n");
}
int main(){
	scanf("%d",&T);
	while (T--) solve();
	return 0;
}