結果
問題 | No.1153 ねこちゃんゲーム |
ユーザー | mkawa2 |
提出日時 | 2021-10-13 12:48:48 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,383 bytes |
コンパイル時間 | 510 ms |
コンパイル使用メモリ | 81,608 KB |
実行使用メモリ | 202,896 KB |
最終ジャッジ日時 | 2023-10-17 19:04:20 |
合計ジャッジ時間 | 52,059 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
52,392 KB |
testcase_01 | AC | 38 ms
52,340 KB |
testcase_02 | AC | 75 ms
75,708 KB |
testcase_03 | AC | 72 ms
74,296 KB |
testcase_04 | AC | 71 ms
73,824 KB |
testcase_05 | AC | 72 ms
74,200 KB |
testcase_06 | AC | 76 ms
75,884 KB |
testcase_07 | AC | 1,128 ms
170,852 KB |
testcase_08 | AC | 1,125 ms
171,040 KB |
testcase_09 | AC | 1,146 ms
171,244 KB |
testcase_10 | AC | 1,077 ms
171,340 KB |
testcase_11 | AC | 1,115 ms
171,420 KB |
testcase_12 | AC | 1,092 ms
171,376 KB |
testcase_13 | AC | 1,052 ms
171,280 KB |
testcase_14 | AC | 1,069 ms
171,544 KB |
testcase_15 | AC | 1,115 ms
171,340 KB |
testcase_16 | AC | 1,106 ms
171,288 KB |
testcase_17 | AC | 1,050 ms
170,628 KB |
testcase_18 | AC | 1,057 ms
169,888 KB |
testcase_19 | AC | 1,089 ms
170,132 KB |
testcase_20 | AC | 1,040 ms
167,992 KB |
testcase_21 | AC | 1,056 ms
167,968 KB |
testcase_22 | AC | 1,074 ms
170,864 KB |
testcase_23 | AC | 1,063 ms
170,064 KB |
testcase_24 | AC | 1,056 ms
169,984 KB |
testcase_25 | AC | 1,083 ms
168,944 KB |
testcase_26 | AC | 1,064 ms
169,064 KB |
testcase_27 | AC | 1,184 ms
194,024 KB |
testcase_28 | AC | 1,362 ms
194,120 KB |
testcase_29 | AC | 1,168 ms
194,336 KB |
testcase_30 | AC | 1,173 ms
194,252 KB |
testcase_31 | AC | 1,143 ms
194,528 KB |
testcase_32 | AC | 1,019 ms
197,088 KB |
testcase_33 | AC | 1,034 ms
198,448 KB |
testcase_34 | AC | 1,003 ms
196,676 KB |
testcase_35 | AC | 1,002 ms
198,048 KB |
testcase_36 | AC | 1,004 ms
197,768 KB |
testcase_37 | TLE | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
testcase_41 | -- | - |
ソースコード
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 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 = [e() 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: cs = e() # ↓変数注意 for v in to[u]: rdp[v] = op(rdp[v], cs) cs = op(cs, dp[v]) cs = op(e(), rdp[u]) for v in to[u][::-1]: rdp[v] = op(rdp[v], cs) trans_down(v) cs = op(cs, dp[v]) for g in range(n): if g not in cs: gg[u] = g # print(u,cs, g) break # print("gg",gg) g = 0 for a in aa: g ^= gg[a] # print(g) if g == 0: print(-1, -1) exit() for i, a in enumerate(aa): 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()