[bzoj4443][SCOI2015]小凸玩矩阵 最大流+二分

4443: [Scoi2015]小凸玩矩阵

Time Limit: 10 Sec   Memory Limit: 128 MB
Submit: 919   Solved: 461
[ Submit][ Status][ Discuss]

Description

小凸和小方是好朋友，小方给小凸一个N*M（N<=M)的矩阵A,要求小秃从其中选出N个数，其中任意两个数字不能在同一行或同一列，现小凸想知道选出来的N个数中第K大的数字的最小值是多少。

Input

第一行给出三个整数N,M,K

接下来N行，每行M个数字，用来描述这个矩阵

Output

如题 

Sample Input

3 4 2
1 5 6 6
8 3 4 3
6 8 6 3

Sample Output

3

HINT

1<=K<=N<=M<=250,1<=矩阵元素<=10^9

Source

行列连边，后来wa了，结果竟然是邻接表打错了，看了10分钟不想说我了

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#define INF 0x7fffffff
using namespace std;
const int N = 500 + 5;
int n,m,k,a[N][N],last[N],cnt=1,h[N],cur[N],S,T,maxn = 0,q[N];
struct Edge{
	int to,v,next;
}e[N*N*2];
void insert( int u, int v, int w ){
	e[++cnt].to = v; e[cnt].v = w; e[cnt].next = last[u]; last[u] = cnt;
	e[++cnt].to = u; e[cnt].v = 0; e[cnt].next = last[v]; last[v] = cnt;
}
bool bfs(){
	memset(h,-1,sizeof(h));
	int head = 0, tail = 1;
	q[0] = h[0] = 0;
	while( head != tail ){
		int now = q[head++];
		for( int i = last[now]; i; i = e[i].next )
			if( e[i].v && h[e[i].to] == -1 ){
				h[e[i].to] = h[now] + 1;
				q[tail++] = e[i].to;
			}
	} 
	return h[T] != -1;
}
int dfs( int x, int f ){
	if( x == T ) return f;
	int w,used = 0;
	for( int i = cur[x]; i; i = e[i].next )
		if( h[e[i].to] == h[x] + 1 ){
			w = dfs( e[i].to, min(f-used,e[i].v) );
			e[i].v -= w; e[i^1].v += w; used += w;
			if( e[i].v ) cur[x] = i; if( used == f ) return f;
		}
	if( !used ) h[x] = -1;
	return used;
}
int dinic(){
	int ans = 0;
	while(bfs()){
		for( int i = S; i <= T; i++ ) cur[i] = last[i];
		ans += dfs(S,INF);
	}
	return ans;
}
bool find( int x ){
	memset(last,0,sizeof(last)); cnt = 1;
	for( int i = 1; i <= n; i++ ) insert( S, i, 1 );
	for( int i = 1; i <= m; i++ ) insert( i+n, T, 1 );
	for( int i = 1; i <= n; i++ )
		for( int j = 1; j <= m; j++ )
			if( a[i][j] <= x ) insert( i, j+n, 1 );
	int mxflow = dinic();
	if( mxflow >= n-k+1 ) return 1;
	else return 0;
}
int main(){
	scanf("%d%d%d", &n, &m, &k);
	S = 0; T = n+m+1;
	for( int i = 1; i <= n; i++ )
		for( int j = 1; j <= m; j++ )
			scanf("%d", &a[i][j]), maxn = max(maxn,a[i][j]);
	int lf = 0, rt = maxn;
	while( lf < rt ){
		int mid = (lf+rt)>>1;
		if(find(mid)) rt = mid;
		else lf = mid+1;
	}
	printf("%d", lf);
	return 0;
}