• <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>

            ArcTan

            dfs
            隨筆 - 16, 文章 - 117, 評論 - 6, 引用 - 0
            數據加載中……

            SRM549 DIVⅡ 250pt (概率想法題)

            Problem Statement

                 A magician has invited you to play a game. For this game, the magician uses a special table. On the table there are three spots in a row. The spots are labeled 0, 1, and 2, in order. He places three hats onto the table, so that each hat covers one of the spots. He then takes a ball and places it under one of the hats. The hats are not transparent, so you cannot see the ball while it is under a hat. Next, the magician shuffles the hats by repeatedly swapping two adjacent hats. Each swap is done by sliding the hats along the table, never showing you the ball. Once the magician finishes swapping the hats, you have to guess the spot where the ball is.

            You are given a string hats which describes the contents of the hats in the beginning of the game. The i-th character of hats is 'o' if the ball was initially on the spot i. Otherwise, the i-th character of hats is '.' (a period).

            You are also given a int numSwaps. Assume that the magician swapped the hat that contained the ball exactly numSwaps times. Please remember that in our version of the game the magician always swaps two adjacent hats. Also, note that the total number of swaps in the game may be larger than numSwaps, because the magician may sometimes swap two hats that don't contain the ball.

            Assume that the magician chose the swaps he makes uniformly at random. That is, in each turn with probability 50% he swapped the hats on spots 0 and 1, and with probability 50% he swapped the hats on spots 1 and 2. Return the number of the spot that is most likely to contain the ball at the end of the game. If multiple spots are tied for the largest probability, return the smallest one of them.

            Definition

                
            Class: BallAndHats
            Method: getHat
            Parameters: string, int
            Returns: int
            Method signature: int getHat(string hats, int numSwaps)
            (be sure your method is public)
                

            Notes

            - Two hats are adjacent if their spots differ by 1.

            Constraints

            - hats will contain exactly three characters.
            - hats will contain exactly one 'o' character.
            - hats will contain exactly two '.' characters.
            - numSwaps will be between 0 and 1000, inclusive.

            Examples

            0)
                
            ".o."
            1
            Returns: 0
            The spots 0 and 2 are equally likely to contain the ball after the hat that contains it is swapped once. We return the smallest spot number, which is 0.
            1)
                
            "..o"
            0
            Returns: 2
            The ball does not change spots when 0 swaps are performed; therefore, the ball must be at spot 2.
            2)
                
            "o.."
            1
            Returns: 1

            3)
                
            "..o"
            2
            Returns: 0

            4)
                
            "o.."
            101
            Returns: 1

            This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved.




            題意:給三個帽子,一個帽子下面有氣球。一次SWAP可將相鄰的兩個帽子交換。每次SWAP的概率一樣的,0和1,1和2交換的概率都是50%。給出初始狀態,總共有numSwaps次SWAP了帶氣球的帽子。問最后氣球在哪個位置的概率最大,如果有幾個位置,則求最小的位置。

            思路:想法題!numSwaps奇偶性討論分析

            176.5pt  thinking速度太低,多分析分析,鍛煉思維哦!
            #include<string>
            using namespace std;
            class BallAndHats{
            public:
                
            int getHat(string hats, int numSwaps){
                    
            int i=0;
                    
            while (hats[i]!='o')    i++;
                    
            if (numSwaps==0)
                        
            return i;
                    numSwaps
            %=2;
                    
            if (i==0 && numSwaps==0)
                        
            return 0;
                    
            if (i==1 && numSwaps==1)
                        
            return 0;
                    
            if (i==2 && numSwaps==0)
                        
            return 0;
                    
            return 1;
                }
            };




            posted on 2012-07-10 09:03 wangs 閱讀(225) 評論(0)  編輯 收藏 引用 所屬分類: Topcoder

            狠狠色丁香久久婷婷综合_中| 无码人妻久久久一区二区三区| 久久久久久久人妻无码中文字幕爆| 亚洲精品无码久久一线| 99久久中文字幕| 热久久国产欧美一区二区精品| 伊人精品久久久久7777| 看久久久久久a级毛片| 777久久精品一区二区三区无码| 久久播电影网| 2020久久精品国产免费| 亚洲人成无码www久久久| 少妇内射兰兰久久| 亚洲国产精品狼友中文久久久 | 亚洲国产精品无码久久久秋霞2| 成人国内精品久久久久影院| 久久人妻少妇嫩草AV蜜桃| 久久婷婷国产综合精品| 热RE99久久精品国产66热| 久久精品国产影库免费看| 欧美喷潮久久久XXXXx| 亚洲精品国产综合久久一线| 女人香蕉久久**毛片精品| 亚洲国产精品成人久久| 色综合合久久天天给综看| 色偷偷888欧美精品久久久| 久久九九精品99国产精品| 久久人人添人人爽添人人片牛牛| 久久久久久青草大香综合精品| 欧美激情精品久久久久| 蜜桃麻豆www久久| 成人精品一区二区久久| 亚洲国产精品婷婷久久| 成人资源影音先锋久久资源网| 久久久免费精品re6| 久久久久久亚洲精品成人 | 亚洲欧美伊人久久综合一区二区| 欧美日韩精品久久久免费观看| 青青青青久久精品国产h久久精品五福影院1421 | 成人免费网站久久久| 久久国产乱子伦精品免费强|