結果

問題 No.3237 Find the Treasure!
ユーザー lif4635
提出日時 2025-08-15 22:06:52
言語 PyPy3
(7.3.15)
結果
RE  
実行時間 -
コード長 3,666 bytes
コンパイル時間 214 ms
コンパイル使用メモリ 82,520 KB
実行使用メモリ 98,524 KB
平均クエリ数 11.17
最終ジャッジ日時 2025-08-15 22:07:10
合計ジャッジ時間 9,981 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other WA * 9 RE * 13
権限があれば一括ダウンロードができます

ソースコード

diff # 

# input
import sys
# input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

def graph(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[int]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b = map(int, input().split())
        a += index
        b += index
        edge[a].add(b)
        if not dir:
            edge[b].add(a)
    return edge

def graph_w(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[tuple]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b,c = map(int, input().split())
        a += index
        b += index
        edge[a].add((b,c))
        if not dir:
            edge[b].add((a,c))
    return edge

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")
def acc(a:list[int]):
    sa = [0]*(len(a)+1)
    for i in range(len(a)):
        sa[i+1] = a[i] + sa[i]
    return sa

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
# sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right


n = II()
edge = [[] for i in range(n)]
e = []
for i in range(n-1):
    u, v = MI_1()
    edge[u].append((v, i))
    edge[v].append((u, i))
    e.append((u, v))

def ask(a):
    b = [x + 1 for x in a]
    print("?", *b)
    s = input()
    return s == "Yes" 

dis = [-1] * n
dis[0] = 0
st = [0]
par = [-1] * n
pe = [-1] * n
while st:
    u = st.pop()
    for v, idx in edge[u]:
        if par[u] == v: continue
        par[v] = u
        pe[v] = i
        dis[v] = dis[u]^1

a = [-1] * (n - 1)
for i in range(n - 1):
    u, v = e[i]
    if dis[u]:
        a[i] = u
    else:
        a[i] = v

r1 = ask(a)
# res のほうにお宝がある -> 跡は二分探索
b = [-1] * (n - 1)
for i in range(n-1):
    u, v = e[i]
    if u == 0 or v == 0:
        b[i] = u + v
    elif dis[u]:
        b[i] = v
    else:
        b[i] = u
r2 = ask(b)

if r1 == 0 and r2 == 0:
    print("!", 1)
    exit()

# そうではない時は二分探索
idx = []
for i in range(1, n):
    if dis[i] == r1:
        idx.append(i)

while True:
    l = len(idx)
    if l == 1:
        print("!", idx[0] + 1)
        exit()
    pidx = set(idx[:l//2])
    qidx = set(idx[l//2:])
    
    a = [-1] * (n-1)
    for i in range(n-1):
        u, v = e[i]
        if u in pidx: a[i] = u
        elif v in pidx: a[i] = v
        elif u in qidx: a[i] = v
        elif v in qidx: a[i] = u
        else: a[i] = u
    r = ask(a)
    if r:
        idx = list(pidx)
    else:
        idx = list(qidx)
0