結果
問題 | No.1254 補強への架け橋 |
ユーザー | 👑 hos.lyric |
提出日時 | 2020-10-09 21:40:12 |
言語 | D (dmd 2.105.2) |
結果 |
AC
|
実行時間 | 154 ms / 2,000 ms |
コード長 | 2,425 bytes |
コンパイル時間 | 1,246 ms |
コンパイル使用メモリ | 110,092 KB |
実行使用メモリ | 12,332 KB |
最終ジャッジ日時 | 2023-09-04 10:22:05 |
合計ジャッジ時間 | 16,785 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,384 KB |
testcase_02 | AC | 1 ms
4,384 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 1 ms
4,384 KB |
testcase_05 | AC | 1 ms
4,384 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,384 KB |
testcase_08 | AC | 1 ms
4,380 KB |
testcase_09 | AC | 1 ms
4,384 KB |
testcase_10 | AC | 1 ms
4,380 KB |
testcase_11 | AC | 2 ms
4,380 KB |
testcase_12 | AC | 1 ms
4,380 KB |
testcase_13 | AC | 2 ms
4,380 KB |
testcase_14 | AC | 2 ms
4,384 KB |
testcase_15 | AC | 2 ms
4,380 KB |
testcase_16 | AC | 1 ms
4,380 KB |
testcase_17 | AC | 2 ms
4,380 KB |
testcase_18 | AC | 2 ms
4,380 KB |
testcase_19 | AC | 1 ms
4,380 KB |
testcase_20 | AC | 1 ms
4,384 KB |
testcase_21 | AC | 2 ms
4,380 KB |
testcase_22 | AC | 2 ms
4,384 KB |
testcase_23 | AC | 2 ms
4,380 KB |
testcase_24 | AC | 1 ms
4,384 KB |
testcase_25 | AC | 1 ms
4,384 KB |
testcase_26 | AC | 2 ms
4,380 KB |
testcase_27 | AC | 2 ms
4,380 KB |
testcase_28 | AC | 1 ms
4,380 KB |
testcase_29 | AC | 2 ms
4,384 KB |
testcase_30 | AC | 1 ms
4,380 KB |
testcase_31 | AC | 2 ms
4,380 KB |
testcase_32 | AC | 1 ms
4,384 KB |
testcase_33 | AC | 1 ms
4,380 KB |
testcase_34 | AC | 2 ms
4,384 KB |
testcase_35 | AC | 1 ms
4,380 KB |
testcase_36 | AC | 1 ms
4,380 KB |
testcase_37 | AC | 2 ms
4,380 KB |
testcase_38 | AC | 2 ms
4,384 KB |
testcase_39 | AC | 1 ms
4,380 KB |
testcase_40 | AC | 1 ms
4,380 KB |
testcase_41 | AC | 1 ms
4,384 KB |
testcase_42 | AC | 2 ms
4,380 KB |
testcase_43 | AC | 3 ms
4,380 KB |
testcase_44 | AC | 2 ms
4,384 KB |
testcase_45 | AC | 2 ms
4,384 KB |
testcase_46 | AC | 2 ms
4,504 KB |
testcase_47 | AC | 2 ms
4,380 KB |
testcase_48 | AC | 2 ms
4,380 KB |
testcase_49 | AC | 1 ms
4,384 KB |
testcase_50 | AC | 3 ms
4,380 KB |
testcase_51 | AC | 3 ms
4,388 KB |
testcase_52 | AC | 3 ms
4,380 KB |
testcase_53 | AC | 2 ms
4,384 KB |
testcase_54 | AC | 2 ms
4,384 KB |
testcase_55 | AC | 3 ms
4,384 KB |
testcase_56 | AC | 2 ms
4,384 KB |
testcase_57 | AC | 2 ms
4,384 KB |
testcase_58 | AC | 2 ms
4,380 KB |
testcase_59 | AC | 1 ms
4,384 KB |
testcase_60 | AC | 2 ms
4,380 KB |
testcase_61 | AC | 2 ms
4,380 KB |
testcase_62 | AC | 1 ms
4,388 KB |
testcase_63 | AC | 13 ms
4,380 KB |
testcase_64 | AC | 4 ms
4,380 KB |
testcase_65 | AC | 10 ms
4,380 KB |
testcase_66 | AC | 7 ms
4,384 KB |
testcase_67 | AC | 4 ms
4,380 KB |
testcase_68 | AC | 8 ms
4,384 KB |
testcase_69 | AC | 10 ms
4,380 KB |
testcase_70 | AC | 5 ms
4,384 KB |
testcase_71 | AC | 4 ms
4,380 KB |
testcase_72 | AC | 10 ms
4,380 KB |
testcase_73 | AC | 5 ms
4,384 KB |
testcase_74 | AC | 10 ms
4,384 KB |
testcase_75 | AC | 8 ms
4,380 KB |
testcase_76 | AC | 3 ms
4,380 KB |
testcase_77 | AC | 7 ms
4,380 KB |
testcase_78 | AC | 12 ms
4,384 KB |
testcase_79 | AC | 13 ms
4,380 KB |
testcase_80 | AC | 11 ms
4,384 KB |
testcase_81 | AC | 12 ms
4,384 KB |
testcase_82 | AC | 11 ms
4,380 KB |
testcase_83 | AC | 121 ms
10,828 KB |
testcase_84 | AC | 116 ms
10,392 KB |
testcase_85 | AC | 72 ms
10,048 KB |
testcase_86 | AC | 101 ms
9,292 KB |
testcase_87 | AC | 108 ms
11,584 KB |
testcase_88 | AC | 18 ms
4,384 KB |
testcase_89 | AC | 118 ms
11,900 KB |
testcase_90 | AC | 76 ms
9,748 KB |
testcase_91 | AC | 60 ms
8,024 KB |
testcase_92 | AC | 33 ms
6,708 KB |
testcase_93 | AC | 96 ms
9,816 KB |
testcase_94 | AC | 85 ms
10,680 KB |
testcase_95 | AC | 85 ms
10,612 KB |
testcase_96 | AC | 111 ms
11,592 KB |
testcase_97 | AC | 51 ms
7,512 KB |
testcase_98 | AC | 112 ms
10,812 KB |
testcase_99 | AC | 68 ms
9,484 KB |
testcase_100 | AC | 122 ms
10,864 KB |
testcase_101 | AC | 29 ms
4,404 KB |
testcase_102 | AC | 15 ms
4,384 KB |
testcase_103 | AC | 32 ms
4,920 KB |
testcase_104 | AC | 44 ms
7,248 KB |
testcase_105 | AC | 94 ms
10,052 KB |
testcase_106 | AC | 56 ms
7,468 KB |
testcase_107 | AC | 119 ms
10,912 KB |
testcase_108 | AC | 116 ms
12,332 KB |
testcase_109 | AC | 95 ms
11,332 KB |
testcase_110 | AC | 86 ms
10,132 KB |
testcase_111 | AC | 89 ms
9,820 KB |
testcase_112 | AC | 42 ms
6,972 KB |
testcase_113 | AC | 81 ms
9,264 KB |
testcase_114 | AC | 54 ms
7,488 KB |
testcase_115 | AC | 20 ms
4,380 KB |
testcase_116 | AC | 62 ms
8,036 KB |
testcase_117 | AC | 42 ms
7,224 KB |
testcase_118 | AC | 110 ms
10,084 KB |
testcase_119 | AC | 68 ms
8,300 KB |
testcase_120 | AC | 109 ms
11,388 KB |
testcase_121 | AC | 36 ms
5,240 KB |
testcase_122 | AC | 60 ms
7,972 KB |
testcase_123 | AC | 1 ms
4,380 KB |
testcase_124 | AC | 154 ms
7,756 KB |
testcase_125 | AC | 154 ms
7,728 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; } real readReal() { return readToken.to!real; } 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(); auto A = new int[N]; auto B = new int[N]; foreach (i; 0 .. N) { A[i] = readInt() - 1; B[i] = readInt() - 1; } auto G = new int[][N]; foreach (i; 0 .. N) { G[A[i]] ~= i; G[B[i]] ~= i; } auto delVertex = new bool[N]; auto delEdge = new bool[N]; auto deg = new int[N]; foreach (i; 0 .. N) { ++deg[A[i]]; ++deg[B[i]]; } DList!int que; foreach (u; 0 .. N) { if (deg[u] == 1) { que ~= u; } } for (; !que.empty; ) { const u = que.front; que.removeFront; delVertex[u] = true; foreach (i; G[u]) { if (!delEdge[i]) { delEdge[i] = true; if (--deg[A[i]] == 1) que ~= A[i]; if (--deg[B[i]] == 1) que ~= B[i]; } } } int[] ans; foreach (i; 0 .. N) { if (!delEdge[i]) { ans ~= i; } } writeln(ans.length); foreach (index, i; ans) { if (index > 0) write(" "); write(i + 1); } writeln; } } catch (EOFException e) { } }