結果
問題 | No.2822 Lights Up! (Tree Edition) |
ユーザー |
👑 |
提出日時 | 2024-07-27 02:06:12 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 73 ms / 2,000 ms |
コード長 | 2,203 bytes |
コンパイル時間 | 1,010 ms |
コンパイル使用メモリ | 118,740 KB |
実行使用メモリ | 7,044 KB |
最終ジャッジ日時 | 2024-07-27 02:06:19 |
合計ジャッジ時間 | 6,124 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,940 KB |
testcase_02 | AC | 70 ms
6,944 KB |
testcase_03 | AC | 70 ms
6,968 KB |
testcase_04 | AC | 68 ms
6,944 KB |
testcase_05 | AC | 70 ms
7,044 KB |
testcase_06 | AC | 69 ms
6,944 KB |
testcase_07 | AC | 73 ms
6,944 KB |
testcase_08 | AC | 53 ms
6,940 KB |
testcase_09 | AC | 61 ms
6,944 KB |
testcase_10 | AC | 56 ms
6,944 KB |
testcase_11 | AC | 36 ms
6,940 KB |
testcase_12 | AC | 58 ms
6,940 KB |
testcase_13 | AC | 43 ms
6,944 KB |
testcase_14 | AC | 42 ms
6,944 KB |
testcase_15 | AC | 55 ms
6,940 KB |
testcase_16 | AC | 3 ms
6,940 KB |
testcase_17 | AC | 3 ms
6,940 KB |
testcase_18 | AC | 8 ms
6,944 KB |
testcase_19 | AC | 2 ms
6,940 KB |
testcase_20 | AC | 5 ms
6,940 KB |
testcase_21 | AC | 7 ms
6,940 KB |
testcase_22 | AC | 5 ms
6,940 KB |
testcase_23 | AC | 7 ms
6,944 KB |
testcase_24 | AC | 4 ms
6,940 KB |
testcase_25 | AC | 2 ms
6,944 KB |
testcase_26 | AC | 6 ms
6,940 KB |
testcase_27 | AC | 2 ms
6,944 KB |
testcase_28 | AC | 4 ms
6,940 KB |
testcase_29 | AC | 8 ms
6,940 KB |
testcase_30 | AC | 6 ms
6,940 KB |
testcase_31 | AC | 5 ms
6,944 KB |
testcase_32 | AC | 9 ms
6,940 KB |
testcase_33 | AC | 9 ms
6,940 KB |
testcase_34 | AC | 8 ms
6,940 KB |
testcase_35 | AC | 9 ms
6,940 KB |
testcase_36 | AC | 9 ms
6,940 KB |
testcase_37 | AC | 8 ms
6,940 KB |
testcase_38 | AC | 8 ms
6,940 KB |
testcase_39 | AC | 8 ms
6,940 KB |
testcase_40 | AC | 9 ms
6,944 KB |
testcase_41 | AC | 9 ms
6,944 KB |
testcase_42 | AC | 9 ms
6,944 KB |
testcase_43 | AC | 9 ms
6,944 KB |
testcase_44 | AC | 8 ms
6,944 KB |
testcase_45 | AC | 8 ms
6,940 KB |
testcase_46 | AC | 8 ms
6,944 KB |
testcase_47 | AC | 9 ms
6,940 KB |
testcase_48 | AC | 2 ms
6,940 KB |
testcase_49 | AC | 2 ms
6,944 KB |
testcase_50 | AC | 2 ms
6,940 KB |
testcase_51 | AC | 2 ms
6,944 KB |
testcase_52 | AC | 2 ms
6,944 KB |
testcase_53 | AC | 2 ms
6,940 KB |
testcase_54 | AC | 2 ms
6,940 KB |
testcase_55 | AC | 2 ms
6,944 KB |
testcase_56 | AC | 2 ms
6,940 KB |
testcase_57 | AC | 2 ms
6,944 KB |
testcase_58 | AC | 2 ms
6,940 KB |
testcase_59 | AC | 2 ms
6,940 KB |
testcase_60 | AC | 2 ms
6,944 KB |
testcase_61 | AC | 2 ms
6,944 KB |
testcase_62 | AC | 2 ms
6,944 KB |
testcase_63 | AC | 2 ms
6,940 KB |
testcase_64 | AC | 2 ms
6,940 KB |
testcase_65 | AC | 2 ms
6,940 KB |
testcase_66 | AC | 2 ms
6,940 KB |
testcase_67 | AC | 2 ms
6,944 KB |
testcase_68 | AC | 2 ms
6,940 KB |
testcase_69 | AC | 2 ms
6,944 KB |
testcase_70 | AC | 3 ms
6,944 KB |
testcase_71 | AC | 2 ms
6,940 KB |
testcase_72 | AC | 2 ms
6,944 KB |
testcase_73 | AC | 2 ms
6,940 KB |
testcase_74 | AC | 2 ms
6,944 KB |
testcase_75 | AC | 2 ms
6,944 KB |
testcase_76 | AC | 2 ms
6,940 KB |
testcase_77 | AC | 2 ms
6,940 KB |
testcase_78 | AC | 2 ms
6,940 KB |
testcase_79 | AC | 2 ms
6,944 KB |
testcase_80 | AC | 1 ms
6,944 KB |
testcase_81 | AC | 1 ms
6,940 KB |
testcase_82 | AC | 1 ms
6,944 KB |
testcase_83 | AC | 1 ms
6,944 KB |
testcase_84 | AC | 1 ms
6,944 KB |
testcase_85 | AC | 1 ms
6,940 KB |
testcase_86 | AC | 1 ms
6,940 KB |
testcase_87 | AC | 1 ms
6,944 KB |
testcase_88 | AC | 1 ms
6,944 KB |
testcase_89 | AC | 1 ms
6,940 KB |
testcase_90 | AC | 1 ms
6,944 KB |
testcase_91 | AC | 1 ms
6,944 KB |
testcase_92 | AC | 1 ms
6,940 KB |
testcase_93 | AC | 1 ms
6,940 KB |
testcase_94 | AC | 2 ms
6,948 KB |
testcase_95 | AC | 1 ms
6,940 KB |
testcase_96 | AC | 1 ms
6,944 KB |
testcase_97 | AC | 1 ms
6,944 KB |
testcase_98 | AC | 1 ms
6,944 KB |
testcase_99 | AC | 1 ms
6,940 KB |
testcase_100 | AC | 1 ms
6,940 KB |
testcase_101 | AC | 1 ms
6,940 KB |
testcase_102 | AC | 2 ms
6,944 KB |
testcase_103 | AC | 1 ms
6,940 KB |
testcase_104 | AC | 1 ms
6,940 KB |
testcase_105 | AC | 1 ms
6,944 KB |
testcase_106 | AC | 1 ms
6,944 KB |
testcase_107 | AC | 1 ms
6,940 KB |
testcase_108 | AC | 1 ms
6,944 KB |
testcase_109 | AC | 1 ms
6,940 KB |
testcase_110 | AC | 1 ms
6,940 KB |
testcase_111 | AC | 1 ms
6,944 KB |
testcase_112 | AC | 1 ms
6,940 KB |
testcase_113 | AC | 2 ms
6,940 KB |
testcase_114 | AC | 2 ms
6,944 KB |
testcase_115 | AC | 2 ms
6,940 KB |
testcase_116 | AC | 1 ms
6,940 KB |
testcase_117 | AC | 2 ms
6,940 KB |
testcase_118 | AC | 2 ms
6,944 KB |
testcase_119 | AC | 1 ms
6,944 KB |
testcase_120 | AC | 2 ms
6,940 KB |
testcase_121 | AC | 1 ms
6,940 KB |
testcase_122 | AC | 1 ms
6,940 KB |
testcase_123 | AC | 1 ms
6,944 KB |
testcase_124 | AC | 2 ms
6,944 KB |
testcase_125 | AC | 2 ms
6,944 KB |
testcase_126 | AC | 2 ms
6,944 KB |
testcase_127 | AC | 2 ms
6,940 KB |
testcase_128 | AC | 2 ms
6,940 KB |
testcase_129 | AC | 2 ms
6,944 KB |
testcase_130 | AC | 2 ms
6,944 KB |
testcase_131 | AC | 1 ms
6,940 KB |
testcase_132 | AC | 2 ms
6,940 KB |
testcase_133 | AC | 1 ms
6,940 KB |
testcase_134 | AC | 2 ms
6,940 KB |
testcase_135 | AC | 1 ms
6,940 KB |
testcase_136 | AC | 2 ms
6,944 KB |
testcase_137 | AC | 1 ms
6,940 KB |
testcase_138 | AC | 2 ms
6,944 KB |
testcase_139 | AC | 2 ms
6,940 KB |
testcase_140 | AC | 2 ms
6,940 KB |
testcase_141 | AC | 2 ms
6,944 KB |
testcase_142 | AC | 2 ms
6,944 KB |
testcase_143 | AC | 2 ms
6,944 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)); } int root(int[] uf, int u) { return (uf[u] < 0) ? u : (uf[u] = uf.root(uf[u])); } bool connect(int[] uf, int u, int v) { u = uf.root(u); v = uf.root(v); if (u == v) return false; if (uf[u] > uf[v]) swap(u, v); uf[u] += uf[v]; uf[v] = u; return true; } void main() { try { for (; ; ) { const N = readInt; auto P = new int[N]; P[0] = -1; foreach (u; 1 .. N) { P[u] = readInt - 1; } const S = "." ~ readToken; const K = readInt; auto U = new int[K]; auto V = new int[K]; foreach (k; 0 .. K) { U[k] = readInt - 1; V[k] = readInt - 1; } auto uf = new int[N]; uf[] = -1; foreach (k; 0 .. K) { uf.connect(U[k], V[k]); } auto fs = new int[N]; foreach (u; 1 .. N) if (S[u] == '#') { fs[uf.root(P[u])] ^= 1; fs[uf.root(u)] ^= 1; } const ans = fs.all!"a == 0"; writeln(ans ? "Yes" : "No"); } } catch (EOFException e) { } }