結果
問題 | No.2822 Lights Up! (Tree Edition) |
ユーザー |
![]() |
提出日時 | 2024-07-27 05:02:54 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,494 bytes |
コンパイル時間 | 5,479 ms |
コンパイル使用メモリ | 318,760 KB |
実行使用メモリ | 12,416 KB |
最終ジャッジ日時 | 2024-07-27 05:03:07 |
合計ジャッジ時間 | 11,114 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 1 ms
6,940 KB |
testcase_02 | AC | 110 ms
12,416 KB |
testcase_03 | AC | 110 ms
12,416 KB |
testcase_04 | AC | 106 ms
12,288 KB |
testcase_05 | AC | 106 ms
12,288 KB |
testcase_06 | AC | 110 ms
12,416 KB |
testcase_07 | AC | 108 ms
12,416 KB |
testcase_08 | AC | 66 ms
6,940 KB |
testcase_09 | AC | 103 ms
11,904 KB |
testcase_10 | WA | - |
testcase_11 | AC | 65 ms
8,576 KB |
testcase_12 | AC | 68 ms
6,940 KB |
testcase_13 | AC | 45 ms
6,944 KB |
testcase_14 | AC | 55 ms
6,944 KB |
testcase_15 | AC | 73 ms
7,808 KB |
testcase_16 | AC | 4 ms
6,944 KB |
testcase_17 | AC | 5 ms
6,944 KB |
testcase_18 | AC | 10 ms
6,944 KB |
testcase_19 | AC | 5 ms
6,944 KB |
testcase_20 | AC | 5 ms
6,940 KB |
testcase_21 | AC | 9 ms
6,940 KB |
testcase_22 | AC | 8 ms
6,944 KB |
testcase_23 | AC | 9 ms
6,940 KB |
testcase_24 | AC | 7 ms
6,944 KB |
testcase_25 | AC | 4 ms
6,940 KB |
testcase_26 | AC | 8 ms
6,940 KB |
testcase_27 | AC | 3 ms
6,940 KB |
testcase_28 | AC | 7 ms
6,944 KB |
testcase_29 | AC | 10 ms
6,944 KB |
testcase_30 | AC | 8 ms
6,940 KB |
testcase_31 | AC | 5 ms
6,940 KB |
testcase_32 | AC | 11 ms
6,940 KB |
testcase_33 | AC | 11 ms
6,944 KB |
testcase_34 | AC | 11 ms
6,944 KB |
testcase_35 | AC | 10 ms
6,940 KB |
testcase_36 | AC | 10 ms
6,944 KB |
testcase_37 | AC | 11 ms
6,944 KB |
testcase_38 | AC | 11 ms
6,940 KB |
testcase_39 | AC | 10 ms
6,940 KB |
testcase_40 | AC | 11 ms
6,940 KB |
testcase_41 | AC | 10 ms
6,944 KB |
testcase_42 | AC | 11 ms
6,940 KB |
testcase_43 | AC | 10 ms
6,940 KB |
testcase_44 | AC | 11 ms
6,940 KB |
testcase_45 | AC | 10 ms
6,940 KB |
testcase_46 | AC | 10 ms
6,944 KB |
testcase_47 | AC | 11 ms
6,940 KB |
testcase_48 | AC | 2 ms
6,940 KB |
testcase_49 | AC | 2 ms
6,944 KB |
testcase_50 | WA | - |
testcase_51 | AC | 2 ms
6,944 KB |
testcase_52 | AC | 2 ms
6,940 KB |
testcase_53 | AC | 3 ms
6,940 KB |
testcase_54 | AC | 3 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,940 KB |
testcase_58 | AC | 3 ms
6,940 KB |
testcase_59 | AC | 2 ms
6,944 KB |
testcase_60 | AC | 3 ms
6,940 KB |
testcase_61 | AC | 3 ms
6,940 KB |
testcase_62 | AC | 2 ms
6,940 KB |
testcase_63 | AC | 3 ms
6,940 KB |
testcase_64 | AC | 3 ms
6,940 KB |
testcase_65 | AC | 3 ms
6,944 KB |
testcase_66 | AC | 3 ms
6,944 KB |
testcase_67 | AC | 2 ms
6,940 KB |
testcase_68 | AC | 3 ms
6,944 KB |
testcase_69 | AC | 3 ms
6,944 KB |
testcase_70 | AC | 2 ms
6,944 KB |
testcase_71 | AC | 2 ms
6,940 KB |
testcase_72 | AC | 2 ms
6,940 KB |
testcase_73 | AC | 3 ms
6,940 KB |
testcase_74 | AC | 3 ms
6,940 KB |
testcase_75 | AC | 3 ms
6,940 KB |
testcase_76 | WA | - |
testcase_77 | AC | 3 ms
6,944 KB |
testcase_78 | AC | 2 ms
6,944 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,940 KB |
testcase_83 | AC | 2 ms
6,944 KB |
testcase_84 | AC | 2 ms
6,944 KB |
testcase_85 | AC | 2 ms
6,944 KB |
testcase_86 | AC | 2 ms
6,944 KB |
testcase_87 | WA | - |
testcase_88 | AC | 2 ms
6,940 KB |
testcase_89 | AC | 2 ms
6,940 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 | 1 ms
6,940 KB |
testcase_94 | AC | 2 ms
6,944 KB |
testcase_95 | AC | 2 ms
6,944 KB |
testcase_96 | AC | 1 ms
6,940 KB |
testcase_97 | AC | 2 ms
6,944 KB |
testcase_98 | AC | 2 ms
6,940 KB |
testcase_99 | AC | 2 ms
6,940 KB |
testcase_100 | WA | - |
testcase_101 | AC | 2 ms
6,944 KB |
testcase_102 | AC | 2 ms
6,940 KB |
testcase_103 | AC | 1 ms
6,940 KB |
testcase_104 | AC | 2 ms
6,940 KB |
testcase_105 | WA | - |
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,944 KB |
testcase_110 | AC | 2 ms
6,944 KB |
testcase_111 | WA | - |
testcase_112 | AC | 2 ms
6,940 KB |
testcase_113 | AC | 2 ms
6,940 KB |
testcase_114 | AC | 2 ms
6,940 KB |
testcase_115 | AC | 3 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,944 KB |
testcase_120 | AC | 2 ms
6,944 KB |
testcase_121 | WA | - |
testcase_122 | AC | 3 ms
6,940 KB |
testcase_123 | AC | 2 ms
6,940 KB |
testcase_124 | AC | 2 ms
6,944 KB |
testcase_125 | AC | 2 ms
6,940 KB |
testcase_126 | AC | 2 ms
6,944 KB |
testcase_127 | AC | 2 ms
6,940 KB |
testcase_128 | AC | 2 ms
6,944 KB |
testcase_129 | WA | - |
testcase_130 | AC | 2 ms
6,944 KB |
testcase_131 | WA | - |
testcase_132 | AC | 2 ms
6,940 KB |
testcase_133 | AC | 2 ms
6,944 KB |
testcase_134 | AC | 2 ms
6,944 KB |
testcase_135 | AC | 2 ms
6,944 KB |
testcase_136 | AC | 2 ms
6,944 KB |
testcase_137 | AC | 2 ms
6,944 KB |
testcase_138 | AC | 2 ms
6,940 KB |
testcase_139 | AC | 2 ms
6,940 KB |
testcase_140 | AC | 3 ms
6,944 KB |
testcase_141 | AC | 3 ms
6,944 KB |
testcase_142 | AC | 2 ms
6,940 KB |
testcase_143 | WA | - |
ソースコード
#include <bits/stdc++.h> using namespace std; #include <atcoder/all> using namespace atcoder; template<typename T> inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); } template<typename T> inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); } #define rep(i, n) for (long long i = 0; i < (long long)(n); i++) #define rep2(i, m ,n) for (int i = (m); i < (long long)(n); i++) #define REP(i, n) for (long long i = 1; i < (long long)(n); i++) typedef long long ll; #define updiv(N,X) (N + X - 1) / X #define l(n) n.begin(),n.end() #define YesNo(Q) Q==1?cout<<"Yes":cout<<"No" using P = pair<int, int>; using mint = modint; const int MOD = 998244353LL; const ll INF = 999999999999LL; vector<long long> fact, fact_inv, inv; /* init_nCk :二項係数のための前処理 計算量:O(n) */ template <typename T> void input(vector<T> &v){ rep(i,v.size()){cin>>v[i];} return; } void init_nCk(int SIZE) { fact.resize(SIZE + 5); fact_inv.resize(SIZE + 5); inv.resize(SIZE + 5); fact[0] = fact[1] = 1; fact_inv[0] = fact_inv[1] = 1; inv[1] = 1; for (int i = 2; i < SIZE + 5; i++) { fact[i] = fact[i - 1] * i % MOD; inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD; fact_inv[i] = fact_inv[i - 1] * inv[i] % MOD; } } /* nCk :MODでの二項係数を求める(前処理 int_nCk が必要) 計算量:O(1) */ long long nCk(int n, int k) { assert(!(n < k)); assert(!(n < 0 || k < 0)); return fact[n] * (fact_inv[k] * fact_inv[n - k] % MOD) % MOD; } long long modpow(long long a, long long n, long long mod) { long long res = 1; while (n > 0) { if (n & 1) res = res * a % mod; a = a * a % mod; n >>= 1; } return res; } ll POW(ll a,ll n){ long long res = 1; while (n > 0) { if (n & 1) res = res * a; a = a * a; n >>= 1; } return res; } int main() { int n;cin>>n; vector<ll> v(n,-1); rep(i,n-1){ cin>>v[i+1];v[i+1]--; } string s;cin>>s; vector<ll> sm(n); vector<ll> prt(n); for(int i = n-1;0<i;i--){ if(sm[i]%2!=(int)(s[i-1]=='#')){ sm[i]++;prt[i]++; } sm[v[i]] += sm[i]; // sm[v[i]] += sm[i]; // if(s[i-1]=='#'){sm[i]++;} } dsu d(n); //rep(i,n){cout<<sm[i]<<" ";} //rep(i,n){cout<<prt[i]<<" ";} int m;cin>>m; rep(i,m){ ll a,b;cin>>a>>b;a--;b--;d.merge(a,b); } map<ll,ll> mp; rep(i,n){ mp[d.leader(i)] += prt[i]; } for(auto u : mp){ if(u.second%2==1){cout<<"No"<<endl;return 0;} } cout<<"Yes"<<endl; }