• <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"。這題類似于三維的迷宮問題,對于每個狀態(tài),可以有8種不同的操作,每增加一個操作,對應(yīng)于多用了一塊管道。有所不同的是:每個狀態(tài)除了它的坐標(biāo)(x,y,z)外,還多了一個方向向量V∈{+x,+y,+z,-x,-y,-z}。將這個因素也考慮到狀態(tài)判重里,然后用dfs或者bfs都可解決。還有一個需要注意的是,在進(jìn)行第一步操作的時候,要根據(jù)入口的方向V,對3個坐標(biāo)x,y,z其中的一個進(jìn)行+1或者-1操作,由向量V決定。至于為什么,仔細(xì)觀察下圖就明白了。

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

            <2009年7月>
            2829301234
            567891011
            12131415161718
            19202122232425
            2627282930311
            2345678

            導(dǎo)航

            統(tǒng)計

            常用鏈接

            留言簿(10)

            隨筆分類

            隨筆檔案

            友情鏈接

            搜索

            最新評論

            閱讀排行榜

            評論排行榜

            久久国内免费视频| 99久久99久久精品国产片| 欧美午夜A∨大片久久| 国产精品久久久久久久久软件| 久久99热这里只频精品6| 无码日韩人妻精品久久蜜桃| 久久亚洲精品中文字幕三区| 久久影视国产亚洲| 国产精品99久久99久久久| 久久九九久精品国产免费直播| 久久久久亚洲精品日久生情| 国产午夜福利精品久久2021| 久久免费99精品国产自在现线 | Xx性欧美肥妇精品久久久久久| 国产精品亚洲综合专区片高清久久久| 99久久精品国产一区二区| 久久夜色精品国产噜噜亚洲a| 精品一区二区久久久久久久网站| 怡红院日本一道日本久久| 久久精品国产色蜜蜜麻豆| 国产99久久九九精品无码| 久久亚洲精品中文字幕| 午夜精品久久久久久久无码| 久久精品国产一区二区三区不卡 | 伊人色综合久久| 精品无码久久久久国产| 国产精品美女久久福利网站| 久久国产成人午夜AV影院| 国产精品对白刺激久久久| 亚洲精品乱码久久久久久蜜桃不卡| 久久久噜噜噜久久| 开心久久婷婷综合中文字幕| 国产成人香蕉久久久久| 99国内精品久久久久久久| 久久免费国产精品一区二区| 国产精品天天影视久久综合网| 九九精品99久久久香蕉| 久久精品国产一区二区三区日韩| 成人久久综合网| 99久久国产热无码精品免费久久久久 | 久久99精品国产麻豆宅宅|