提出 #44760033

---

ソースコード 拡げる

import std;

void main () {
    int N = readln.chomp.to!int;
    int[] C = new int[](N);
    int[][] P = new int[][](N, 0);
    foreach (i; 0..N) {
        auto input = readln.split.to!(int[]);
        C[i] = input[0];
        P[i] = input[1..$];

        // 0-indexed
        P[i][] -= 1;
        C[i] -= 1;
    }

    solve(N, C, P);
}

void solve (int N, int[] C, int[][] P) {
    int[][] graph = new int[][](N, 0);

    foreach (i; 0..N) {
        foreach (p; P[i]) {
            graph[i] ~= p;
        }
    }

    // 本1からの連結成分を見つける

    DList!int Q;
    Q.insertBack(0);
    bool[] need = new bool[](N);
    need[0] = true;
    int[] outdegree = new int[](N);

    while (!Q.empty) {
        auto begin = Q.front; Q.removeFront;
        foreach (to; graph[begin]) {
            outdegree[begin]++;
            if (!need[to]) {
                need[to] = true;
                Q.insertBack(to);
            }
        }
    }

    foreach (i; 0..N) {
        foreach (p; P[i]) {
            graph[p] ~= i;
        }
    }

    int[] ans; reserve(ans, N);

    foreach (i; 0..N) {
        if (outdegree[i] == 0 && need[i]) {
            ans ~= i+1;
            Q.insertBack(i);
        }
    }

    while (!Q.empty) {
        auto begin = Q.front; Q.removeFront;
        foreach (to; graph[begin]) {
            outdegree[to]--;
            if (outdegree[to] == 0 && to != 0) {
                ans ~= to+1;
                Q.insertBack(to);
            }
        }
    }

    foreach (i, a; ans) {
        write(a, (i == ans.length-1 ? '\n' : ' '));
    }
}

提出情報

コンパイルエラー

/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

ジャッジ結果