• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            Problem A : Air Conditioning Machinery

            You are a technician for the Air Conditioning Machinery company (ACM). Unfortunately, when you arrive at a customer site to install some air conditioning ducts, you discover that you are running low on supplies. You have only six duct segments, and they are all of the same kind, called an “elbow.”

            You must install a duct in a confined space: a rectangular prism whose sides are multiples of a unit length. Think of the confined space as consisting of an array of unit cubes. Each elbow occupies exactly four unit cubes, as shown in Figure 1 below. A unit cube can be occupied by at most one elbow. Each elbow has exactly two openings, as indicated by the gray squares in the elbow shown in Figure 1. You may assemble the elbows into longer ducts, but your duct must be completely contained inside the given space. One way to connect two elbows is shown in Figure 2. Your task is to connect an inflow to an outflow. The inflow and the outflow are located on the exterior surface of the confined space, aligned with the unit cubes, as shown in Figure 3. To keep expenses down, you must accomplish this task while using the minimum number of elbows.
            Input
            The input consists of several test cases, each of which consists of a single line containing eleven input values separated by blanks. The input values for each test case are as follows.

            The first three input values are integers (xBmaxB, yBmaxB, and zBmaxB) that indicate the size of the confined space in the x, y, and z dimensions, respectively. Each unit cube in the confined space can be identified by coordinates (x, y, z) where 1 ≤ x ≤ xBmaxB, 1 ≤ y ≤ yBmaxB, and 1 ≤ z ≤ zBmaxB. xBmaxB, yBmaxB, and zBmaxB are all positive and not greater than 20.

            The next three input values are integers that indicate the location of the inflow by identifying the x, y, and z coordinates of the unit cube that connects to the inflow.

            The next input value is a two-character string that indicates the direction of the inward flow, using one of the following codes: +x, -x, +y, -y, +z, -z. The inflow connection is on the face of the unit cube that receives this inward flow. For example, if the data specifies an inflow direction of +y, the inflow connection is on the face of the unit cube that faces in the negative y direction. The next three input values are integers that indicate the location of the outflow by identifying the x, y, and z coordinates of the unit cube that connects to the outflow.

            The last input value is a two-character string that indicates the direction of the outward flow, using the same codes described above. The outflow connection is on the face of the unit cube that generates this outward flow. For example, if the data specifies an outflow direction of +y, the outflow connection is on the face of the unit cube that faces in the positive y direction.

            The last line of the input file consists of a single zero to indicate end of input.

            Output
            For each test case, print the case number (starting with 1) followed by the minimum number of elbows that are required to connect the inflow to the outflow without going outside the confined space. If the task cannot be accomplished with your supply of six elbow segments, print the word TImpossibleT instead. Use the format in the sample data.

            Sample Input
            5 4 3 3 1 1 +z 5 4 3 +x
            5 4 3 3 1 1 +z 1 2 3 -x
            0

            Output for the Sample Input
            Case 1: 2
            Case 2: Impossible 

                題意很簡單:用不超過6塊上述形狀的管道(暫且稱為管道吧),問最少需要幾塊能將出口和入口連通。如果不能,輸出"Impossible"。這題類似于三維的迷宮問題,對于每個狀態,可以有8種不同的操作,每增加一個操作,對應于多用了一塊管道。有所不同的是:每個狀態除了它的坐標(x,y,z)外,還多了一個方向向量V∈{+x,+y,+z,-x,-y,-z}。將這個因素也考慮到狀態判重里,然后用dfs或者bfs都可解決。還有一個需要注意的是,在進行第一步操作的時候,要根據入口的方向V,對3個坐標x,y,z其中的一個進行+1或者-1操作,由向量V決定。至于為什么,仔細觀察下圖就明白了。

            posted on 2009-04-23 18:14 極限定律 閱讀(959) 評論(0)  編輯 收藏 引用 所屬分類: ACM-ICPC World Final 2008題解

            <2009年5月>
            262728293012
            3456789
            10111213141516
            17181920212223
            24252627282930
            31123456

            導航

            統計

            常用鏈接

            留言簿(10)

            隨筆分類

            隨筆檔案

            友情鏈接

            搜索

            最新評論

            閱讀排行榜

            評論排行榜

            亚洲va久久久噜噜噜久久天堂 | 伊人久久亚洲综合影院| 亚洲欧洲中文日韩久久AV乱码| 国产成人精品综合久久久| 久久久亚洲欧洲日产国码是AV| 国内精品久久久久影院日本| 久久久久无码精品| 日本一区精品久久久久影院| 无码专区久久综合久中文字幕| 久久精品夜夜夜夜夜久久| 伊人久久大香线蕉综合热线| 天天久久狠狠色综合| 香蕉久久影院| 久久亚洲精品无码播放| 久久本道久久综合伊人| 蜜桃麻豆www久久| 日批日出水久久亚洲精品tv| 久久久精品2019免费观看| 久久精品无码av| MM131亚洲国产美女久久| 国产精品久久久香蕉| 欧美日韩精品久久久免费观看| 久久99精品国产| 日韩欧美亚洲综合久久影院d3| 久久人做人爽一区二区三区 | 欧美亚洲另类久久综合婷婷| 国产亚洲欧美精品久久久| 久久久精品国产| 日本加勒比久久精品| 精品久久综合1区2区3区激情| 国产亚洲欧美精品久久久| 九九久久自然熟的香蕉图片| 久久国产精品无| 久久影院亚洲一区| 久久精品国产72国产精福利| 国产精品无码久久综合网| 久久―日本道色综合久久| 久久99国产精品久久久| 久久精品国产亚洲一区二区| 国产精品久久久久久久久| 久久午夜无码鲁丝片午夜精品|