結果
問題 | No.2822 Lights Up! (Tree Edition) |
ユーザー |
![]() |
提出日時 | 2024-07-26 22:29:16 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 51 ms / 2,000 ms |
コード長 | 6,906 bytes |
コンパイル時間 | 2,467 ms |
コンパイル使用メモリ | 212,704 KB |
実行使用メモリ | 15,872 KB |
最終ジャッジ日時 | 2024-07-26 22:29:26 |
合計ジャッジ時間 | 6,868 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 49 ms
15,744 KB |
testcase_03 | AC | 49 ms
15,744 KB |
testcase_04 | AC | 49 ms
15,692 KB |
testcase_05 | AC | 49 ms
15,652 KB |
testcase_06 | AC | 50 ms
15,744 KB |
testcase_07 | AC | 51 ms
15,872 KB |
testcase_08 | AC | 27 ms
7,552 KB |
testcase_09 | AC | 46 ms
15,080 KB |
testcase_10 | AC | 37 ms
11,264 KB |
testcase_11 | AC | 28 ms
10,496 KB |
testcase_12 | AC | 30 ms
8,320 KB |
testcase_13 | AC | 20 ms
6,944 KB |
testcase_14 | AC | 28 ms
8,960 KB |
testcase_15 | AC | 32 ms
9,728 KB |
testcase_16 | AC | 3 ms
6,940 KB |
testcase_17 | AC | 4 ms
6,940 KB |
testcase_18 | AC | 6 ms
6,940 KB |
testcase_19 | AC | 4 ms
6,944 KB |
testcase_20 | AC | 4 ms
6,940 KB |
testcase_21 | AC | 6 ms
6,940 KB |
testcase_22 | AC | 5 ms
6,940 KB |
testcase_23 | AC | 5 ms
6,940 KB |
testcase_24 | AC | 5 ms
6,944 KB |
testcase_25 | AC | 3 ms
6,944 KB |
testcase_26 | AC | 5 ms
6,940 KB |
testcase_27 | AC | 2 ms
6,944 KB |
testcase_28 | AC | 5 ms
6,944 KB |
testcase_29 | AC | 6 ms
6,940 KB |
testcase_30 | AC | 5 ms
6,944 KB |
testcase_31 | AC | 3 ms
6,944 KB |
testcase_32 | AC | 6 ms
6,944 KB |
testcase_33 | AC | 6 ms
6,944 KB |
testcase_34 | AC | 7 ms
6,944 KB |
testcase_35 | AC | 7 ms
6,940 KB |
testcase_36 | AC | 7 ms
6,940 KB |
testcase_37 | AC | 6 ms
6,940 KB |
testcase_38 | AC | 7 ms
6,940 KB |
testcase_39 | AC | 7 ms
6,940 KB |
testcase_40 | AC | 7 ms
6,940 KB |
testcase_41 | AC | 6 ms
6,944 KB |
testcase_42 | AC | 7 ms
6,940 KB |
testcase_43 | AC | 6 ms
6,944 KB |
testcase_44 | AC | 6 ms
6,944 KB |
testcase_45 | AC | 6 ms
6,944 KB |
testcase_46 | AC | 7 ms
6,940 KB |
testcase_47 | AC | 7 ms
6,944 KB |
testcase_48 | AC | 2 ms
6,944 KB |
testcase_49 | AC | 2 ms
6,940 KB |
testcase_50 | AC | 2 ms
6,944 KB |
testcase_51 | AC | 2 ms
6,948 KB |
testcase_52 | AC | 2 ms
6,940 KB |
testcase_53 | AC | 2 ms
6,940 KB |
testcase_54 | AC | 2 ms
6,948 KB |
testcase_55 | AC | 2 ms
6,944 KB |
testcase_56 | AC | 2 ms
6,940 KB |
testcase_57 | AC | 3 ms
6,944 KB |
testcase_58 | AC | 2 ms
6,944 KB |
testcase_59 | AC | 2 ms
6,940 KB |
testcase_60 | AC | 2 ms
6,940 KB |
testcase_61 | AC | 3 ms
6,944 KB |
testcase_62 | AC | 2 ms
6,944 KB |
testcase_63 | AC | 3 ms
6,940 KB |
testcase_64 | AC | 2 ms
6,940 KB |
testcase_65 | AC | 2 ms
6,940 KB |
testcase_66 | AC | 3 ms
6,944 KB |
testcase_67 | AC | 2 ms
6,940 KB |
testcase_68 | AC | 2 ms
6,944 KB |
testcase_69 | AC | 2 ms
6,940 KB |
testcase_70 | AC | 2 ms
6,944 KB |
testcase_71 | AC | 3 ms
6,940 KB |
testcase_72 | AC | 2 ms
6,940 KB |
testcase_73 | AC | 2 ms
6,944 KB |
testcase_74 | AC | 2 ms
6,940 KB |
testcase_75 | AC | 2 ms
6,940 KB |
testcase_76 | AC | 2 ms
6,944 KB |
testcase_77 | AC | 3 ms
6,940 KB |
testcase_78 | AC | 2 ms
6,940 KB |
testcase_79 | AC | 3 ms
6,940 KB |
testcase_80 | AC | 2 ms
6,940 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,944 KB |
testcase_86 | AC | 2 ms
6,940 KB |
testcase_87 | AC | 2 ms
6,940 KB |
testcase_88 | AC | 2 ms
6,944 KB |
testcase_89 | AC | 2 ms
6,944 KB |
testcase_90 | AC | 1 ms
6,940 KB |
testcase_91 | AC | 2 ms
6,940 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,944 KB |
testcase_98 | AC | 2 ms
6,944 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,940 KB |
testcase_103 | AC | 2 ms
6,944 KB |
testcase_104 | AC | 2 ms
6,948 KB |
testcase_105 | AC | 2 ms
6,944 KB |
testcase_106 | AC | 2 ms
6,940 KB |
testcase_107 | AC | 2 ms
6,944 KB |
testcase_108 | AC | 2 ms
6,940 KB |
testcase_109 | AC | 2 ms
6,944 KB |
testcase_110 | AC | 2 ms
6,944 KB |
testcase_111 | AC | 2 ms
6,940 KB |
testcase_112 | AC | 2 ms
6,944 KB |
testcase_113 | AC | 2 ms
6,940 KB |
testcase_114 | AC | 2 ms
6,940 KB |
testcase_115 | AC | 2 ms
6,940 KB |
testcase_116 | AC | 2 ms
6,944 KB |
testcase_117 | AC | 2 ms
6,940 KB |
testcase_118 | AC | 2 ms
6,940 KB |
testcase_119 | AC | 2 ms
6,940 KB |
testcase_120 | AC | 2 ms
6,944 KB |
testcase_121 | AC | 2 ms
6,940 KB |
testcase_122 | AC | 2 ms
6,944 KB |
testcase_123 | AC | 3 ms
6,940 KB |
testcase_124 | AC | 2 ms
6,940 KB |
testcase_125 | AC | 2 ms
6,940 KB |
testcase_126 | AC | 3 ms
6,940 KB |
testcase_127 | AC | 2 ms
6,940 KB |
testcase_128 | AC | 2 ms
6,944 KB |
testcase_129 | AC | 2 ms
6,944 KB |
testcase_130 | AC | 2 ms
6,940 KB |
testcase_131 | AC | 2 ms
6,944 KB |
testcase_132 | AC | 2 ms
6,940 KB |
testcase_133 | AC | 2 ms
6,940 KB |
testcase_134 | AC | 2 ms
6,940 KB |
testcase_135 | AC | 2 ms
6,940 KB |
testcase_136 | AC | 2 ms
6,944 KB |
testcase_137 | AC | 2 ms
6,940 KB |
testcase_138 | AC | 2 ms
6,940 KB |
testcase_139 | AC | 2 ms
6,944 KB |
testcase_140 | AC | 2 ms
6,940 KB |
testcase_141 | AC | 2 ms
6,940 KB |
testcase_142 | AC | 2 ms
6,940 KB |
testcase_143 | AC | 2 ms
6,940 KB |
ソースコード
#line 1 "main.cpp" #include<bits/stdc++.h> //#pragma GCC target("avx,avx2") //#pragma GCC optimize("O3") //#pragma GCC optimize("unroll-loops") #ifdef LOCAL #include <debug.hpp> #define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else #define debug(...) (static_cast<void>(0)) #endif using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; using pll = pair<ll,ll>; using pii = pair<int,int>; using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vul = vector<ull>; using vpii = vector<pii>; using vvpii = vector<vpii>; using vpll = vector<pll>; using vs = vector<string>; template<class T> using pq = priority_queue<T,vector<T>, greater<T>>; #define overload4(_1, _2, _3, _4, name, ...) name #define overload3(a,b,c,name,...) name #define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER) #define rep2(i, n) for (ll i = 0; i < (n); ++i) #define rep3(i, a, b) for (ll i = (a); i < (b); ++i) #define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep1(n) for(ll i = (n) - 1;i >= 0;i--) #define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--) #define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--) #define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c) #define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__) #define all1(i) begin(i) , end(i) #define all2(i,a) begin(i) , begin(i) + a #define all3(i,a,b) begin(i) + a , begin(i) + b #define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__) #define sum(...) accumulate(all(__VA_ARGS__),0LL) template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; } template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; } template<class T> auto min(const T& a){return *min_element(all(a));} template<class T> auto max(const T& a){return *max_element(all(a));} template<class... Ts> void in(Ts&... t); #define INT(...) int __VA_ARGS__; in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__; in(__VA_ARGS__) #define STR(...) string __VA_ARGS__; in(__VA_ARGS__) #define CHR(...) char __VA_ARGS__; in(__VA_ARGS__) #define DBL(...) double __VA_ARGS__; in(__VA_ARGS__) #define LD(...) ld __VA_ARGS__; in(__VA_ARGS__) #define VEC(type, name, size) vector<type> name(size); in(name) #define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name) ll intpow(ll a, ll b){ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;} ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; } bool is_clamp(ll val,ll low,ll high) {return low <= val && val < high;} void Yes() {cout << "Yes\n";return;} void No() {cout << "No\n";return;} void YES() {cout << "YES\n";return;} void NO() {cout << "NO\n";return;} template <typename T> T floor(T a, T b) {return a / b - (a % b && (a ^ b) < 0);} template <typename T> T ceil(T x, T y) {return floor(x + y - 1, y);} template <typename T> T bmod(T x, T y) {return x - y * floor(x, y);} template <typename T> pair<T, T> divmod(T x, T y) {T q = floor(x, y);return {q, x - q * y};} namespace IO{ #define VOID(a) decltype(void(a)) struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(15);}} setting; template<int I> struct P : P<I-1>{}; template<> struct P<0>{}; template<class T> void i(T& t){ i(t, P<3>{}); } void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; } template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; } template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); } template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);} template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});} #undef VOID } #define unpack(a) (void)initializer_list<int>{(a, 0)...} template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); } #undef unpack constexpr long double PI = 3.141592653589793238462643383279L; template <class F> struct REC { F f; REC(F &&f_) : f(forward<F>(f_)) {} template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }}; constexpr int mod = 998244353; //constexpr int mod = 1000000007; #line 2 "library/data-structure/unionfind.hpp" struct unionfind { public: unionfind() : _n(0) {} explicit unionfind(int n) : _n(n), parent_or_size(n, -1) {} int merge(int a, int b) { assert(0 <= a && a < _n); assert(0 <= b && b < _n); int x = find(a), y = find(b); if (x == y) return x; if (-parent_or_size[x] < -parent_or_size[y]) swap(x, y); parent_or_size[x] += parent_or_size[y]; parent_or_size[y] = x; return x; } bool same(int a, int b) { assert(0 <= a && a < _n); assert(0 <= b && b < _n); return find(a) == find(b); } int find(int a) { assert(0 <= a && a < _n); if (parent_or_size[a] < 0) return a; return parent_or_size[a] = find(parent_or_size[a]); } int size(int a) { assert(0 <= a && a < _n); return -parent_or_size[find(a)]; } vector<vector<int>> groups() { vector<int> leader_buf(_n), group_size(_n); for (int i = 0; i < _n; i++) { leader_buf[i] = find(i); group_size[leader_buf[i]]++; } vector<vector<int>> result(_n); for (int i = 0; i < _n; i++) { result[i].reserve(group_size[i]); } for (int i = 0; i < _n; i++) { result[leader_buf[i]].push_back(i); } result.erase( remove_if(result.begin(), result.end(), [&](const vector<int>& v) { return v.empty(); }), result.end()); return result; } private: int _n; // root node: -1 * component size // otherwise: parent vector<int> parent_or_size; }; #line 99 "main.cpp" int main() { INT(n); vvi g(n); vi P(n-1); rep(i,1,n) { INT(p); g[p-1].emplace_back(i); P[i-1] = p-1; } STR(s); vi xo(n); rep(i,n-1) { if(s[i] == '#') { xo[i+1] ^= 1; xo[P[i]] ^= 1; } } INT(k); vi u(k),v(k); unionfind uf(n); rep(i,k) { cin >> u[i] >> v[i]; u[i]--,v[i]--; uf.merge(u[i],v[i]); } auto gs = uf.groups(); rep(i,gs.size()) { int su = 0; rep(j,gs[i].size()) { su += xo[gs[i][j]]; } if(su % 2) { No(); return 0; } } Yes(); }