#1027043 (PyPy3) No.2962 Sum Bomb Bomber

• 問題: No.2962 Sum Bomb Bomber
• ユーザー: prin_kemkem
• 提出日時: 2024-11-16 16:14:35
• 言語: PyPy3 (7.3.15)
• 結果: RE
• 実行時間: -
• コード長: 2,854 bytes
• コンパイル時間: 445 ms
• コンパイル使用メモリ: 82,380 KB
• 実行使用メモリ: 97,780 KB
• 平均クエリ数: 301.00
• 最終ジャッジ日時: 2024-11-16 16:14:56
• 合計ジャッジ時間: 20,065 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

ファイルパターン	結果
sample	RE * 1
other	RE * 64

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
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**8, 10**8
N = int(input())
x = findMin(f, L, R)
res(x, f(x).y)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX