#736796 (Python3) No.1830 Balanced Majority

• 問題: No.1830 Balanced Majority
• ユーザー: mkawa2
• 提出日時: 2022-02-04 22:06:43
• 言語: Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0)
• 結果: AC
• 実行時間: 50 ms / 2,000 ms
• コード長: 1,200 bytes
• コンパイル時間: 316 ms
• コンパイル使用メモリ: 12,800 KB
• 実行使用メモリ: 27,736 KB
• 平均クエリ数: 7.54
• 最終ジャッジ日時: 2024-06-11 11:55:13
• 合計ジャッジ時間: 3,370 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	48 ms; 27,480 KB
testcase_01	AC	43 ms; 26,968 KB
testcase_02	AC	44 ms; 27,088 KB
testcase_03	AC	44 ms; 27,224 KB
testcase_04	AC	43 ms; 27,352 KB
testcase_05	AC	44 ms; 27,224 KB
testcase_06	AC	46 ms; 27,224 KB
testcase_07	AC	46 ms; 27,352 KB
testcase_08	AC	46 ms; 27,224 KB
testcase_09	AC	48 ms; 27,352 KB
testcase_10	AC	50 ms; 27,352 KB
testcase_11	AC	46 ms; 27,352 KB
testcase_12	AC	48 ms; 27,600 KB
testcase_13	AC	48 ms; 27,480 KB
testcase_14	AC	50 ms; 27,512 KB
testcase_15	AC	50 ms; 27,096 KB
testcase_16	AC	48 ms; 26,968 KB
testcase_17	AC	50 ms; 27,096 KB
testcase_18	AC	48 ms; 27,224 KB
testcase_19	AC	47 ms; 27,352 KB
testcase_20	AC	46 ms; 27,224 KB
testcase_21	AC	48 ms; 27,608 KB
testcase_22	AC	45 ms; 27,480 KB
testcase_23	AC	49 ms; 27,352 KB
testcase_24	AC	48 ms; 27,736 KB
testcase_25	AC	44 ms; 27,224 KB

ソースコード

import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
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 = (1 << 63)-1
inf = (1 << 31)-1
# md = 10**9+7
# md = 998244353

def ask(k):
    print("?", k, flush=True)
    a = int(input())
    return 2*a-k

n = II()

lv = ask(1)
rv = ask(n-1)

if lv == rv:
    print("!", 2, n-1, flush=True)
    exit()

l, r = 1, n-1
while 1:
    m = (l+r)//2
    mv = ask(m)
    if mv == 0:
        if m >= n//2:
            print("!", 1, m, flush=True)
        else:
            print("!", m+1, n, flush=True)
        break
    if lv*mv < 0:
        r = m
        rv = mv
    else:
        l = m
        lv = mv