4443: [Scoi2015]小凸玩矩阵
Time Limit: 10 Sec Memory Limit: 128 MBSubmit: 1281 Solved: 605
[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
1 5 6 6
8 3 4 3
6 8 6 3
Sample Output
3
HINT
1<=K<=N<=M<=250,1<=矩阵元素<=10^9
忘了第K大。。写第K小WA两发
连边(S,i,1),(i+n,T,1),对于格子(i,j)如果它的数<=x连边(i,j+n,1)
#include<cmath>
#include<ctime>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<string>
#include<bitset>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef double db;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch<='9'&&ch>='0'){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
return x*f;
}
void print(int x)
{if(x<0)putchar('-'),x=-x;if(x>=10)print(x/10);putchar(x%10+'0');}
const int N=560,inf=0X3f3f3f3f;
int ecnt,last[N<<1];
struct EDGE{int to,nt,val;}e[N*N*4];
inline void readd(int u,int v,int val)
{e[++ecnt]=(EDGE){v,last[u],val};last[u]=ecnt;}
inline void add(int u,int v,int val)
{readd(u,v,val);readd(v,u,0);}
int n,m;
int S=0,T=(N<<1)-1;
int q[N<<1],d[N<<1];
int a[N][N];
bool bfs()
{
memset(d,0,sizeof(d));
register int i,u,head=0,tail=1;
d[S]=1;q[head]=S;
while(head<tail)
{
u=q[head++];
for(i=last[u];i;i=e[i].nt)if(!d[e[i].to]&&e[i].val)
{d[e[i].to]=d[u]+1;q[tail++]=e[i].to;}
}
return d[T];
}
int dfs(int u,int lim)
{
if(u==T||!lim)return lim;
int res=0;
for(int i=last[u],tmp;i;i=e[i].nt)
if(e[i].val&&d[e[i].to]==d[u]+1)
{
tmp=dfs(e[i].to,min(e[i].val,lim));
e[i].val-=tmp;e[i^1].val+=tmp;lim-=tmp;res+=tmp;
if(!tmp)d[e[i].to]=0;if(!lim)break;
}
return res;
}
int mxflow=0;
int dinic()
{mxflow=0;while(bfs())mxflow+=dfs(S,inf);return mxflow;}
void build(int x)
{
register int i,j;
memset(last,0,sizeof(last));ecnt=1;
for(i=1;i<=n;++i)add(S,i,1);
for(i=1;i<=m;++i)add(i+n,T,1);
for(i=1;i<=n;++i)for(j=1;j<=m;++j)
if(a[i][j]<=x)add(i,j+n,1);
}
int main()
{
n=read(),m=read();int K=n-read()+1;
register int i,j;
for(i=1;i<=n;++i)for(j=1;j<=m;++j)a[i][j]=read();
register int l=1,r=int(1e9),mid;
while(l<r)
{
mid=(l+r)>>1;
build(mid);
dinic()>=K?r=mid:l=mid+1;
}
print(l);puts("");
return 0;
}
/*
3 4 2
1 5 6 6
8 3 4 3
6 8 6 3
3
*/