传送门http://www.lydsy.com/JudgeOnline/problem.php?id=4443
Solution
因为一定可以选出N个,所以只用考虑前N-k+1个的取值就好
选一个数等价于把其所在行和列匹配
二分一下取值,然后跑个匹配就好(二分图)
#include<stdio.h>
#include<cstring>
#include<algorithm>
#define cint const int &
#define co(a,b) f[gf(a)]=gf(b)
#define N 505
#define clr(a) memset(a,0,sizeof(a));
#define mid (L>>1)+(R>>1)+((L&1)+(R&1)>>1)
using namespace std;
int L=2033333333,R,s[N],V[N],tot,mat[N],ma[N],ne[N],Q[N],f[N],c[N>>1][N>>1],l,r,t,n,m,k;
struct edge{int v,n;}e[N*N];
inline void push(cint u,cint v)
{
e[++tot]=(edge){v,s[u]};s[u]=tot;
}
inline void prepare()
{
tot=t=0;
clr(mat);clr(s);
}
int gf(cint a){return f[a]==a?a:f[a]=gf(f[a]);}
inline int lca(int x,int y)
{
for (t++;;swap(x,y)) if (x)
{
x=gf(x);
if (V[x]==t) return x;
V[x]=t;
x=ne[mat[x]];
}
}
inline void g(int a,int p)
{
while (a!=p)
{
int b=mat[a],c=ne[b];
if (gf(c)!=p) ne[c]=b;
if (ma[b]==2) ma[Q[++r]=b]=1;
co(a,b);co(b,c);a=c;
}
}
inline void find(cint st,cint n)
{
for (int i=1;i<=n;i++) f[i]=i;
clr(ne);clr(ma);clr(V);
ma[st]=1;Q[1]=st;
for (l=r=1;l<=r;l++)
{
int u=Q[l];
for (int i=s[u];i;i=e[i].n)
{
int v=e[i].v;
if (mat[u]==v||gf(u)==gf(v)||ma[v]==2) continue;
if (ma[v]==1)
{
int tmp=lca(u,v);
if (gf(u)!=tmp) ne[u]=v;
if (gf(v)!=tmp) ne[v]=u;
g(u,tmp);g(v,tmp);
}
else if (!mat[v])
{
ne[v]=u;
for (int k=v,x,y;k;k=y) y=mat[x=ne[k]],mat[x]=k,mat[k]=x;
return;
}
else ne[v]=u,ma[v]=2,ma[Q[++r]=mat[v]]=1;
}
}
}
inline bool judge(cint p)
{
prepare();
for (int i=1;i<=n;i++) for (int j=1;j<=m;j++) if (c[i][j]<=p) push(i,n+j),push(n+j,i);
for (int i=1,st=0;i<=n+m;i++) if (!mat[i])
{
find(i,n+m);
if ((st+=mat[i]?1:0)==n-k+1) return 1;
}
return 0;
}
int main()
{
scanf("%d%d%d",&n,&m,&k);
for (int i=1;i<=n;i++) for (int j=1;j<=m;j++)
{
scanf("%d",c[i]+j);
L=min(L,c[i][j]);
R=max(R,c[i][j]);
}
while (L<R) if (judge(mid)) R=mid;
else L=mid+1;
printf("%d",L);
}