zoukankan      html  css  js  c++  java
  • HDU

    Buildings
    Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
    Total Submission(s): 387 Accepted Submission(s): 81

    Problem 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.

    To prevent darkness indoors, the apartments must have windows. Therefore, each apartment must share its at least one side with the edge of the rectangle representing the floor so it is possible to place a window.

    Your boss XXY wants to minimize the maximum areas of all apartments, now it’s your turn to tell him the answer.

    Input
    There are at most 10000 testcases.
    For each testcase, only four space-separated integers, n,m,x,y(1≤n,m≤108,n×m>1,1≤x≤n,1≤y≤m).

    Output
    For each testcase, print only one interger, representing the answer.

    Sample Input

    2 3 2 2
    3 3 1 1

    Sample Output

    1
    2

    Hint

    Case 1 :

    You can split the floor into five 1×1 apartments. The answer is 1.

    Case 2:

    You can split the floor into three 2×1 apartments and two 1×1 apartments. The answer is 2.

    If you want to split the floor into eight 1×1 apartments, it will be unacceptable because the apartment located on (2,2) can’t have windows.

    #include <cstdio>
    #include <algorithm>
    using namespace std;
    
    int main() {
        int n, m, x, y;
        while (scanf("%d%d%d%d", &n, &m, &x, &y) != EOF) {
            if (n == m && x == y && n % 2 == 1 && n / 2 + 1 == x) {
                printf("%d
    ", n / 2);
                continue; 
            }
            int tx = min(x, n - x + 1);
                tx = max(tx, min((m + 1) / 2, n - tx));
    
            int ty = min(y, m - y + 1);
                ty = max(ty, min((n + 1) / 2, m - ty)); 
            int t = min(tx, ty);
            printf("%d
    ", t);
        }
        return 0;
    }
  • 相关阅读:
    .NET性能调优之三:YSlow相关规则的调优工具和方法
    .NET性能调优之二:使用Visual Studio进行代码度量
    OSPF的常见前7类LSA详解
    Packet Tracer 5.3搭建DNS服务器
    中型网络中网络冗余设计的要领
    GNS3模拟器如何保存配置文件
    CCNA相当综合的实验1
    GNS模拟器中支持的模块说明
    典型配置:H3C基于AP限制接入客户端数量
    破解H3C交换机密码的方法
  • 原文地址:https://www.cnblogs.com/wzjhoutai/p/7266585.html
Copyright © 2011-2022 走看看