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

            oyjpArt ACM/ICPC算法程序設計空間

            // I am new in programming, welcome to my blog
            I am oyjpart(alpc12, 四城)
            posts - 224, comments - 694, trackbacks - 0, articles - 6

            RookAttack

            Posted on 2007-04-16 20:47 oyjpart 閱讀(972) 評論(0)  編輯 收藏 引用 所屬分類: ACM/ICPC或其他比賽

            Problem Statement

                 You have been given a rows-by-cols chessboard, with a list of squares cut out. The list of cutouts will be given in a String[] cutouts. Each element of cutouts is a comma-delimited lists of coords. Each coord has the form (quotes for clarity) "r c". If coord "r c" appears in an element of cutouts, it means that the square at row r column c (0-based) has been removed from the chessboard. This problem will involve placing rooks on a chessboard, so that they cannot attack each other. For a rook to attack a target piece, it must share the same row or column as the target. Your method will return an int that will be the maximum number of rooks that can be placed on the chessboard, such that no pair of rooks can attack each other. Rooks cannot be placed on cut out squares. The cut out squares do not affect where the rooks can attack.

            Constraints

            - rows will be between 1 and 300 inclusive.
            - cols will be between 1 and 300 inclusive.
            - cutouts will contain between 0 and 50 elements inclusive.
            - Each element of cutouts will contain between 3 and 50 characters inclusive.
            - Each element of cutouts will be a comma delimited list of coords. Each coord will be of the form "r c", where
            • r and c are integers, with no extra leading zeros,
            • r is between 0 and rows-1 inclusive,
            • and c is between 0 and cols-1 inclusive.
            - Each element of cutouts will not contain leading or trailing spaces.

            Examples

            1)
                
            2
            2
            {"0 0","0 1","1 1","1 0"}
            Returns: 0
            2)
                
            3
            3
            {"0 0","1 0","1 1","2 0","2 1","2 2"}
            Returns: 2

            看到這個題目有什么想法?
            8皇后問題相信是大家入門搜索或其他算法的經典教材了 如果被砍掉部分格子呢?
            看到row和col分別是300的時候相信想搜索的朋友們心里可能要嘀咕一下了

            如果這樣分析一下:
            由于在放置rook的時候要求這一行還有這一列一定只有這一個元素(注意是rook 不是queen 不要求斜行)
            也就是說一個rook可以唯一的決定一行和一列
            那么。。
            這個rook似乎可以看成是某一行和某一列的一條邊
            如果把rows作為一個集合 cols作為一個集合 把不是cut out的點作為row和col的連接
            于是就轉化成了:二分圖匹配
            按照最短路的增廣分析 時間復雜度不會超過o(n^3) 滿足題目要求
            比如一個3*3的棋盤 被cut out掉了(0,0) (1,2) (2,2) 3個格子
            row集合 0,1,2
            col集合 0,1,2
            可連接的邊為(0, 1), (0,2), (1, 0), (1,1), (2,0),(2,1)
            執行最大匹配 將會得到如下結果
            (0,2) (1,0), (2,1)
            滿足題意

            亚洲精品白浆高清久久久久久| 国产精品美女久久久m| 精品国产91久久久久久久a| 国产成人久久久精品二区三区| 一级a性色生活片久久无| 亚洲欧洲中文日韩久久AV乱码| 久久精品亚洲AV久久久无码| 久久777国产线看观看精品| 久久久久免费视频| 99久久精品免费看国产一区二区三区 | 99久久99久久| 久久综合给合综合久久| 久久超碰97人人做人人爱| 久久久久亚洲精品天堂久久久久久| 国产精品乱码久久久久久软件| 一本久久久久久久| 久久久久久精品无码人妻| 国产激情久久久久影院老熟女免费 | 国产成人综合久久精品红| 久久精品国产第一区二区三区| 久久精品国产第一区二区| 国产V综合V亚洲欧美久久| 国产精品亚洲综合久久| 曰曰摸天天摸人人看久久久| 99精品国产99久久久久久97| 久久精品中文字幕一区| 久久久青草久久久青草| 久久棈精品久久久久久噜噜| 久久精品免费全国观看国产| 久久精品?ⅴ无码中文字幕| 99久久人人爽亚洲精品美女| 国内精品伊人久久久久av一坑| 性做久久久久久久| 亚洲国产精品无码久久久不卡| 久久无码AV中文出轨人妻| 亚洲一区精品伊人久久伊人| 香蕉99久久国产综合精品宅男自 | 日韩人妻无码精品久久久不卡| 伊人精品久久久久7777| 午夜视频久久久久一区 | 久久亚洲精品中文字幕|