Submission #3733920

---

Source Code Expand

import std.algorithm;
import std.array;
import std.container;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;

T read(T)() { return readln.chomp.to!T; }
T[] reads(T)() { return readln.split.to!(T[]); }
alias readint = read!int;
alias readints = reads!int;

const N = 10;

alias Loc = Tuple!(int, "row", int, "col");
Loc[] dxy(int row, int col) {
    Loc[] ret;
    auto a = [0, 1, 0, -1];
    for (int i = 0; i < a.length; i++) {
        ret ~= Loc(row + a[i], col + a[$ - i - 1]);
    }
    return ret;
}

bool calc(int row, int col, string[] g) {
    auto a = new char[][](N, N);
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            a[i][j] = g[i][j];
        }
    }
    assert(a[row][col] == 'x');

    a[row][col] = 'o';
    auto q = new DList!int(row * 10 + col);
    while (!q.empty) {
        int x = q.front;
        q.removeFront();

        int r = x / 10;
        int c = x % 10;
        if (a[r][c] == 'x') continue;

        a[r][c] = 'x';
        foreach (loc; dxy(r, c)) {
            if (0 <= loc.row && loc.row < N && 0 <= loc.col && loc.col < N) {
                if (a[loc.row][loc.col] == 'o') {
                    q.insertBack(loc.row * 10 + loc.col);
                }
            }
        }
    }

    // 陸地が全てなくなったか
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            if (a[i][j] == 'o') return false;
        }
    }
    return true;
}

void main() {
    string[] g;
    for (int i = 0; i < N; i++) g ~= read!string;

    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            if (g[i][j] == 'o') continue;

            if (calc(i, j, g)) {
                writeln("YES");
                return;
            }
        }
    }
    writeln("NO");
}

Submission Info

Judge Result