• <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Ⅱ 1000pt(AOV網拓撲排序)

            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>。求最小的轉換Y或者N,使該圖沒有環!

            思路:怎么做呢?thinking




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

            久久久久无码精品| 亚洲色欲久久久综合网东京热 | 久久久久综合中文字幕 | 久久丫精品国产亚洲av不卡| 久久精品国产免费观看三人同眠| 久久国产免费| 亚洲人成无码久久电影网站| 久久久久人妻精品一区三寸蜜桃| 香蕉久久夜色精品国产小说| 国内精品久久九九国产精品| 精品久久久久久| 999久久久国产精品| 国产AV影片久久久久久| 超级碰久久免费公开视频| 欧洲性大片xxxxx久久久| 久久人做人爽一区二区三区| 亚洲精品国精品久久99热一| 国产精品对白刺激久久久| 久久99精品国产| 久久久久国产| 久久SE精品一区二区| 精品国产一区二区三区久久久狼| 久久久青草青青亚洲国产免观| 国产叼嘿久久精品久久| 一极黄色视频久久网站| 久久久久亚洲精品天堂| 久久夜色tv网站| 久久精品无码一区二区三区日韩| 久久99精品久久久大学生| 免费国产99久久久香蕉| 日本国产精品久久| 久久国产精品77777| 欧美一级久久久久久久大| 久久人爽人人爽人人片AV| 精品久久久久久久久久久久久久久 | 国产美女久久精品香蕉69| 国产成人香蕉久久久久| 麻豆成人久久精品二区三区免费| 理论片午午伦夜理片久久| 久久精品蜜芽亚洲国产AV| 亚洲欧洲精品成人久久曰影片|