http://poj.org/problem?id=2446 #include<iostream> #include<string> #include<cmath> #include<cstdio> #include<cstdlib> #include<cstring> #include<algorithm> using namespace std; const int MAXN=1050; int link[MAXN]; int total; bool vist[33][33]; //用来标记那些位置有洞 bool usedif[MAXN]; bool mat[MAXN][MAXN]; bool Can(int t) { int i; for(i=0;i<total;i++) if(mat[t][i]&&!usedif[i]) { usedif[i]=true; if(link[i]==-1||Can(link[i])) { link[i]=t; return true; } } return false; } int maxMatch() { int i,num=0; memset(link,-1,sizeof(link)); for(i=0;i<total;i++) { memset(usedif,0,sizeof(usedif)); if(Can(i)) num++; } return num; } int main() { int i,j,x,y,u,t,r,c,num,ans; while(scanf("%d%d%d",&r,&c,&t)!=EOF) { memset(vist,0,sizeof(vist)); for(i=0;i<t;i++) { scanf("%d%d",&y,&x); vist[x-1][y-1]=true; } total=r*c; num=total-t; if(num&1) //需要覆盖的格子数是奇数,那么不会存在可行方案 { printf("NOn"); continue; } memset(mat,0,sizeof(mat)); for(i=0;i<r;i++) for(j=0;j<c;j++) if(!vist[i][j]) { u=i*c+j; if((i-1)>=0&&!vist[i-1][j]) mat[u][(i-1)*c+j]=true; if((i+1)<r&&!vist[i+1][j]) mat[u][(i+1)*c+j]=true; if((j-1)>=0&&!vist[i][j-1]) mat[u][i*c+(j-1)]=true; if((j+1)<c&&!vist[i][j+1]) mat[u][i*c+(j+1)]=true; } ans=maxMatch(); if(ans==num) printf("YESn"); else printf("NOn"); } return 0; }
Meta
-
Recent Posts
Recent Comments
- MorrissUnime on 隆宪叁年-五一
- bngvhmxrsj on 隆宪叁年-五一
- bngvjbansj on 隆宪叁年-五一
- bngvgffiij on 隆宪叁年-五一
- MorrissUnime on 隆宪叁年-五一
Archives
- May 2024
- April 2023
- February 2023
- January 2023
- December 2022
- November 2022
- September 2022
- June 2022
- July 2021
- January 2021
- February 2020
- September 2019
- March 2018
- February 2018
- August 2016
- July 2016
- June 2016
- May 2016
- April 2016
- March 2016
- February 2016
- January 2016
- December 2015
- November 2015
- October 2015
- September 2015
- August 2015
- July 2015
- June 2015
- May 2015
- April 2015
- March 2015
- February 2015
- January 2015
- December 2014
- November 2014
- October 2014
- September 2014
- August 2014
- July 2014
- June 2014
- May 2014
- April 2014
- March 2014
- February 2014
- January 2014
- December 2013
- November 2013
- October 2013
- September 2013
- August 2013
- July 2013
- June 2013
- May 2013
- April 2013
- March 2013
- February 2013
- January 2013
- December 2012
- November 2012
- October 2012
- September 2012
- August 2012
- July 2012
- June 2012
- May 2012
- April 2012
- March 2012
- February 2012
- January 2012
- December 2011
- November 2011
- October 2011
- September 2011
- August 2011
- July 2011
- June 2011
- May 2011
- April 2011
- March 2011
- February 2011
- January 2011
- December 2010
- November 2010
- October 2010
- September 2010
- August 2010
- July 2010
- June 2010
- May 2010
- April 2010
- March 2010
- February 2010
- January 2010
- December 2009
- November 2009
- October 2009
- September 2009
- August 2009
- July 2009
- June 2009
- May 2009
- April 2009
- March 2009
- February 2009
Categories