content/graph/matching.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

constexpr int MOD=1'000'000'007, I=10;
vector<vector<ll>> adj, mat;

int max_matching() {
	int ans = 0;
	mat.assign(ssize(adj), {});
	for (int _ = 0; _ < I; _++) {
		for (int v = 0; v < ssize(adj); v++) {
			mat[v].assign(ssize(adj), 0);
			for (int u : adj[v]) {
				if (u < v) {
					mat[v][u] = rand() % (MOD - 1) + 1;
					mat[u][v] = MOD - mat[v][u];
		}}}
		gauss(ssize(adj), MOD); //LGS @\sourceref{math/lgsFp.cpp}@
		int rank = 0;
		for (auto& row : mat) {
			if (*ranges::max_element(row) != 0) rank++;
		}
		ans = max(ans, rank / 2);
	}
	return ans;
}