zoukankan      html  css  js  c++  java
  • 2015 多校联赛 ——HDU5301(技巧)

    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(1n,m108,n×m>1,1xn,1ym).
     
    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.
     
    Author
    XJZX
     
    Source


    题意:

    n*m矩阵,黑格子的位置是(x,y),将剩下位置划分为多个矩阵,每个矩阵必须接触边缘,求出划分矩阵的最大最小面积。

    题解:先换成 N<M的矩形,ans = (min(n,m) + 1)/2;

    1. min(left,right)> ans

    Answer = min(max(up,down),min(left,right));

    2.为奇数正方形,且x,y 在正中央时,answer = ans-1;

    3.否则,ans





    #include <iostream>
    #include <cstring>
    #include <cstdio>
    #include <vector>
    #include <map>
    #include <algorithm>
    #define MAX 0x3f3f3f3f
    using namespace std;
    typedef long long ll;
    ll n,m,x,y;
    
    int main()
    {
        while(~scanf("%I64d%I64d%I64d%I64d",&n,&m,&x,&y))
        {
            if(n < m)
            {
                swap(n,m);
                swap(x,y);
            }
    
            if(n == m && n%2 && x == (n+1)/2 && y == (m+1)/2)
            {
                printf("%d
    ", m/2);
                continue;
            }
    
            int maxn = (m +1)/2;
    
            if(x == 1 || x == n || y == maxn || y == maxn + 1 )
                printf("%d
    ",maxn);
            else
            {
                int ans = max(y-1,m-y);
                int temp = min(x,n-x+1);
                if(temp < maxn)
                    printf("%d
    ",maxn);
                else
                    printf("%d
    ",min(ans,temp));
            }
    
        }
        return 0;
    }
    

      

  • 相关阅读:
    SAP 标准成本滚算小记
    记一次SAP新业务开发项目
    让人头疼的关键用户
    SAP GUI个性化设置
    惊心动魄的SAP S4客户额度调整运动
    最新.net和Java调用SAP RFC中间件下载
    那些年我遇到的ERP顾问
    【SAP业务模式】之STO(二):系统配置
    SAP S4系统创建Customer和Vendor的BAPI
    【SAP S/4 1511之变】:主数据之变
  • 原文地址:https://www.cnblogs.com/Przz/p/5409825.html
Copyright © 2011-2022 走看看