• <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
            數(shù)據(jù)加載中……

            SRM549 DIVⅡ 1000pt(AOV網(wǎng)拓?fù)渑判颍?/a>

            Problem Statement

                 The Order of the Hats is a magical organization. One of their duties is to teach students how to cast spells. There are N spells numbered from 0 to N-1. As an aid for the students, the teachers have prepared a spell chart. The chart lists suggestions on the order in which to study the spells. (This is explained in more detail below.)

            Recently, some changelings broke into the Order's spell archive and messed up the spell chart. You are given a String[] spellChart containing the new, messed-up state of the spell chart. Each character of each element of spellChart is either 'Y' or 'N'. The students will come to study soon. They will interpret the chart in the following way: If spellChart[i][j] is 'Y' then spell i must be learned before spell j.

            As the chart is now messed up, it may be impossible to learn all the spells in the chart because of cycles in the requirements. Your task is to repair the given chart. Determine the minimum number of changes needed to remove all the cycles in the requirements. In a single change, you may either change some character spellChart[i][j] from 'Y' to 'N', or change some character from 'N' to 'Y'.

            Definition

                
            Class: OrderOfTheHats
            Method: minChanged
            Parameters: String[]
            Returns: int
            Method signature: int minChanged(String[] spellChart)
            (be sure your method is public)
                

            Constraints

            - spellChart will contain between 1 and 20 elements, inclusive.
            - Each element of spellChart will contain N characters, where N is the number of elements in spellChart.
            - Each character in each element of spellChart will be either 'Y' or 'N'.

            Examples

            0)
                
            {"Y"}
            Returns: 1
            This spell chart contains a spell that should be learned before itself. The students would never be able to learn such a spell. We can remove this cyclic dependency by changing the 'Y' to 'N'.
            1)
                
            {"NYN",  "NNY",  "NNN"}
            Returns: 0
            This spell chart is already OK.
            2)
                
            {"NYN",  "NNY",  "YNN"}
            Returns: 1
            Changing any single 'Y' to a 'N' will fix this spell chart.
            3)
                
            {"NYYYYYY",  "YNYYYYY",  "YYNYYYY",  "YYYNYYY",  "YYYYNYY",  "YYYYYNY",  "YYYYYYN"}
            Returns: 21

            4)
                
            {"NNNY",  "YNYN",  "YNNN",  "YYYN"}
            Returns: 1

            5)
                
            {"YYYYYNNYYYNYNNNNYNNY",  "NYNNNYYNNYNYYYNYYYYY",  "NNYNNNYYNNNNNNYYYYNY",  "YYNYNYYNNYYYNYNNNYYY",  "NYYNNYNYNYNNNNYYYNYN",  "NNNNNYYNYNNYYYYNYYYN",  "YNYNYYNNNYNNNNNYNNYY",  "NYYYYNYNYNNYNNYNNNNY",  "YYYYNYYNNYYYNNYNNYNY",  "YYYYYYNYNYNYNNNNNNYN",  "NNYYYYYNNNYNNNYNNNNY",  "YYNNNYNYYNYYNYYNYNYN",  "NNYNYYNYYNYYNYNYNYYN",  "YNYNYYNYNNNYNYNYYNYY",  "NNYNNNYYYYYYYYYYYNYY",  "YYYYYNYYNYYYYYNNYNNN",  "NYYYYYYYYNNNNNYYNNYN",  "YNNYNNNYYNYYYNYNYYYY",  "YYNNYNYYYNYYNNNYYNNY",  "NNYNYNYYYNYYNYNNYNNN"}
            Returns: 79

            6)
                
            {"YYNYNN",  "YNYNNY",  "YYYYNN",  "NNNYNN",  "NNNYNN",  "YNYNYN"}
            Returns: 5

            7)
                
            {"NNNNNNNNNN",  "NNNNNNNNNN",  "NNNYNNYNNN",  "NNNYNNYNNN",  "NNNYNNYNNN",  "NNNNNNNNNN",  "NNYYYYYYNN",  "NNYNNNNYNN",  "NNNYYYYNNN",  "NNNNNNNNNN"}
            Returns: 6

            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.




            題意:給定一張N*N的map,N個頂點的圖,map[i][j]=='Y',<i,j>,否則<j,i>。求最小的轉(zhuǎn)換Y或者N,使該圖沒有環(huán)!

            思路:怎么做呢?thinking




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

            国产成人久久AV免费| 欧美久久一区二区三区| 伊人色综合久久天天人手人婷| 国产精品亚洲综合久久 | 久久久久久亚洲Av无码精品专口| 精品久久久久久中文字幕人妻最新| 91精品久久久久久无码| 亚洲国产欧洲综合997久久| 国产成人综合久久综合| 香蕉久久影院| 精品综合久久久久久97超人| 久久久噜噜噜久久中文字幕色伊伊| 久久久精品人妻一区二区三区四| 久久国产热这里只有精品| 97久久久久人妻精品专区| 色综合久久夜色精品国产| 精品国产青草久久久久福利| 色综合久久无码中文字幕| 2021国产精品午夜久久| 国产精品成人99久久久久91gav| 亚洲AV日韩精品久久久久| 亚洲欧美国产日韩综合久久| 国产精品无码久久久久| 久久最新精品国产| 国内精品久久人妻互换| 久久久久久国产精品免费无码 | 国产69精品久久久久9999| 国内精品久久久久久久久电影网| 久久毛片免费看一区二区三区| 国产精品青草久久久久婷婷| 亚洲精品无码久久千人斩| 囯产精品久久久久久久久蜜桃| 思思久久99热免费精品6| 精品久久久久久久久久久久久久久| 国产欧美久久久精品| 国产日产久久高清欧美一区| 久久91精品国产91久久户| 久久免费视频观看| 久久99精品久久久久久噜噜| 久久精品国产亚洲Aⅴ香蕉| 久久人妻少妇嫩草AV蜜桃|