結果
問題 | No.2822 Lights Up! (Tree Edition) |
ユーザー | risujiroh |
提出日時 | 2024-07-26 22:51:59 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 41 ms / 2,000 ms |
コード長 | 970 bytes |
コンパイル時間 | 3,195 ms |
コンパイル使用メモリ | 258,708 KB |
実行使用メモリ | 8,960 KB |
最終ジャッジ日時 | 2024-07-26 22:52:09 |
合計ジャッジ時間 | 7,612 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,812 KB |
testcase_02 | AC | 40 ms
8,832 KB |
testcase_03 | AC | 40 ms
8,832 KB |
testcase_04 | AC | 40 ms
8,960 KB |
testcase_05 | AC | 40 ms
8,868 KB |
testcase_06 | AC | 41 ms
8,832 KB |
testcase_07 | AC | 41 ms
8,832 KB |
testcase_08 | AC | 24 ms
6,948 KB |
testcase_09 | AC | 37 ms
8,448 KB |
testcase_10 | AC | 40 ms
6,940 KB |
testcase_11 | AC | 23 ms
6,944 KB |
testcase_12 | AC | 27 ms
6,940 KB |
testcase_13 | AC | 19 ms
6,940 KB |
testcase_14 | AC | 25 ms
6,944 KB |
testcase_15 | AC | 28 ms
6,944 KB |
testcase_16 | AC | 3 ms
6,944 KB |
testcase_17 | AC | 3 ms
6,940 KB |
testcase_18 | AC | 5 ms
6,944 KB |
testcase_19 | AC | 3 ms
6,940 KB |
testcase_20 | AC | 4 ms
6,940 KB |
testcase_21 | AC | 5 ms
6,944 KB |
testcase_22 | AC | 5 ms
6,944 KB |
testcase_23 | AC | 5 ms
6,940 KB |
testcase_24 | AC | 4 ms
6,940 KB |
testcase_25 | AC | 3 ms
6,940 KB |
testcase_26 | AC | 4 ms
6,944 KB |
testcase_27 | AC | 2 ms
6,940 KB |
testcase_28 | AC | 4 ms
6,944 KB |
testcase_29 | AC | 6 ms
6,940 KB |
testcase_30 | AC | 4 ms
6,944 KB |
testcase_31 | AC | 4 ms
6,940 KB |
testcase_32 | AC | 6 ms
6,940 KB |
testcase_33 | AC | 5 ms
6,940 KB |
testcase_34 | AC | 6 ms
6,940 KB |
testcase_35 | AC | 5 ms
6,944 KB |
testcase_36 | AC | 6 ms
6,944 KB |
testcase_37 | AC | 6 ms
6,940 KB |
testcase_38 | AC | 5 ms
6,944 KB |
testcase_39 | AC | 6 ms
6,940 KB |
testcase_40 | AC | 6 ms
6,944 KB |
testcase_41 | AC | 6 ms
6,940 KB |
testcase_42 | AC | 5 ms
6,944 KB |
testcase_43 | AC | 5 ms
6,940 KB |
testcase_44 | AC | 6 ms
6,944 KB |
testcase_45 | AC | 6 ms
6,944 KB |
testcase_46 | AC | 6 ms
6,944 KB |
testcase_47 | AC | 5 ms
6,944 KB |
testcase_48 | AC | 2 ms
6,940 KB |
testcase_49 | AC | 3 ms
6,944 KB |
testcase_50 | AC | 3 ms
6,940 KB |
testcase_51 | AC | 2 ms
6,940 KB |
testcase_52 | AC | 2 ms
6,944 KB |
testcase_53 | AC | 3 ms
6,940 KB |
testcase_54 | AC | 2 ms
6,944 KB |
testcase_55 | AC | 2 ms
6,944 KB |
testcase_56 | AC | 2 ms
6,944 KB |
testcase_57 | AC | 3 ms
6,940 KB |
testcase_58 | AC | 3 ms
6,944 KB |
testcase_59 | AC | 2 ms
6,940 KB |
testcase_60 | AC | 2 ms
6,940 KB |
testcase_61 | AC | 2 ms
6,944 KB |
testcase_62 | AC | 2 ms
6,944 KB |
testcase_63 | AC | 3 ms
6,940 KB |
testcase_64 | AC | 3 ms
6,940 KB |
testcase_65 | AC | 3 ms
6,940 KB |
testcase_66 | AC | 2 ms
6,940 KB |
testcase_67 | AC | 2 ms
6,944 KB |
testcase_68 | AC | 3 ms
6,940 KB |
testcase_69 | AC | 2 ms
6,944 KB |
testcase_70 | AC | 3 ms
6,940 KB |
testcase_71 | AC | 2 ms
6,940 KB |
testcase_72 | AC | 2 ms
6,940 KB |
testcase_73 | AC | 2 ms
6,940 KB |
testcase_74 | AC | 2 ms
6,944 KB |
testcase_75 | AC | 2 ms
6,940 KB |
testcase_76 | AC | 3 ms
6,940 KB |
testcase_77 | AC | 3 ms
6,944 KB |
testcase_78 | AC | 3 ms
6,940 KB |
testcase_79 | AC | 2 ms
6,944 KB |
testcase_80 | AC | 2 ms
6,944 KB |
testcase_81 | AC | 2 ms
6,944 KB |
testcase_82 | AC | 2 ms
6,944 KB |
testcase_83 | AC | 2 ms
6,944 KB |
testcase_84 | AC | 2 ms
6,940 KB |
testcase_85 | AC | 2 ms
6,940 KB |
testcase_86 | AC | 2 ms
6,944 KB |
testcase_87 | AC | 2 ms
6,940 KB |
testcase_88 | AC | 2 ms
6,940 KB |
testcase_89 | AC | 2 ms
6,944 KB |
testcase_90 | AC | 2 ms
6,940 KB |
testcase_91 | AC | 2 ms
6,944 KB |
testcase_92 | AC | 2 ms
6,944 KB |
testcase_93 | AC | 2 ms
6,944 KB |
testcase_94 | AC | 2 ms
6,940 KB |
testcase_95 | AC | 2 ms
6,940 KB |
testcase_96 | AC | 2 ms
6,940 KB |
testcase_97 | AC | 2 ms
6,940 KB |
testcase_98 | AC | 2 ms
6,940 KB |
testcase_99 | AC | 2 ms
6,940 KB |
testcase_100 | AC | 2 ms
6,940 KB |
testcase_101 | AC | 2 ms
6,940 KB |
testcase_102 | AC | 2 ms
6,944 KB |
testcase_103 | AC | 2 ms
6,940 KB |
testcase_104 | AC | 2 ms
6,940 KB |
testcase_105 | AC | 2 ms
6,944 KB |
testcase_106 | AC | 2 ms
6,940 KB |
testcase_107 | AC | 2 ms
6,940 KB |
testcase_108 | AC | 2 ms
6,940 KB |
testcase_109 | AC | 2 ms
6,940 KB |
testcase_110 | AC | 2 ms
6,940 KB |
testcase_111 | AC | 2 ms
6,944 KB |
testcase_112 | AC | 2 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 | 2 ms
6,940 KB |
testcase_117 | AC | 2 ms
6,940 KB |
testcase_118 | AC | 2 ms
6,940 KB |
testcase_119 | AC | 2 ms
6,944 KB |
testcase_120 | AC | 2 ms
6,940 KB |
testcase_121 | AC | 2 ms
6,940 KB |
testcase_122 | AC | 2 ms
6,944 KB |
testcase_123 | AC | 2 ms
6,944 KB |
testcase_124 | AC | 2 ms
6,944 KB |
testcase_125 | AC | 2 ms
6,944 KB |
testcase_126 | AC | 3 ms
6,940 KB |
testcase_127 | AC | 3 ms
6,944 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 | 2 ms
6,940 KB |
testcase_132 | AC | 3 ms
6,944 KB |
testcase_133 | AC | 2 ms
6,940 KB |
testcase_134 | AC | 2 ms
6,940 KB |
testcase_135 | AC | 2 ms
6,944 KB |
testcase_136 | AC | 2 ms
6,940 KB |
testcase_137 | AC | 2 ms
6,940 KB |
testcase_138 | AC | 2 ms
6,944 KB |
testcase_139 | AC | 2 ms
6,944 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 |
ソースコード
#include <bits/stdc++.h> #include <atcoder/dsu> using namespace std; void Solve() { int n; cin >> n; vector<int> p(n, -1); vector<vector<int>> C(n); for (int i = 1; i < n; ++i) { cin >> p[i]; --p[i]; C[p[i]].push_back(i); } string s(n, '?'); for (int i = 1; i < n; ++i) { cin >> s[i]; } vector<int> f(n); for (int i = n; 1 < i--;) { if (s[i] == '#') { f[i] ^= 1; f[p[i]] ^= 1; } } atcoder::dsu d(n); int k; cin >> k; while (k--) { int i, j; cin >> i >> j; --i, --j; if (d.same(i, j)) { continue; } i = d.leader(i); j = d.leader(j); f[d.merge(i, j)] = f[i] ^ f[j]; } for (int i = 0; i < n; ++i) { if (d.leader(i) != i) { continue; } if (d.same(0, i)) { continue; } if (f[i]) { cout << "No\n"; return; } } cout << "Yes\n"; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); Solve(); }