結果
問題 | No.2205 Lights Out on Christmas Tree |
ユーザー |
![]() |
提出日時 | 2023-02-03 22:16:50 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 306 ms / 2,000 ms |
コード長 | 1,624 bytes |
コンパイル時間 | 238 ms |
コンパイル使用メモリ | 82,048 KB |
実行使用メモリ | 160,380 KB |
最終ジャッジ日時 | 2024-07-02 20:19:10 |
合計ジャッジ時間 | 10,637 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 37 |
ソースコード
import sys# sys.setrecursionlimit(200005)int1 = lambda x: int(x)-1pDB = lambda *x: print(*x, end="\n", file=sys.stderr)p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)def II(): return int(sys.stdin.readline())def LI(): return list(map(int, sys.stdin.readline().split()))def LLI(rows_number): return [LI() for _ in range(rows_number)]def LI1(): return list(map(int1, sys.stdin.readline().split()))def LLI1(rows_number): return [LI1() for _ in range(rows_number)]def SI(): return sys.stdin.readline().rstrip()# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]inf = (1 << 63)-1# inf = (1 << 31)-1# md = 10**9+7md = 998244353n = II()to = [[] for _ in range(n)]for _ in range(n-1):u, v = LI1()to[u].append(v)to[v].append(u)cc = LI()parent, depth, vis = [-1]*n, [0]*n, [0]*ndef dfs(root):uu = []vis[root] = 1stack = [root]while stack:iu = stack.pop()i, u = divmod(iu, n)if i == 0:uu.append(u)# care to's formatwhile i < len(to[u]) and vis[to[u][i]]: i += 1if i < len(to[u]):stack.append((i+1)*n+u)# care to's formatv = to[u][i]vis[v] = 1stack.append(v)parent[v] = udepth[v] = depth[u]+1return uuuu = dfs(0)cc = [c ^ 1 for c in cc]dp = [0]*nfor u in uu[::-1]:if u==0:breakp = parent[u]dp[p] += dp[u]if cc[u]:dp[p] += 1cc[p] ^= 1if cc[0]:print(-1)else:print(dp[0])