#601850 (PyPy3) No.1332 Range Nearest Query

• 問題: No.1332 Range Nearest Query
• ユーザー: mkawa2
• 提出日時: 2021-01-09 14:25:20
• 言語: PyPy3 (7.3.15)
• 結果: TLE (最新)
  AC
  (最初)
• 実行時間: -
• コード長: 5,800 bytes
• コンパイル時間: 1,373 ms
• コンパイル使用メモリ: 82,048 KB
• 実行使用メモリ: 155,644 KB
• 最終ジャッジ日時: 2024-12-27 11:37:38
• 合計ジャッジ時間: 71,393 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

ファイルパターン	結果
other	AC * 47 TLE * 1

ソースコード

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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
import sys
sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [[(-1, 0), (1, 0)], [(0, -1), (0, 1)]]
inf = 10**16
# md = 998244353
md = 10**9+7
class SegtreeMin():
    def __init__(self, n):
        self.inf = 10**16
        aa = []
        if not isinstance(n, int):
            aa = n
            n = len(aa)
        self.tree_width = tw = 1 << (n-1).bit_length()
        self.tree = [self.inf]*(tw*2-1)
        if aa:
            self.tree[tw-1:tw-1+len(aa)] = aa
            for i in range(tw-2, -1, -1):
                self.tree[i] = min(self.tree[i*2+1], self.tree[i*2+2])
    def update(self, i, a):
        seg_i = self.tree_width-1+i
        self.tree[seg_i] = a
        while seg_i != 0:
            seg_i = (seg_i-1)//2
            self.tree[seg_i] = min(self.tree[seg_i*2+1], self.tree[seg_i*2+2])
    def element(self, i):
        return self.tree[self.tree_width-1+i]
    # [l,r)の最小値
    def min(self, l, r):
        res = self.inf
        stack = [(0, 0, self.tree_width)]
        while stack:
            seg_i, segL, segR = stack.pop()
            if l <= segL and segR <= r:
                if self.tree[seg_i] < res: res = self.tree[seg_i]
            else:
                segM = (segL+segR)//2
                if r > segL and segM > l:
                    stack.append((seg_i*2+1, segL, segM))
                if r > segM and segR > l:
                    stack.append((seg_i*2+2, segM, segR))
        return res
    # [l,r)でaより小さい要素のうち最右のインデックス
    def LessR(self, l, r, a):
        stack = [(0, 0, self.tree_width)]
        while stack:
            u, ul, ur = stack.pop()
            if ur-ul == 1: return u-self.tree_width+1
            um = (ul+ur)//2
            if self.tree[u*2+1] < a and ul < r and l < um:
                stack.append((u*2+1, ul, um))
            if self.tree[u*2+2] < a and um < r and l < ur:
                stack.append((u*2+2, um, ur))
        return -1
    # [l,r)でaより小さい要素のうち最左のインデックス
    def LessL(self, l, r, a):
        stack = [(0, 0, self.tree_width)]
        while stack:
            u, ul, ur = stack.pop()
            if ur-ul == 1: return u-self.tree_width+1
            um = (ul+ur)//2
            if self.tree[u*2+2] < a and um < r and l < ur:
                stack.append((u*2+2, um, ur))
            if self.tree[u*2+1] < a and ul < r and l < um:
                stack.append((u*2+1, ul, um))
        return -1
class SegtreeMax():
    def __init__(self, n):
        self.inf = 10**16
        aa = []
        if not isinstance(n, int):
            aa = n
            n = len(aa)
        self.tree_width = tw = 1 << (n-1).bit_length()
        self.tree = [-self.inf]*(tw*2-1)
        if aa:
            self.tree[tw-1:tw-1+len(aa)] = aa
            for i in range(tw-2, -1, -1):
                self.tree[i] = max(self.tree[i*2+1], self.tree[i*2+2])
    def update(self, i, a):
        seg_i = self.tree_width-1+i
        self.tree[seg_i] = a
        while seg_i != 0:
            seg_i = (seg_i-1)//2
            self.tree[seg_i] = max(self.tree[seg_i*2+1], self.tree[seg_i*2+2])
    def element(self, i):
        return self.tree[self.tree_width-1+i]
    # [l,r)の最小値
    def max(self, l, r):
        res = -self.inf
        stack = [(0, 0, self.tree_width)]
        while stack:
            seg_i, segL, segR = stack.pop()
            if l <= segL and segR <= r:
                if self.tree[seg_i] > res: res = self.tree[seg_i]
            else:
                segM = (segL+segR)//2
                if r > segL and segM > l:
                    stack.append((seg_i*2+1, segL, segM))
                if r > segM and segR > l:
                    stack.append((seg_i*2+2, segM, segR))
        return res
    # [l,r)でaより大きい要素のうち最右のインデックス
    def OverR(self, l, r, a):
        stack = [(0, 0, self.tree_width)]
        while stack:
            u, ul, ur = stack.pop()
            if ur-ul == 1: return u-self.tree_width+1
            um = (ul+ur)//2
            if self.tree[u*2+1] > a and ul < r and l < um:
                stack.append((u*2+1, ul, um))
            if self.tree[u*2+2] > a and um < r and l < ur:
                stack.append((u*2+2, um, ur))
        return -1
    # [l,r)でaより大きい要素のうち最左のインデックス
    def OverL(self, l, r, a):
        stack = [(0, 0, self.tree_width)]
        while stack:
            u, ul, ur = stack.pop()
            if ur-ul == 1: return u-self.tree_width+1
            um = (ul+ur)//2
            if self.tree[u*2+2] > a and um < r and l < ur:
                stack.append((u*2+2, um, ur))
            if self.tree[u*2+1] > a and ul < r and l < um:
                stack.append((u*2+1, ul, um))
        return -1
n=II()
xx=LI()
q=II()
xlri=[]
for i in range(q):
    l,r,x=MI()
    l-=1
    xlri.append((x,l,r,i))
xlri.sort()
mn=SegtreeMin(xx)
mx=SegtreeMax(n)
ans=[-1]*q
xj=[(x,j) for j,x in enumerate(xx)]
xj.sort(reverse=True)
for x,l,r,i in xlri:
    while xj and xj[-1][0]<x:
        x0,j=xj.pop()
        mn.update(j,inf)
        mx.update(j,x0)
    ans[i]=min(mn.min(l,r)-x,x-mx.max(l,r))
print(*ans,sep="\n")
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX