結果

問題 No.2962 Sum Bomb Bomber
ユーザー prin_kemkemprin_kemkem
提出日時 2024-11-16 16:07:03
言語 PyPy3
(7.3.15)
結果
RE  
実行時間 -
コード長 2,854 bytes
コンパイル時間 370 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 97,512 KB
平均クエリ数 301.00
最終ジャッジ日時 2024-11-16 16:07:24
合計ジャッジ時間 20,302 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 RE -
testcase_01 RE -
testcase_02 RE -
testcase_03 RE -
testcase_04 RE -
testcase_05 RE -
testcase_06 RE -
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 RE -
testcase_11 RE -
testcase_12 RE -
testcase_13 RE -
testcase_14 RE -
testcase_15 RE -
testcase_16 RE -
testcase_17 RE -
testcase_18 RE -
testcase_19 RE -
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 RE -
testcase_26 RE -
testcase_27 RE -
testcase_28 RE -
testcase_29 RE -
testcase_30 RE -
testcase_31 RE -
testcase_32 RE -
testcase_33 RE -
testcase_34 RE -
testcase_35 RE -
testcase_36 RE -
testcase_37 RE -
testcase_38 RE -
testcase_39 RE -
testcase_40 RE -
testcase_41 RE -
testcase_42 RE -
testcase_43 RE -
testcase_44 RE -
testcase_45 RE -
testcase_46 RE -
testcase_47 RE -
testcase_48 RE -
testcase_49 RE -
testcase_50 RE -
testcase_51 RE -
testcase_52 RE -
testcase_53 RE -
testcase_54 RE -
testcase_55 RE -
testcase_56 RE -
testcase_57 RE -
testcase_58 RE -
testcase_59 RE -
testcase_60 RE -
testcase_61 RE -
testcase_62 RE -
testcase_63 RE -
testcase_64 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

from collections import defaultdict, deque, Counter
# from functools import cache
# import copy
from itertools import combinations, permutations, product, accumulate, groupby, chain
# from more_itertools import distinct_permutations
from heapq import heapify, heappop, heappush, heappushpop
import math
import bisect
from pprint import pprint
from random import randint, shuffle, randrange
# from sortedcontainers import SortedSet, SortedList, SortedDict
import sys
# sys.setrecursionlimit(2000000)
input = lambda: sys.stdin.readline().rstrip('\n')
inf = float('inf')
mod1 = 10**9+7
mod2 = 998244353
def ceil_div(x, y): return -(-x//y)

#################################################   

memo = {}
def ask(x, y):
    if (x, y) not in memo:
        print(1, x, y, flush=True)
        memo[(x, y)] = int(input())
    return memo[(x, y)]

def res(x, y):
    print(2, x, y, flush=True)
    exit()

class f(object):
    def __init__(self, x):
        class g(object):
            def __init__(self, y):
                self.y = y
                self.d = ask(x, y)
            def __eq__(self, other):
                if not isinstance(other, g):
                    return NotImplemented
                return self.d == other.d
            def __lt__(self, other):
                if not isinstance(other, g):
                    return NotImplemented
                return self.d < other.d
            def __ne__(self, other):
                return not self.__eq__(other)
            def __le__(self, other):
                return self.__lt__(other) or self.__eq__(other)
            def __gt__(self, other):
                return not self.__le__(other)
            def __ge__(self, other):
                return not self.__lt__(other)
        self.x = x
        self.y = findMin(g, L, R)
        self.d = ask(x, self.y)
    def __eq__(self, other):
        if not isinstance(other, f):
            return NotImplemented
        return self.d == other.d
    def __lt__(self, other):
        if not isinstance(other, f):
            return NotImplemented
        return self.d < other.d
    def __ne__(self, other):
        return not self.__eq__(other)
    def __le__(self, other):
        return self.__lt__(other) or self.__eq__(other)
    def __gt__(self, other):
        return not self.__le__(other)
    def __ge__(self, other):
        return not self.__lt__(other)

def findMin(f, l, r):
    while r-l >= 3:
        c1 = l+(r-l)//3
        c2 = r-(r-l)//3
        if f(c1) < f(c2): r = c2
        else: l = c1
    return min(list(range(l, r+1)), key=lambda k: f(k))

def findMax(f, l, r):
    while r-l >= 3:
        c1 = l+(r-l)//3
        c2 = r-(r-l)//3
        if f(c1) > f(c2): r = c2
        else: l = c1
    return max(list(range(l, r+1)), key=lambda k: f(k))

L, R = -10**9, 10**9
N = int(input())
x = findMin(f, L, R)
res(x, f(x).y)
0