• <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 閱讀(971) 評論(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)
            滿足題意

            99久久精品免费国产大片| 久久天天躁夜夜躁狠狠| 国产成人精品白浆久久69| 久久久久久人妻无码| 久久综合九色综合精品| 性做久久久久久久久| 亚洲香蕉网久久综合影视| 久久久噜噜噜久久熟女AA片| 久久综合九色综合久99| 2021最新久久久视精品爱| 久久久精品人妻一区二区三区四| 日本久久久久久中文字幕| 久久天天躁狠狠躁夜夜avapp| 久久精品国产第一区二区三区| 久久性精品| 久久精品国产亚洲av麻豆色欲 | 久久精品国产国产精品四凭| 欧美伊人久久大香线蕉综合| 久久91精品国产91久久户| 热99RE久久精品这里都是精品免费| 72种姿势欧美久久久久大黄蕉| 色天使久久综合网天天| 老司机国内精品久久久久| 99精品国产综合久久久久五月天| 久久综合中文字幕| 精品久久无码中文字幕| 中文字幕精品久久久久人妻| 99久久精品费精品国产| 久久国产精品久久国产精品| 一本久久a久久精品亚洲| 亚洲国产天堂久久综合| 久久亚洲电影| 久久精品国产99久久丝袜| segui久久国产精品| 久久免费精品视频| 91精品国产高清久久久久久91| 精品久久久久久无码专区不卡| 亚洲国产精品无码成人片久久| 麻豆精品久久久久久久99蜜桃| 亚洲国产精品成人久久蜜臀| 中文字幕精品无码久久久久久3D日动漫|