結果
問題 | No.1153 ねこちゃんゲーム |
ユーザー | mkawa2 |
提出日時 | 2021-10-13 18:19:22 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,538 ms / 2,500 ms |
コード長 | 2,405 bytes |
コンパイル時間 | 180 ms |
コンパイル使用メモリ | 81,792 KB |
実行使用メモリ | 185,812 KB |
最終ジャッジ日時 | 2023-10-17 19:09:28 |
合計ジャッジ時間 | 45,170 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
55,540 KB |
testcase_01 | AC | 42 ms
55,540 KB |
testcase_02 | AC | 84 ms
76,240 KB |
testcase_03 | AC | 82 ms
76,164 KB |
testcase_04 | AC | 80 ms
74,288 KB |
testcase_05 | AC | 83 ms
76,292 KB |
testcase_06 | AC | 84 ms
76,248 KB |
testcase_07 | AC | 1,110 ms
159,128 KB |
testcase_08 | AC | 1,437 ms
163,400 KB |
testcase_09 | AC | 1,035 ms
162,952 KB |
testcase_10 | AC | 1,049 ms
163,292 KB |
testcase_11 | AC | 1,028 ms
162,632 KB |
testcase_12 | AC | 1,057 ms
162,780 KB |
testcase_13 | AC | 1,013 ms
162,744 KB |
testcase_14 | AC | 1,043 ms
163,044 KB |
testcase_15 | AC | 1,045 ms
162,492 KB |
testcase_16 | AC | 1,039 ms
162,784 KB |
testcase_17 | AC | 1,063 ms
162,520 KB |
testcase_18 | AC | 1,081 ms
161,932 KB |
testcase_19 | AC | 1,065 ms
161,804 KB |
testcase_20 | AC | 1,019 ms
159,768 KB |
testcase_21 | AC | 1,029 ms
159,480 KB |
testcase_22 | AC | 1,039 ms
162,464 KB |
testcase_23 | AC | 1,062 ms
162,348 KB |
testcase_24 | AC | 1,056 ms
161,540 KB |
testcase_25 | AC | 1,053 ms
160,900 KB |
testcase_26 | AC | 1,020 ms
160,576 KB |
testcase_27 | AC | 1,156 ms
183,456 KB |
testcase_28 | AC | 1,538 ms
185,552 KB |
testcase_29 | AC | 1,127 ms
184,784 KB |
testcase_30 | AC | 1,149 ms
184,672 KB |
testcase_31 | AC | 1,105 ms
185,812 KB |
testcase_32 | AC | 770 ms
147,716 KB |
testcase_33 | AC | 747 ms
147,452 KB |
testcase_34 | AC | 721 ms
147,716 KB |
testcase_35 | AC | 739 ms
147,716 KB |
testcase_36 | AC | 760 ms
148,772 KB |
testcase_37 | AC | 400 ms
147,232 KB |
testcase_38 | AC | 392 ms
157,336 KB |
testcase_39 | AC | 386 ms
152,316 KB |
testcase_40 | AC | 390 ms
154,364 KB |
testcase_41 | AC | 386 ms
162,872 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] 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 = 10**16 # md = 998244353 md = 10**9+7 from collections import Counter n, m = LI() aa = LI1() to = [[] for _ in range(n)] for _ in range(n-1): u, v = LI1() to[u].append(v) to[v].append(u) # ***************ここから本体***************** # 設定 root = 0 e = lambda: set() # 単位元 def op(a, b): if isinstance(b, set): return a | b a.add(b) return a def trans_up(u): for a in range(n): if a not in dp[u]: dp[u] = a return def trans_down(u): for a in range(n): if a not in rdp[u]: rdp[u] = a return # dfs順を作る uu = [] stack = [root] par = [-1]*n while stack: u = stack.pop() uu.append(u) vv = [] # ↓変数注意 for v in to[u]: if v == par[u]: continue vv.append(v) par[v] = u stack.append(v) to[u] = vv # print("to",to) # print("par",par) dp = [e() for _ in range(n)] rdp = [0 for _ in range(n)] # 下から更新 for u in uu[::-1]: p = par[u] if p != -1: trans_up(u) dp[p] = op(dp[p], dp[u]) # print("dp",dp) # 上から更新 gg = [-1]*n for u in uu: cnt = Counter(dp[v] for v in to[u]) if u != root: cnt[rdp[u]] += 1 for g in range(n): if cnt[g] == 0: gg[u] = g break for v in to[u]: if cnt[dp[v]] == 1 and dp[v] < gg[u]: rdp[v] = dp[v] else: rdp[v] = gg[u] # print(gg) g = 0 for a in aa: g ^= gg[a] # print(g) if g == 0: print(-1, -1) exit() ln = g.bit_length()-1 for i, a in enumerate(aa): if gg[a] >> ln & 1 == 0: continue for v in to[a]: if g ^ gg[a] ^ dp[v] == 0: print(i+1, v+1) exit() if a != root and g ^ gg[a] ^ rdp[a] == 0: print(i+1, par[a]+1) exit()