結果
問題 | No.2998 Rainbow Christmas Tree |
ユーザー | 👑 hos.lyric |
提出日時 | 2024-12-23 17:26:34 |
言語 | D (dmd 2.106.1) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,175 bytes |
コンパイル時間 | 2,714 ms |
コンパイル使用メモリ | 123,660 KB |
実行使用メモリ | 25,216 KB |
最終ジャッジ日時 | 2024-12-23 17:27:23 |
合計ジャッジ時間 | 48,114 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
10,496 KB |
testcase_01 | AC | 2 ms
17,792 KB |
testcase_02 | AC | 2 ms
10,496 KB |
testcase_03 | AC | 2 ms
17,792 KB |
testcase_04 | AC | 2 ms
10,496 KB |
testcase_05 | AC | 2 ms
17,664 KB |
testcase_06 | AC | 2 ms
10,496 KB |
testcase_07 | AC | 103 ms
20,796 KB |
testcase_08 | AC | 109 ms
25,216 KB |
testcase_09 | AC | 102 ms
18,048 KB |
testcase_10 | AC | 116 ms
18,048 KB |
testcase_11 | AC | 148 ms
25,216 KB |
testcase_12 | AC | 100 ms
18,048 KB |
testcase_13 | AC | 101 ms
12,800 KB |
testcase_14 | AC | 98 ms
12,800 KB |
testcase_15 | AC | 98 ms
12,672 KB |
testcase_16 | AC | 96 ms
12,672 KB |
testcase_17 | AC | 107 ms
12,800 KB |
testcase_18 | AC | 98 ms
12,800 KB |
testcase_19 | AC | 95 ms
12,288 KB |
testcase_20 | AC | 95 ms
12,544 KB |
testcase_21 | AC | 104 ms
14,848 KB |
testcase_22 | AC | 100 ms
12,800 KB |
testcase_23 | AC | 95 ms
12,672 KB |
testcase_24 | AC | 96 ms
12,672 KB |
testcase_25 | AC | 100 ms
12,672 KB |
testcase_26 | AC | 97 ms
12,672 KB |
testcase_27 | AC | 127 ms
12,672 KB |
testcase_28 | AC | 96 ms
12,672 KB |
testcase_29 | AC | 99 ms
12,672 KB |
testcase_30 | AC | 96 ms
12,672 KB |
testcase_31 | AC | 94 ms
12,672 KB |
testcase_32 | AC | 97 ms
12,648 KB |
testcase_33 | AC | 95 ms
12,672 KB |
testcase_34 | AC | 96 ms
12,672 KB |
testcase_35 | AC | 99 ms
12,672 KB |
testcase_36 | TLE | - |
testcase_37 | AC | 99 ms
12,672 KB |
testcase_38 | TLE | - |
testcase_39 | TLE | - |
testcase_40 | TLE | - |
testcase_41 | TLE | - |
testcase_42 | AC | 130 ms
12,672 KB |
testcase_43 | TLE | - |
testcase_44 | TLE | - |
testcase_45 | AC | 2 ms
5,248 KB |
testcase_46 | AC | 2 ms
5,248 KB |
testcase_47 | AC | 97 ms
12,672 KB |
testcase_48 | AC | 96 ms
12,672 KB |
testcase_49 | AC | 96 ms
12,672 KB |
testcase_50 | AC | 96 ms
12,672 KB |
testcase_51 | AC | 95 ms
12,672 KB |
testcase_52 | AC | 127 ms
12,672 KB |
testcase_53 | AC | 99 ms
12,672 KB |
testcase_54 | AC | 100 ms
12,672 KB |
testcase_55 | AC | 97 ms
12,672 KB |
testcase_56 | AC | 97 ms
25,088 KB |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void main() { try { for (; ; ) { const N = readInt; const K = readInt; auto P = new int[][](N - 1, N); foreach (x; 0 .. N - 1) foreach (u; 0 .. N) { P[x][u] = readInt - 1; } /* 0 <- ... <- a N-1 <- ... <- b */ alias Edge = Tuple!(int, "x", int, "v"); Edge[][2] paths; foreach (h; 0 .. 2) { paths[h] = new Edge[N]; paths[h][] = Edge(-1, -1); } int a = 0, b = N - 1; paths[0][a] = paths[1][b] = Edge(-2, -2); int r = -1; foreach (x; 0 .. N - 1) { if (~P[x][a]) { paths[0][P[x][a]] = Edge(x, a); a = P[x][a]; if (~paths[1][a].x) r = a; } else if (~P[x][b]) { paths[1][P[x][b]] = Edge(x, b); b = P[x][b]; if (~paths[0][b].x) r = b; } else { assert(false); } if (~r) break; } debug { writeln("paths = ", paths); writeln("r = ", r); } assert(~r); auto used = new bool[N - 1]; auto ans = new int[N]; ans[] = -1; ans[r] = -2; foreach (h; 0 .. 2) { for (int u = r; ; ) { const x = paths[h][u].x; const v = paths[h][u].v; debug writefln("%s %s; %s -> %s", h, x, u, v); if (x == -2) break; used[x] = true; ans[v] = x; u = v; } } debug { writeln("ans = ", ans); writeln("used = ", used); } foreach (x; 0 .. N - 1) if (!used[x]) { foreach (u; 0 .. N) if (~P[x][u]) { if (~ans[P[x][u]] && !~ans[u]) { used[x] = true; ans[u] = x; break; } } assert(used[x]); } writeln("Yes"); foreach (u; 0 .. N) { if (u) write(" "); write((r != u) ? (ans[u] + 1) : 0); } writeln; } } catch (EOFException e) { } }