没啥特别的,就是KM的模板
#include <bits/stdc++.h>
using namespace std;
const int maxn=3e2+10;
const int INF = 0x3f3f3f3f;
#define faster ios::sync_with_stdio(false);cin.tie(0),cout.tie(0)
int link[maxn][maxn],usex[maxn],usey[maxn],ptn[maxn],exx[maxn],exy[maxn],sl[maxn];
int n;
bool find(int x){
usex[x]=1;
for (int i = 1; i <= n; ++i<