2015 多校赛 第二场 1002 (hdu 5301)

Description

Your current task is to make a ground plan for a residential building located in HZXJHS. So you must determine a way to split the floor building with walls to make apartments in the shape of a rectangle. Each built wall must be paralled to the building's sides.

The floor is represented in the ground plan as a large rectangle with dimensions n×m, where each apartment is a smaller rectangle with dimensions a×b located inside. For each apartment, its dimensions can be different from each other. The number a and b must be integers.

Additionally, the apartments must completely cover the floor without one 1×1 square located on (x,y). The apartments must not intersect, but they can touch.

For this example, this is a sample of n=2,m=3,x=2,y=2.

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int n,m,x,y,ans;
int main(){
//freopen("in.txt","r",stdin);
while(~scanf("%d%d%d%d", &n, &m, &x, &y)){
if(n>m) swap(n,m),swap(x,y);//统一处理
ans=(n+1)/2;//短边的一半
int t1=max(x-1,n-x),t2=min(y,m-y+1);
if(ans<t2&&x-1!=n-x) ans=min(t1,t2);
//如果x-1!=n-x，则t1>=ans，且此时若ans<t2，则说明纵向放置欠缺部分无法以横向放置替代
//因此，换成t1，则可以补足纵向放置欠缺，换成t2，则可以以横向放置替代纵向，取较小者
if(n==m&&x==y&&(x*2-1==n)) ans=(n-1)/2;
//如果在正中间，需特殊判定。
printf("%d\n",ans);
}
return 0;
}

View Code