BZOJ4443

来源：互联网发布：mac音频播放器编辑：程序博客网时间：2024/06/05 10:48

裸裸的二分图匹配结果我上来先给排了序无限WA

#include<cstdio>#include<cstring>#include<cstdlib>#include<cmath>#include<algorithm>#include<iostream>#define maxn 250using namespace std;struct node{int w;int x,y;}q[100010];int b[maxn][maxn];int lk[maxn];int a[maxn][maxn];bool vis[maxn];int n,m,num,k,tot;bool find(int x){for (int i=1;i<=m;i++)  if (a[x][i] && !vis[i])  {  vis[i]=1;  if (!lk[i] || find(lk[i]))  {  lk[i]=x;  return 1;  }  }return 0;}bool check(int x){memset(lk,0,sizeof(lk));memset(a,0,sizeof(a));for (int i=1;i<=tot;i++) if (q[i].x!=q[x].x && q[i].y!=q[x].y && q[i].w<=q[x].w) a[q[i].x][q[i].y]=1;int ans=0;for (int i=1;i<=n;i++){memset(vis,0,sizeof(vis));if (find(i)) ans++;}if (ans>=n-k) return 1; else return 0;}bool cmp(node x,node y){return x.w<y.w;}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",&a[i][j]);    q[++tot].w=a[i][j];q[tot].x=i;q[tot].y=j;  }sort(q+1,q+tot+1,cmp);int l=1,r=tot,ans=0;while (l<=r){int mid=(l+r)/2;if (check(mid)) ans=mid,r=mid-1; else l=mid+1;}printf("%d\n",q[ans].w);return 0;}

阅读全文

1 0