The 17-th Beihang University Collegiate Programming Contest (BCPC 2022) - Preliminary J（二分图最小权完备匹配）

• 很显然的费用流模型 但是n的范围400 n2m的dinic费用流显然不行
• 我们根据题意需要完备匹配可以连边 a[i][j] = max(0ll, p[i] - b[j]) + max(0ll, q[j] - a1[i])
• 所以我们跑KM 最小权匹配 复杂度 n3
• 这里采用的是dls的板子（
• 就当存个板子了（

#include <bits/stdc++.h>
/*#include <iostream>
#include <climits>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
#include <bitset>
*/
using namespace  std;
//#define  int long long
using ll = long long;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fi first
#define se second
#define pb  push_back
#define inf 1ll<<62
#define db double
#define endl "\n"
//#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define de_bug(x) cerr << #x << "=" << x << endl
#define all(a) a.begin(),a.end()
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--)
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
template<class T>
pair<T, vector<int>> hungarian(const vector<vector<T>> &a) {
	if (a.empty()) return {0, {}};
	int n = a.size() + 1, m = a[0].size() + 1;
	vector<T> u(n), v(m); // 顶标
	vector<int> p(m), ans(n - 1);
	for (int i = 1; i < n; i++) {
		p[0] = i;
		int j0 = 0;
		vector<T> dist(m, numeric_limits<T>::max());
		vector<int> pre(m, -1);
		vector<bool> done(m + 1);
		do { // dijkstra
			done[j0] = true;
			int i0 = p[j0], j1;
			T delta = numeric_limits<T>::max();
			for (int j = 1; j < m; j++) if (!done[j]) {
					auto cur = a[i0 - 1][j - 1] - u[i0] - v[j];
					if (cur < dist[j]) dist[j] = cur, pre[j] = j0;
					if (dist[j] < delta) delta = dist[j], j1 = j;
				}
			for (int j = 0; j < m; j++) {
				if (done[j]) u[p[j]] += delta, v[j] -= delta;
				else dist[j] -= delta;
			}
			j0 = j1;
		} while (p[j0]);
		while (j0) { // update alternating path
			int j1 = pre[j0];
			p[j0] = p[j1], j0 = j1;
		}
	}
	for (int j = 1; j < m; j++) {
		if (p[j]) ans[p[j] - 1] = j - 1;
	}
	return { -v[0], ans}; // min cost
}
ll a1[N];
ll p[N];
ll b[N];
int n;
ll q[N];
void solve() {
	cin >> n;
	fer(i, 0, n - 1)cin >> a1[i];
	fer(i, 0, n - 1)cin >> p[i];
	fer(i, 0, n - 1)cin >> b[i];
	fer(i, 0, n - 1)cin >> q[i];
	auto a = vector<vector<ll>>(n, vector<ll>(n, 0));
	fer(i, 0, n - 1)
	fer(j, 0, n - 1) {
		a[i][j] = max(0ll, p[i] - b[j]) + max(0ll, q[j] - a1[i]);
	}
	pair<ll, vector<int>>tmp = hungarian(a);
	cout << tmp.first;
}
int  main() {
	IOS;
	int _ = 1;
	//cin>>_;
	while( _-- )
		solve();
	return 0;
}
/*
5
3 10 2 1 5
9 7 2 10 1
1 6 10 8 0
9 4 4 1 8
15
*/