提出 #54177075

---

ソースコード 拡げる

n = int(input())

import collections
def mergesort(l):
    if len(l) > 1:
        l1 = mergesort(l[:len(l)//2])
        l2 = mergesort(l[len(l)//2:])
        ret = collections.deque()
        while len(l1) > 0 and len(l2) > 0:
            print(f'? {l1[0]} {l2[0]}')
            q = int(input())
            if q == 1:
                ret.append(l1.popleft())
            elif q == 0:
                ret.append(l2.popleft())
            else:
                exit()
        if len(l1) > 0: ret.extend(l1)
        if len(l2) > 0: ret.extend(l2)
        return ret
    else:
        return collections.deque(l)



li = list(range(1, n+1))
li = list(mergesort(li))
while len(li) > 2:
    print(f'+ {li.pop(0)} {li.pop()}')
    p = int(input())
    if p == -1:
        exit()
    l = -1
    r = len(li)
    while l + 1 < r:
        mid = (l + r)//2
        print(f'? {li[mid]} {p}')
        q = int(input())
        if q == 1:
            l = mid
        elif q == 0:
            r = mid
        else:
            exit()
    li.insert(r, p)
print(f'+ {li.pop()} {li.pop()}')
print('!')

提出情報

ジャッジ結果