Submission #44746830

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
import std;
void main () {
    int H, W; readln.read(H, W);
    char[][] c = new char[][](H, 0);
    foreach (i; 0..H) {
        c[i] = readln.chomp.dup;
    }
    solve(H, W, c);
}
void solve (int H, int W, char[][] c) {
    int[][] lCount = new int[][](H, 26);
    int[][] lInfo = new int[][](H, 2);
    int[][] cCount = new int[][](W, 26);
    int[][] cInfo = new int[][](W, 2);
    // Info は [0] が種類数 [1] が総数 とする
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

import std;

void main () {
    int H, W; readln.read(H, W);
    char[][] c = new char[][](H, 0);
    foreach (i; 0..H) {
        c[i] = readln.chomp.dup;
    }

    solve(H, W, c);
}

void solve (int H, int W, char[][] c) {
    int[][] lCount = new int[][](H, 26);
    int[][] lInfo = new int[][](H, 2);

    int[][] cCount = new int[][](W, 26);
    int[][] cInfo = new int[][](W, 2);

    // Info は [0] が種類数 [1] が総数 とする

    // 行(line)
    foreach (i; 0..H) {
        foreach (j; 0..W) {
            lCount[i][ c[i][j]-'a' ]++;
        }
        foreach (x; lCount[i]) {
            if (x != 0) {
                lInfo[i][0]++;
            }
            lInfo[i][1] += x;
        }
    }

    // 列(column)
    foreach (j; 0..W) {
        foreach (i; 0..H) {
            cCount[j][ c[i][j]-'a' ]++;
        }
        foreach (x; cCount[j]) {
            if (x != 0) {
                cInfo[j][0]++;
            }
            cInfo[j][1] += x;
        }
    }

    struct trio {
        int type;
        int color;
    }

    // 操作
    DList!trio Q;
    int lOp = 0, cOp = 0;

    while (true) {
        // 行
        foreach (i; 0..H) {
            if (lInfo[i][0] == 1 && 2 <= lInfo[i][1]) {
                lOp++;
                lInfo[i][] = 0;
                int co;
                foreach (idx, x; lCount[i]) {
                    if (x != 0) {
                        co = cast(int) idx;
                        break;
                    }
                }
                // 列側に削除依頼を出す
                Q.insertBack(trio(0, co));
            }
        }
        // 列
        foreach (j; 0..W) {
            if (cInfo[j][0] == 1 && 2 <= cInfo[j][1]) {
                cOp++;
                cInfo[j][] = 0;
                int co;
                foreach (idx, x; cCount[j]) {
                    if (x != 0) {
                        co = cast(int) idx;
                        break;
                    }
                }
                // 行側に削除依頼を出す
                Q.insertBack(trio(1, co));
            }
        }
        if (Q.empty) {
            break;
        } else {
            while (!Q.empty) {
                auto head = Q.front; Q.removeFront;
                if (head.type == 0) {
                    // 列削除
                    foreach (j; 0..W) {
                        cCount[j][head.color]--;
                        cInfo[j][1]--;
                        if (cCount[j][head.color] == 0) {
                            cInfo[j][0]--;
                        }
                    }
                } else {
                    // 行削除
                    foreach (i; 0..H) {
                        lCount[i][head.color]--;
                        lInfo[i][1]--;
                        if (lCount[i][head.color] == 0) {
                            lInfo[i][0]--;
                        }
                    }
                }
            }
        }
    }

    writeln((H-lOp)*(W-cOp));
}

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

Submission Info

Compile Error

/home/runner/.dub/packages/mir-algorithm/3.20.4/mir-algorithm/source/mir/serde.d(52,9): Deprecation: alias this for classes/interfaces is deprecated

Judge Result