Submission #42920730

---

Source Code Expand

import std;

void read(T...)(string S, ref T args) {
    auto buf = S.split;
    foreach (i, ref arg; args) {
        arg = buf[i].to!(typeof(arg));
    }
}

void main () {
    int HA, WA; readln.read(HA, WA);
    string[] A;
    foreach (_; 0..HA) {
        A ~= readln.chomp;
    }

    int HB, WB; readln.read(HB, WB);
    string[] B;
    foreach (_; 0..HB) {
        B ~= readln.chomp;
    }

    int HX, WX; readln.read(HX, WX);
    string[] X;
    foreach (_; 0..HX) {
        X ~= readln.chomp;
    }

    solve(A, B, X);
}

void solve (string[] A, string[] B, string[] X) {
    A = cut(A);
    B = cut(B);
    X = cut(X);

    char[][] base;
    base.length = X.length;
    foreach (ref x; base) {
        x.length = X[0].length;
    }

    if (X.length < max(A.length, B.length) || X[0].length < max(A[0].length, B[0].length)) {
        writeln("No");
        return;
    }

    foreach (i; 0..base.length) {
        foreach (j; 0..base[i].length) {
            if (base.length < i+A.length || base[0].length < j+A[0].length) {
                continue;
            }
            foreach (i2; 0..base.length) {
                foreach (j2; 0..base[i].length) {
                    if (base.length < i2+B.length || base[0].length < j2+B[0].length) {
                        continue;
                    }
                    // reset
                    foreach (ref x; base) {
                        x[] = '.';
                    }
                    // Aを貼る
                    foreach (k; 0..A.length) {
                        foreach (l; 0..A[k].length) {
                            base[k+i][l+j] = A[k][l];
                        }
                    }
                    // Bを貼る
                    foreach (k; 0..B.length) {
                        foreach (l; 0..B[k].length) {
                            if (B[k][l] == '#') {
                                base[k+i2][l+j2] = B[k][l];
                            }
                        }
                    }

                    if (cut(cast(string[])base.dup) == X) {
                        writeln("Yes");
                        return;
                    }
                }
            }
        }
    }

    writeln("No");
}

string[] cut (string[] S) {
    // 上のカット
    int up = 0;
    foreach (i; 0..S.length) {
        bool has_black = false;
        foreach (j; 0..S[i].length) {
            if (S[i][j] == '#') {
                has_black = true;
                break;
            }
        }
        if (has_black) {
            break;
        }
        up++;
    }

    S = S[up..$];

    // 下のカット
    int down = 0;
    foreach_reverse (i; 0..S.length) {
        bool has_black = false;
        foreach (j; 0..S[i].length) {
            if (S[i][j] == '#') {
                has_black = true;
                break;
            }
        }
        if (has_black) {
            break;
        }
        down++;
    }

    S = S[0..$-down];

    // 右のカット
    int right = 0;
    foreach_reverse (i; 0..S[0].length) {
        bool has_black = false;
        foreach (j; 0..S.length) {
            if (S[j][i] == '#') {
                has_black = true;
                break;
            }
        }
        if (has_black) {
            break;
        }
        right++;
    }

    foreach (i; 0..S.length) {
        S[i] = S[i][0..$-right];
    }

    // 左のカット
    int left = 0;
    foreach (i; 0..S[0].length) {
        bool has_black = false;
        foreach (j; 0..S.length) {
            if (S[j][i] == '#') {
                has_black = true;
                break;
            }
        }
        if (has_black) {
            break;
        }
        left++;
    }

    foreach (i; 0..S.length) {
        S[i] = S[i][left..$];
    }

    return S;
}

Submission Info

Judge Result