Submission #36091059

---

Source Code Expand

import std;

enum long N = 10;
enum long M = 3;
enum long T = N * N;

long[N][N] board;
auto candies = new long[](M+1);

long[] dx = [-1, 0, 1, 0];
long[] dy = [0, 1, 0, -1];

dchar[] dirs = ['F', 'B', 'L', 'R'];

struct Coord {
    long x, y;
}

long[N][] moveBox(dchar dir) {
    auto ret = board.dup;

    if (dir == 'L') {
        foreach (i; 0 .. N) {
            long k;

            foreach (j; 0 .. N) {
                if (ret[i][j] != 0) {
                    ret[i][k] = ret[i][j];
                    if (k != j) {
                        ret[i][j] = 0;
                    }
                    ++k;
                }
            }
        }
    }
    else if (dir == 'R') {
        foreach (i; 0 .. N) {
            long k = N - 1;

            foreach_reverse (j; 0 .. N) {
                if (ret[i][j] != 0) {
                    ret[i][k] = ret[i][j];
                    if (k != j) {
                        ret[i][j] = 0;
                    }
                    --k;
                }
            }
        }
    }
    else if (dir == 'F') {
        foreach (j; 0 .. N) {
            long k;

            foreach (i; 0 .. N) {
                if (ret[i][j] != 0) {
                    ret[k][j] = ret[i][j];
                    if (k != i) {
                        ret[i][j] = 0;
                    }
                    ++k;
                }
            }
        }
    }
    else {
        foreach (j; 0 .. N) {
            long k = N - 1;

            foreach_reverse (i; 0 .. N) {
                if (ret[i][j] != 0) {
                    ret[k][j] = ret[i][j];
                    if (k != i) {
                        ret[i][j] = 0;
                    }
                    --k;
                }
            }
        }
    }

    return ret;
}

Coord findCoordToPut(long[N][] mat, long num) {
    Coord ret;
    long cnt;

    foreach (i; 0 .. N) {
        foreach (j; 0 .. N) {
            if (mat[i][j] == 0) ++cnt;

            if (cnt >= num) ret.x = i, ret.y = j;
        }
    }

    return ret;
}

long computeScore(long[N][] mat) {
    auto visited = new bool[][](N, N);
    long cnt;

    foreach (i; 0 .. N) {
        foreach (j; 0 .. N) {
            if (!visited[i][j] && mat[i][j] != 0) {
                visited[i][j] = true;
                long size = 1;
                Coord[] stack = [Coord(i, j)];

                while (!stack.empty) {
                    auto f = stack.front;
                    stack.popFront;

                    foreach (k; 0 .. 4) {
                        long nx = f.x + dx[k], ny = f.y + dy[k];

                        if (0 <= nx && nx < N && 0 <= ny && ny < N && !visited[nx][ny] && mat[nx][ny] == mat[i][j]) {
                            visited[nx][ny] = true;
                            ++size;
                            stack ~= Coord(nx, ny);
                        }
                    }
                }

                cnt += size * size;
            }
        }
    }

    long ret = round((1e6 * cnt) / candies.map!(a => a * a).sum).to!long;
    return ret;
}

dchar process(long type, long num) {
    dchar ret;
    long maxScore;
    long[N][] nxt;

    foreach (i, dir; dirs) {
        auto mat = moveBox(dir);

        auto coord = findCoordToPut(mat, num);
        mat[coord.x][coord.y] = type;

        long score = computeScore(mat);
        if (maxScore < score) {
            ret = dir;
            maxScore = score;
            nxt = mat;
        }
    }

    board = nxt;
    return ret;
}

void main() {
    auto f = readln.chomp.split.to!(long[]);

    foreach (c; f) ++candies[c];

    foreach (i; 0 .. T) {
        long p;
        readf("%d\n", p);

        dchar d = process(f[i], p);
        d.writeln;
        stdout.flush;
    }
}

Submission Info

Judge Result