ZOJ 1516 Uncle Tom's Inherited Land (二分图匹配)
来源:互联网 发布:语音广告制作软件 编辑:程序博客网 时间:2024/05/21 14:03
题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1516
Your old uncle Tom inherited a piece of land from his great-great-uncle. Originally, the property had been in the shape of a rectangle. A long time ago, however, his great-great-uncle decided to divide the land into a grid of small squares. He turned some of the squares into ponds, for he loved to hunt ducks and wanted to attract them to his property. (You cannot be sure, for you have not been to the place, but he may have made so many ponds that the land may now consist of several disconnected islands.)
Your uncle Tom wants to sell the inherited land, but local rules now regulate property sales. Your uncle has been informed that, at his great-great-uncle's request, a law has been passed which establishes that property can only be sold in rectangular lots the size of two squares of your uncle's property. Furthermore, ponds are not salable property.
Your uncle asked your help to determine the largest number of properties he could sell (the remaining squares will become recreational parks).
Input will include several test cases. The first line of a test case contains two integers N and M, representing, respectively, the number of rows and columns of the land (1 <= N, M <= 100). The second line will contain an integer K indicating the number of squares that have been turned into ponds ( (N x M) - K <= 50). Each of the next K lines contains two integers X and Y describing the position of a square which was turned into a pond (1 <= X <= N and 1 <= Y <= M). The end of input is indicated by N = M = 0.
<b< dd="">
For each test case in the input your program should produce one line of output, containing an integer value representing the maximum number of properties which can be sold.
<b< dd="">
4 4
6
1 1
1 4
2 2
4 1
4 2
4 4
4 3
4
4 2
3 2
2 2
3 1
0 0
<b< dd="">
4
3
题意:n*m的土地上,求有多少1*2 或者 2*1 的块数 ,池塘不能算在内.
思路:每一个不是池塘的土地,都可以跟他的上下左右四个方向上不是池塘的块构成一个1*2或者2*1的长方形块,把所有连通的块存起来,构成一个二部图,剩下的就是求最大匹配.
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;#define MAXN 110int g[MAXN][MAXN];int mp[MAXN][MAXN];int node[MAXN][MAXN];int cx[MAXN],cy[MAXN];int sx[MAXN],sy[MAXN];int vis[MAXN];int n,m,num,ans;int dir[4][2]= {0,1,1,0,0,-1,-1,0};void bulid(){ int i,j,k; num=1; for(i=1; i<=n; i++) for(j=1; j<=m; j++) { if(!mp[i][j]) node[i][j]=num++; } for(i=1; i<=n; i++) for(j=1; j<=m; j++) { if(!mp[i][j]) { for(k=0; k<4; k++) { int tx=i+dir[k][0]; int ty=j+dir[k][1]; if(tx>=1&&tx<=n&&ty>=1&&ty<=m&&mp[tx][ty]==0) { g[node[i][j]][node[tx][ty]]=1; g[node[tx][ty]][node[i][j]]=1; } } } }}int path(int u){ sx[u]=1; int v; for(v=1; v<=num; v++) { if(g[u][v]&&!sy[v]) { sy[v]=1; if(!cy[v]||path(cy[v])) { cx[u]=v; cy[v]=u; return 1; } } } return 0;}int MaxMatch(){ int i; ans=0; memset(cx,0,sizeof(cx)); memset(cy,0,sizeof(cy)); for(i=1; i<=num; i++) { if(!cx[i]) { memset(sx,0,sizeof(sx)); memset(sy,0,sizeof(sy)); ans+=path(i); } } return 0;}int main(){ int i,j,k,u,v; while(~scanf("%d%d",&n,&m)&&n+m) { memset(mp,0,sizeof(mp)); memset(g,0,sizeof(g)); memset(node,0,sizeof(node)); scanf("%d",&k); for(i=0; i<k; i++) { scanf("%d%d",&u,&v); mp[u][v]=1; } bulid(); MaxMatch(); printf("%d\n",ans/2); } return 0;}
- ZOJ 1516 Uncle Tom's Inherited Land (二分图匹配)
- ZOJ 1516 Uncle Tom's Inherited Land(二分匹配 最大匹配 匈牙利啊)
- ZOJ 1516--Uncle Tom's Inherited Land【二分图 && 求最大匹配数 && 经典建图】
- 【二分图|最大匹配】ZOJ-1516 Uncle Tom's Inherited Land
- ZOJ 1516 Uncle Tom's Inherited Land (二分图最大匹配)
- hdu_1507 Uncle Tom's Inherited Land* 二分图匹配
- HDU-1507 Uncle Tom's Inherited Land* 二分图匹配
- hdu 1507 Uncle Tom's Inherited Land* (二分匹配)
- Uncle Tom's Inherited Land*(二分匹配)
- hdu 1507 Uncle Tom's Inherited Land* (二分匹配)
- ZOJ 1516 Uncle Tom's Inherited Land
- zoj 1516 Uncle Tom's Inherited Land
- zoj 1516 Uncle Tom's Inherited Land(二分匹配·链式前向星)
- hdu 1507 Uncle Tom's Inherited Land*(二分图)
- 杭电 hdu 1507 Uncle Tom's Inherited Land*(二分图,最大匹配)
- HDU 1507 Uncle Tom's Inherited Land* 二分图最大匹配(基础题)
- 杭电HDU ACM Uncle Tom's Inherited Land*(二分图匹配 建模)
- HDOJ 1507 Uncle Tom's Inherited Land*(二分图匹配+构图)
- HDU-4614:Vases and Flowers(线段树+二分)
- [LeetCode] 38. Count and Say
- python requests解析
- 【Shiro】--- 简介
- POJ 2955 Brackets 区间DP
- ZOJ 1516 Uncle Tom's Inherited Land (二分图匹配)
- 【转载】机器学习计算距离和相似度的方法
- 剑指offer--按之字形顺序打印二叉树
- 引用数据类型---数组
- R
- 生信脚本练习(8)合并文件 ①
- Vue.js 模版语法
- UVA
- SHA256withRSA签名验签(JAVA实现,RSA密钥对)