首先二分答案,转化为判定性问题:
是否存在一种选法,使得第
K
大的数字
看到「其中任意两个数字不能在同一行或同一列」这一条件,想到二分图匹配。
而第
K
大的数字
因此,对于任意一对
1≤i≤N
且
1≤j≤M
,如果矩阵的
(i,j)
位置上的数小于等于
mid
,就在二分图第一个点集的第
i
个点向第二个点集的第
代码:
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
inline int read() {
int res = 0; bool bo = 0; char c;
while (((c = getchar()) < '0' || c > '9') && c != '-');
if (c == '-') bo = 1; else res = c - 48;
while ((c = getchar()) >= '0' && c <= '9')
res = (res << 3) + (res << 1) + (c - 48);
return bo ? ~res + 1 : res;
}
const int N = 255, M = 2e5 + 5;
int n, m, K, ecnt, nxt[M], adj[M], go[M], my[M], times, vis[M], a[N][N];
void add_edge(int u, int v) {
nxt[++ecnt] = adj[u]; adj[u] = ecnt; go[ecnt] = v;
}
bool dfs(int u) {
for (int e = adj[u], v; e; e = nxt[e])
if (vis[v = go[e]] < times) {
vis[v] = times;
if (!my[v] || dfs(my[v]))
return my[v] = u, 1;
}
return 0;
}
int solve() {
int i, res = 0; for (i = 1; i <= max(n, m); i++) {
times++; if (dfs(i)) res++;
}
return res;
}
bool check(int mid) {
int i, j; ecnt = 0; for (i = 1; i <= max(n, m); i++) adj[i] = my[i] = 0;
for (i = 1; i <= n; i++) for (j = 1; j <= m; j++)
if (a[i][j] <= mid) add_edge(i, j);
return solve() >= n - K + 1;
}
int orz() {
int l = 1, r = 1e9;
while (l <= r) {
int mid = l + r >> 1;
if (check(mid)) r = mid - 1;
else l = mid + 1;
}
return l;
}
int main() {
int i, j; n = read(); m = read(); K = read();
for (i = 1; i <= n; i++) for (j = 1; j <= m; j++) a[i][j] = read();
cout << orz() << endl;
return 0;
}