結果

問題 No.3246 80% Accuracy Calculator
コンテスト
ユーザー lif4635
提出日時 2025-08-22 22:41:03
言語 PyPy3
(7.3.15)
結果
RE  
実行時間 -
コード長 3,019 bytes
コンパイル時間 379 ms
コンパイル使用メモリ 82,184 KB
実行使用メモリ 97,204 KB
平均クエリ数 5189.23
最終ジャッジ日時 2025-08-22 22:41:22
合計ジャッジ時間 17,423 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 11 WA * 2 RE * 30
権限があれば一括ダウンロードができます

ソースコード

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


now = [1, 1, 0]

do = 2
a = "ABC"
op = 0

def op1(x):
    global op
    cnt = DD(int)
    for i in range(do):
        print("?", a[x])
        # cnt[now[x]] += 1
        cnt[II()] += 1
        op += 1
    p = max(cnt.values())
    for v, c in cnt.items():
        if c == p:
            return v

def pp(x, y, z):
    global op
    while True:
        print("+", a[x], a[y], a[z])
        now[z] = now[x] + now[y]
        II()
        r = op1(z)
        if r == now[z]:
            break 
        op += 1

x = op1(0)
y = op1(1) # y の値をしる
now[0] = x
now[1] = y

c = y.bit_length() + 1
v = 2 # いまこっちに真の値
for i in reversed(range(c)):
    pp(v, v, 3-v)
    v = 3-v
    if (y >> i) & 1 == 1:
        pp(v, 0, 3-v)
        v = 3-v
print("!", a[v])
exit()
# print(now)
# print(now[v], op)
0