結果
問題 | No.2205 Lights Out on Christmas Tree |
ユーザー | AngrySadEight |
提出日時 | 2023-02-04 02:53:20 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 188 ms / 2,000 ms |
コード長 | 3,517 bytes |
コンパイル時間 | 6,443 ms |
コンパイル使用メモリ | 302,668 KB |
実行使用メモリ | 43,892 KB |
最終ジャッジ日時 | 2023-09-15 23:39:36 |
合計ジャッジ時間 | 14,597 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 2 ms
4,376 KB |
testcase_06 | AC | 2 ms
4,384 KB |
testcase_07 | AC | 1 ms
4,380 KB |
testcase_08 | AC | 1 ms
4,380 KB |
testcase_09 | AC | 1 ms
4,376 KB |
testcase_10 | AC | 1 ms
4,376 KB |
testcase_11 | AC | 165 ms
23,544 KB |
testcase_12 | AC | 166 ms
23,636 KB |
testcase_13 | AC | 160 ms
23,496 KB |
testcase_14 | AC | 139 ms
23,448 KB |
testcase_15 | AC | 184 ms
43,892 KB |
testcase_16 | AC | 111 ms
16,272 KB |
testcase_17 | AC | 110 ms
16,236 KB |
testcase_18 | AC | 1 ms
4,376 KB |
testcase_19 | AC | 167 ms
23,676 KB |
testcase_20 | AC | 180 ms
22,928 KB |
testcase_21 | AC | 178 ms
23,032 KB |
testcase_22 | AC | 156 ms
23,944 KB |
testcase_23 | AC | 168 ms
22,956 KB |
testcase_24 | AC | 167 ms
23,008 KB |
testcase_25 | AC | 179 ms
22,620 KB |
testcase_26 | AC | 188 ms
21,980 KB |
testcase_27 | AC | 166 ms
23,880 KB |
testcase_28 | AC | 153 ms
23,820 KB |
testcase_29 | AC | 158 ms
24,136 KB |
testcase_30 | AC | 187 ms
21,944 KB |
testcase_31 | AC | 165 ms
23,688 KB |
testcase_32 | AC | 173 ms
22,820 KB |
testcase_33 | AC | 172 ms
22,696 KB |
testcase_34 | AC | 166 ms
23,200 KB |
testcase_35 | AC | 184 ms
22,220 KB |
testcase_36 | AC | 185 ms
22,292 KB |
testcase_37 | AC | 167 ms
23,072 KB |
testcase_38 | AC | 187 ms
21,992 KB |
testcase_39 | AC | 165 ms
23,612 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> #include <atcoder/all> using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector<int> #define vs vector<string> #define vc vector<char> #define vl vector<ll> #define vb vector<bool> #define vvi vector<vector<int>> #define vvc vector<vector<char>> #define vvl vector<vector<ll>> #define vvb vector<vector<bool>> #define vvvi vector<vector<vector<int>>> #define vvvl vector<vector<vector<ll>>> #define pii pair<int,int> #define pil pair<int,ll> #define pli pair<ll, int> #define pll pair<ll, ll> #define vpii vector<pair<int,int>> #define vpll vector<pair<ll,ll>> #define vvpii vector<vector<pair<int,int>>> #define vvpll vector<vector<pair<ll,ll>>> template<typename T> void debug(T e){ cerr << e << endl; } template<typename T> void debug(vector<T> &v){ rep(i, v.size()){ cerr << v[i] << " "; } cerr << endl; } template<typename T> void debug(vector<vector<T>> &v){ rep(i, v.size()){ rep(j, v[i].size()){ cerr << v[i][j] << " "; } cerr << endl; } } template<typename T> void debug(vector<pair<T, T>> &v){ rep(i,v.size()){ cerr << v[i].first << " " << v[i].second << endl; } } template<typename T> void debug(set<T> &st){ for (auto itr = st.begin(); itr != st.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template<typename T> void debug(multiset<T> &ms){ for (auto itr = ms.begin(); itr != ms.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template<typename T> void debug(map<T, T> &mp){ for (auto itr = mp.begin(); itr != mp.end(); itr++){ cerr << itr->first << " " << itr->second << endl; } } void debug_out(){ cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T){ cerr << H << " "; debug_out(T...); } ll INF = 1000000; void treedp(vvl &graph, vb &isvisited, vl &dp1, vl &dp2, vl &c, ll v){ isvisited[v] = true; ll now_state = c[v]; ll count = 0; for (ll x: graph[v]){ if (isvisited[x]){ continue; } treedp(graph, isvisited, dp1, dp2, c, x); ll next_state; if (dp1[x] == INF) next_state = 1; else next_state = 0; if (next_state == 0){ now_state ^= 1; count += 1; count += dp1[x]; } else{ count += dp2[x]; } } if (now_state == 0) dp1[v] = count; else dp2[v] = count; } int main(){ ll N; cin >> N; vl a(N - 1); vl b(N - 1); vl c(N); rep(i,N - 1){ cin >> a[i] >> b[i]; a[i]--; b[i]--; } vvl graph(N, vl(0)); rep(i,N - 1){ graph[a[i]].push_back(b[i]); graph[b[i]].push_back(a[i]); } rep(i,N) cin >> c[i]; vl dp1(N, INF); //その頂点が白で塗られるとき vl dp2(N, INF); //その頂点が黒で塗られるとき vector<bool> isvisited(N, false); treedp(graph, isvisited, dp1, dp2, c, 0); //debug(dp1); //debug(dp2); if (dp2[0] == INF) cout << -1 << endl; else cout << dp2[0] << endl; }