#include <iostream>
#include <vector>
#include <string.h>
using namespace std;
const int SIZE = 1005;
bool visited[SIZE]; //女生是否被搜寻过
int match[SIZE]; //女生是否被匹配过
vector<int> boys[SIZE];
vector<int> girls[SIZE];
int arrayboy[SIZE];
int arraygirl[SIZE];
int result = 0;
int T, N;
//匈牙利算法
bool findPath(int x)
{
for (int i = 0; i < boys[x].size(); i++)
{
int girlNum = boys[x][i];
if (!visited[girlNum])
{
visited[girlNum] = true;
if (!match[girlNum] || findPath(match[girlNum])) //没有匹配或者能搜寻出增广路径
{
match[girlNum] = x;
return true;
}
}
}
return false;
}
int main()
{
std::ios::sync_with_stdio(false);
cin >> T;
while (T--)
{
cin >> N;
for (int i = 0; i < SIZE; i++)
{
boys[i].clear();
girls[i].clear();
}
for (int i = 1; i <= N; i++)
cin >> arrayboy[i];
for (int i = 1; i <= N; i++)
{
cin >> arraygirl[i];
for (int j = 1; j <= N; j++)
{
if (arraygirl[i] * arrayboy[j] < 0)
{
if (arrayboy[j] < 0 && -arrayboy[j] > arraygirl[i])
{
girls[i].push_back(j);
boys[j].push_back(i);
}
else if (arraygirl[i] < 0 && -arraygirl[i] > arrayboy[j])
{
girls[i].push_back(j);
boys[j].push_back(i);
}
}
}
}
result = 0;
memset(match, 0, sizeof(match));
for (int i = 1; i <= N; i++)
{
memset(visited, false, sizeof(visited));
if (findPath(i))
result++;
}
cout << result << endl;
}
return 0;
}
算法思路:对每个定点集A的每个顶点搜寻增广路径。增广路径就是一条未匹配边与已匹配边交替出现的出现且以未匹配边开始,未匹配边结束(未匹配边数 = 匹配边数+1)的路径。则对每一条增广路径,将不匹配边变成匹配边,不匹配边变成匹配边,还是符合匹配条件,而且匹配数是原来加一。因而每找到一条增广路径,匹配数加一。
对应例题:sicily 4313