二分图匹配 Hopcroft-Carp (HK) 算法 加强版 匈牙利

#include<iostream>
#include<cstring> 
#include<queue>

using namespace std;

const int N = 3e3 + 100,M = N * N;

int n,m;

int head[N],to[M],last[M],cnt;
void add(int a,int b){
	to[++cnt] = b;
	last[cnt] = head[a];
	head[a] = cnt;
}

int dx[N],dy[N],mx[N],my[N],dis;
bool bfs(){
	dis = 0x3f3f3f3f;
	memset(dx,-1,sizeof dx);
	memset(dy,-1,sizeof dy);
	queue<int>q;
	for(int i = 1; i <= n; i++){
		if(mx[i] == -1){
			q.push(i);
			dx[i] = 0;
		}
	}
	
	while(q.size()){
		int p = q.front();
		q.pop();
		if(dx[p] > dis) break;
		for(int i = head[p]; i != -1; i = last[i]){
			int j = to[i];
			if(dy[j] == -1){
				dy[j] = dx[p] + 1;
				if(my[j] == -1) dis = dy[j]; // 
				else{
					dx[my[j]] = dy[j] + 1; // 寻找下一个点的增广路 
					q.push(my[j]);
				} 
			}
		}
	}
	return dis != 0x3f3f3f3f;
}

int flag[N];
bool find(int x){
	for(int i = head[x]; i != -1; i = last[i]){
		int j = to[i];
		if(flag[j]) continue;
		flag[j] = 1;
		if(my[j] != -1 && dy[j] == dis) continue;
		if(my[j] == -1 || find(my[j])){
			my[j] = x;
			mx[x] = j;
			return true;
		}
	}
	return false;
} 


int hk(){
	int sum = 0;
	while(bfs()){
		for(int i = 1; i <= n; i++){
			memset(flag,0,sizeof flag);
			if(mx[i] == -1){
				if(find(i)) sum++;
			}
		}
	}
	return sum;
}

int x[N],y[N],z[N],a[N],b[N];
int main(){
	int t;
	cin >> t;
	int cas = 0;
	while(t--){
		memset(head,-1,sizeof head);
		memset(mx,-1,sizeof mx);
		memset(my,-1,sizeof my);
		cnt = 0;
		int timee;
		scanf("%d",&timee);
		scanf("%d",&n);
		for(int i = 1; i <= n; i++){
			scanf("%d%d%d",&x[i],&y[i],&z[i]);
		}
		
		scanf("%d",&m);
		for(int i = 1; i <= m; i++){
			scanf("%d%d",&a[i],&b[i]);
		}
		
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= m; j++){
				int s1 = (x[i] - a[j]) * (x[i] - a[j]) + (y[i] - b[j]) * (y[i] - b[j]);
				if(s1 <= timee * z[i] * timee * z[i]) add(i,j);
			}
		}
		
		printf("Scenario #%d:\n",++cas);
		printf("%d\n\n",hk());
	}
	

	return 0;
}