Submission #1697597


Source Code Expand

func isAvailable(x x: Int, y: Int, onBoard board: [[String]]) -> Bool {
    for i in 0..<8 {
        if board[y][i] == "Q" {
            return false
        }
        if board[i][x] == "Q" {
            return false
        }
    }
    for xx in 0..<8 {
        let yy = xx - x + y
        if 0..<8 ~= yy && board[yy][xx] == "Q" {
            return false
        }
    }
    for xx in 0..<8 {
        let yy = -xx + x + y
        if 0..<8 ~= yy && board[yy][xx] == "Q" {
            return false
        }
    }
    return true
}

func printBoard(board: [[String]]) {
    board.forEach { print($0.reduce("", combine: +)) }
}

func walkBoard(board: [[String]], y: Int) -> Bool {
    if y == 8 {
        printBoard(board)
        return true
    }

    var availableX = [Int]()
    if let qIndex = board[y].indexOf("Q") {
        availableX = [qIndex]
    } else {
        for x in 0..<8 {
            if isAvailable(x: x, y: y, onBoard: board) {
                availableX.append(x)
            }
        }
    }

    for x in availableX {
        var newBoard = board
        newBoard[y][x] = "Q"
        if walkBoard(newBoard, y: y + 1) {
            return true
        }
    }

    return false
}

var board = [[String]]()
for _ in 0..<8 {
    board.append(readLine()!.characters.map(String.init(_:)))
}

if !walkBoard(board, y: 0) {
    print("No Answer")
}

Submission Info

Submission Time
Task C - パズルのお手伝い
User yamoridon
Language Swift (swift-2.2-RELEASE)
Score 0
Code Size 1426 Byte
Status WA
Exec Time 43 ms
Memory 4208 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 33
WA × 9
Set Name Test Cases
All 00_sample1.txt, 00_sample2.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 01_rnd_20.txt, 01_rnd_21.txt, 01_rnd_22.txt, 01_rnd_23.txt, 01_rnd_24.txt, 01_rnd_25.txt, 01_rnd_26.txt, 01_rnd_27.txt, 01_rnd_28.txt, 01_rnd_29.txt, 01_rnd_30.txt, 01_rnd_31.txt, 01_rnd_32.txt, 01_rnd_33.txt, 01_rnd_34.txt, 01_rnd_35.txt, 01_rnd_36.txt, 01_rnd_37.txt, 01_rnd_38.txt, 01_rnd_39.txt
Case Name Status Exec Time Memory
00_sample1.txt AC 43 ms 4208 KB
00_sample2.txt AC 4 ms 768 KB
01_rnd_00.txt AC 4 ms 768 KB
01_rnd_01.txt AC 4 ms 768 KB
01_rnd_02.txt AC 4 ms 768 KB
01_rnd_03.txt AC 4 ms 768 KB
01_rnd_04.txt WA 4 ms 768 KB
01_rnd_05.txt AC 4 ms 768 KB
01_rnd_06.txt AC 4 ms 768 KB
01_rnd_07.txt AC 4 ms 768 KB
01_rnd_08.txt WA 4 ms 768 KB
01_rnd_09.txt AC 4 ms 768 KB
01_rnd_10.txt AC 4 ms 768 KB
01_rnd_11.txt AC 4 ms 768 KB
01_rnd_12.txt AC 4 ms 768 KB
01_rnd_13.txt AC 4 ms 768 KB
01_rnd_14.txt WA 4 ms 768 KB
01_rnd_15.txt AC 4 ms 768 KB
01_rnd_16.txt AC 4 ms 768 KB
01_rnd_17.txt WA 4 ms 768 KB
01_rnd_18.txt AC 4 ms 768 KB
01_rnd_19.txt AC 4 ms 768 KB
01_rnd_20.txt AC 5 ms 768 KB
01_rnd_21.txt AC 4 ms 768 KB
01_rnd_22.txt WA 4 ms 768 KB
01_rnd_23.txt AC 4 ms 768 KB
01_rnd_24.txt AC 4 ms 768 KB
01_rnd_25.txt AC 4 ms 768 KB
01_rnd_26.txt WA 5 ms 768 KB
01_rnd_27.txt AC 4 ms 768 KB
01_rnd_28.txt AC 4 ms 768 KB
01_rnd_29.txt AC 4 ms 768 KB
01_rnd_30.txt AC 4 ms 768 KB
01_rnd_31.txt AC 4 ms 768 KB
01_rnd_32.txt AC 4 ms 768 KB
01_rnd_33.txt AC 4 ms 768 KB
01_rnd_34.txt WA 4 ms 768 KB
01_rnd_35.txt WA 4 ms 768 KB
01_rnd_36.txt AC 4 ms 768 KB
01_rnd_37.txt WA 4 ms 768 KB
01_rnd_38.txt AC 4 ms 768 KB
01_rnd_39.txt AC 4 ms 768 KB