input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
input = sys.stdin.readline
INF = 10**11
A,B,Q = list(map(int,input().split()))
s = [-INF] + [int(eval(input())) for _ in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for _ in range(B)] + [INF]
def binary_search(lis,x):
ok = 0
ng = len(lis)-1
while ng-ok > 1:
mid = (ok+ng)/... | import sys
input = sys.stdin.readline
INF = 10**11
A,B,Q = list(map(int,input().split()))
s = [-INF] + [int(eval(input())) for _ in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for _ in range(B)] + [INF]
def binary_search(lis,x):
ok = 0
ng = len(lis)-1
while ng-ok > 1:
mid = (ok+ng)/... | p03112 |
a,b,q=list(map(int,input().split()))
s=sorted([int(eval(input())) for _ in range(a)])
t=sorted([int(eval(input())) for _ in range(b)])
import bisect
for _ in range(q):
x=int(eval(input()))
ss=[x-s[max(bisect.bisect_left(s,x)-1,0)],x-s[min(bisect.bisect_right(s,x),a-1)]]
tt=[x-t[max(bisect.bisect_left... | a,b,q=list(map(int,input().split()))
s=[int(eval(input())) for _ in range(a)]
t=[int(eval(input())) for _ in range(b)]
import bisect
for _ in range(q):
x=int(eval(input()))
sb=bisect.bisect_left(s,x)
tb=bisect.bisect_left(t,x)
ss=[x-s[max(sb-1,0)],x-s[min(sb,a-1)]]
tt=[x-t[max(tb-1,0)],x-t[... | p03112 |
def near(x, Y):
i = bisect_left(Y,x)
if i == 0:
return Y[i]-x
elif i == len(Y):
return x-Y[i-1]
else:
return min(Y[i]-x, x-Y[i-1])
def near2(x, D):
Y = [d for d ,_ in D]
i = bisect_left(Y,x)
if i == 0:
return Y[i]-x + D[i][1]
elif i == len(Y... | def near(x, Y):
i = bisect_left(Y,x)
if i == 0:
return Y[i]-x
elif i == len(Y):
return x-Y[i-1]
else:
return min(Y[i]-x, x-Y[i-1])
def near2(x, Y):
i = bisect_left(Y,x)
if i == 0:
return Y[i]-x + D[i][1]
elif i == len(Y):
return x-Y[i-1]... | p03112 |
def near(x, Y):
i = bisect_left(Y,x)
if i == 0:
return Y[i]-x
elif i == len(Y):
return x-Y[i-1]
else:
return min(Y[i]-x, x-Y[i-1])
def near2(x, Y):
i = bisect_left(Y,x)
if i == 0:
return Y[i]-x + D[i][1]
elif i == len(Y):
return x-Y[i-1]... | def near(x, X):
i = bisect_left(X, x)
if i == 0: return [X[i]-x]
elif i == len(X): return [X[i-1]-x]
else: return [X[i]-x, X[i-1]-x]
from bisect import *
A, B, Q = list(map(int, input().split()))
S, T = [], []
for _ in range(A):
S.append(int(eval(input())))
for _ in range(B):
T.append... | p03112 |
def near(x, X):
i = bisect_left(X, x)
if i == 0: return [X[i]-x]
elif i == len(X): return [X[i-1]-x]
else: return [X[i]-x, X[i-1]-x]
from bisect import *
from itertools import product
A, B, Q = list(map(int, input().split()))
S, T = [], []
for _ in range(A):
S.append(int(eval(input())))
f... | def near(x, X):
i = bisect_left(X, x)
if i == 0: return [X[i]-x]
elif i == len(X): return [X[i-1]-x]
else: return [X[i]-x, X[i-1]-x]
import sys
input = sys.stdin.readline
from bisect import *
from itertools import product
A, B, Q = list(map(int, input().split()))
S, T = [], []
for _ in range(... | p03112 |
from bisect import bisect_left
A, B, Q = list(map(int, input().split()))
S = [-10**11] + [int(eval(input())) for _ in range(A)] + [10**11]
T = [-10**11] + [int(eval(input())) for _ in range(B)] + [10**11]
X = [int(eval(input())) for _ in range(Q)]
S1 = [0]*A
T1 = [0]*B
for i, s in enumerate(S[1:-1]):
x = ... | import sys
from bisect import bisect as br
A, B, Q = list(map(int, input().split()))
inf = 10**11
S = [-inf] + [int(sys.stdin.readline()) for _ in range(A)] + [inf]
T = [-inf] + [int(sys.stdin.readline()) for _ in range(B)] + [inf]
X = [int(sys.stdin.readline()) for _ in range(Q)]
StoT = [0]*A
for i, s in enu... | p03112 |
from bisect import bisect_left as bl
a,b,q = list(map(int,input().split()))
s = [int(eval(input())) for i in range(a)]
t = [int(eval(input())) for i in range(b)]
s.insert(0,-10**12)
s.append(10**12)
t.insert(0,-10**12)
t.append(10**12)
for i in range(q):
x = int(eval(input()))
si = bl(s,x)
ti... | import bisect
A, B, Q = list(map(int, input().split()))
INF = 10 ** 18
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
for q in range(Q):
x = int(eval(input()))
b, d = bisect.bisect_right(s, x), bisect.bisect_right(t, x)
res = I... | p03112 |
import sys
import bisect
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
a,b,q = list(map(int,readline().split()))
jinja = [-(2*10**10+10)]
for i in range(a):
jinja.append(int(eval(input())))
tera = [-(2*10**10+10)]
for i in range(b):
... | import sys
import bisect
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
a,b,q = list(map(int,readline().split()))
jinja = [-(10**10+10)]
for i in range(a):
jinja.append(int(readline()))
tera = [-(10**10+10)]
for i in range(b):
tera.a... | p03112 |
from bisect import bisect_left
a,b,q = list(map(int, input().split()))
S = []
for _ in range(a):
S.append(int(eval(input())))
T = []
for _ in range(b):
T.append(int(eval(input())))
X = []
for _ in range(q):
X.append(int(eval(input())))
INF = 10 ** 11
def dfs(direction, tors, pos, count):
if tors ... | import bisect
A, B, Q = list(map(int, input().split()))
INF = 10 ** 18
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
for q in range(Q):
x = int(eval(input()))
b, d = bisect.bisect_right(s, x), bisect.bisect_right(t, x)
res = INF
... | p03112 |
#D問題
A,B,Q = list(map(int,(input().split())))
si = [-(10**10)]+[int(eval(input())) for _ in range(A)]+[2*(10**10)] # 範囲外に追加して、xの左右に常にデータがあるようにする
ti = [-(10**10)]+[int(eval(input())) for _ in range(B)]+[2*(10**10)]
A +=2
B +=2
for _ in [0]*Q:
x = int(eval(input()))
l = 0
r = A-1
while l+1<r:
... | #D問題
A,B,Q = list(map(int,(input().split())))
si = [-(10**10)]+[int(eval(input())) for _ in range(A)]+[2*(10**10)] # 範囲外に追加して、xの左右に常にデータがあるようにする
ti = [-(10**10)]+[int(eval(input())) for _ in range(B)]+[2*(10**10)]
xi = [int(eval(input())) for i in range(Q)]
A +=2
B +=2
for x in xi:
l = 0
r = A-1
... | p03112 |
#D問題
A,B,Q = list(map(int,(input().split())))
si = [-(10**10)]+[int(eval(input())) for _ in range(A)]+[2*(10**10)] # 範囲外に追加して、xの左右に常にデータがあるようにする
ti = [-(10**10)]+[int(eval(input())) for _ in range(B)]+[2*(10**10)]
xi = [int(eval(input())) for i in range(Q)]
A +=2
B +=2
for x in xi:
l = 0
r = A-1
... | #D問題
import sys
A,B,Q = list(map(int,(input().split())))
si = [-(10**10)]+[int(eval(input())) for _ in range(A)]+[2*(10**10)] # 範囲外に追加して、xの左右に常にデータがあるようにする
ti = [-(10**10)]+[int(eval(input())) for _ in range(B)]+[2*(10**10)]
#xi = [int(input()) for i in range(Q)]
*xi, = list(map(int,"".join(sys.stdin.readlines())... | p03112 |
import bisect
A, B, Q = list(map(int, input().split()))
INF = 10 ** 13
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
for q in range(Q):
x = int(eval(input()))
b, d = bisect.bisect_right(s, x), bisect.bisect_right(t, x)
res = I... | import bisect
import sys
A, B, Q = list(map(int, input().split()))
INF = 10 ** 13
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
for q in range(Q):
x = int(sys.stdin.readline())
b, d = bisect.bisect_right(s, x), bisect.bisect_right... | p03112 |
import bisect
import sys
A, B, Q = list(map(int, input().split()))
INF = 10 ** 13
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
for q in range(Q):
x = int(sys.stdin.readline())
b, d = bisect.bisect_right(s, x), bisect.bisect_right... | import bisect
import sys
A, B, Q = list(map(int, input().split()))
INF = 10 ** 13
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
xs = [int(sys.stdin.readline()) for i in range(Q)]
for x in xs:
b, d = bisect.bisect_right(s, x), bisect.b... | p03112 |
import bisect
import sys
A, B, Q = list(map(int, input().split()))
INF = 10 ** 13
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
xs = [int(sys.stdin.readline()) for i in range(Q)]
for x in xs:
b, d = bisect.bisect_right(s, x), bisect.b... | def solve():
import bisect
import sys
A, B, Q = list(map(int, input().split()))
INF = 10 ** 13
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
xs = [int(sys.stdin.readline()) for i in range(Q)]
for x in xs:
... | p03112 |
from bisect import bisect_right
A , B , Q = list(map(int,input().split()))
INF = 10**20
s = [0] * A
t = [0] * B
x = [0] * Q
for i in range(A) :
s[i] = int(eval(input()))
for i in range(B) :
t[i] = int(eval(input()))
for i in range(Q) :
x[i] = int(eval(input()))
s = [-INF] + s + [INF]
t ... | from bisect import bisect_left, bisect_right
A, B, Q = map(int, input().split())
S = [int(input()) for _ in range(A)] + [float('inf'), -float('inf')]
T = [int(input()) for _ in range(B)] + [float('inf'), -float('inf')]
S.sort()
T.sort()
ans = []
for _ in range(Q):
x = int(input())
midS = bisect... | p03112 |
from bisect import bisect_right, bisect_left
A, B, Q = list(map(int, input().split()))
INF = 10**18
S = [-INF] + [int(eval(input())) for _ in range(A)] + [INF]
T = [-INF] + [int(eval(input())) for _ in range(B)] + [INF]
for _ in range(Q):
x = int(eval(input()))
lS, lT = S[bisect_right(S, x) - 1], T... | from bisect import bisect_left
A, B, Q = list(map(int, input().split()))
INF = 10**18
S = [int(eval(input())) for _ in range(A)] + [INF, INF, -INF, -INF]
T = [int(eval(input())) for _ in range(B)] + [INF, INF, -INF, -INF]
S.sort()
T.sort()
for _ in range(Q):
x = int(eval(input()))
s = bisect_le... | p03112 |
import bisect
a, b, q = [ int(v) for v in input().split() ]
temple_list = [ int(eval(input())) for i in range(a) ]
shrine_list = [ int(eval(input())) for i in range(b) ]
def excursion(x):
global temple_list, shine_list
temple_west = bisect.bisect_left(temple_list,x)
shrine_west = bisect.bisect_left(s... | import bisect
import sys
input = sys.stdin.readline
a, b, q = [ int(v) for v in input().split() ]
temple_list = [ int(eval(input())) for i in range(a) ]
shrine_list = [ int(eval(input())) for i in range(b) ]
def excursion(x):
global temple_list, shine_list
temple_west = bisect.bisect_left(temple_list... | p03112 |
A,B,Q = list(map(int, input().split()))
s = [-(10**11)]+[int(eval(input())) for _ in range(A)]+[10**11]
t = [-(10**11)]+[int(eval(input())) for _ in range(B)]+[10**11]
s.sort()
t.sort()
import bisect
import itertools
for _ in range(Q):
pos = int(eval(input()))
s_near_id = bisect.bisect_left(s, pos)-1... | A,B,Q = list(map(int, input().split()))
s = [-(10**11)]+[int(eval(input())) for _ in range(A)]+[10**11]
t = [-(10**11)]+[int(eval(input())) for _ in range(B)]+[10**11]
s.sort()
t.sort()
import bisect
import itertools
for _ in range(Q):
pos = int(eval(input()))
near_s = bisect.bisect_left(s, pos)-1
... | p03112 |
a, b, q = list(map(int, input().split()))
s = [int(eval(input())) for _ in range(a)]
t = [int(eval(input())) for _ in range(b)]
x = [int(eval(input())) for _ in range(q)]
def bs(z, st):
l = 0
r = len(st) - 1
while r - l != 1:
m = (l + r) // 2
if st[m] == z:
return m
... | a, b, q = list(map(int, input().split()))
s = [int(eval(input())) for _ in range(a)]
t = [int(eval(input())) for _ in range(b)]
x = [int(eval(input())) for _ in range(q)]
def bs(z, st):
l = 0
r = len(st) - 1
while r - l != 1:
m = (l + r) // 2
if st[m] <= z:
l = m
... | p03112 |
import bisect
A, B, Q = list(map(int, input().split()))
INF = 10 ** 18
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
for q in range(Q):
x = int(eval(input()))
b, d = bisect.bisect_right(s, x), bisect.bisect_right(t, x)
... | import bisect
a,b,q = list(map(int,input().split()))
shrine = [-10**12, 10**12]
for _ in range(a):
s = int(eval(input()))
shrine.append(s)
shrine.sort()
temple = [-10**12, 10**12]
for _ in range(b):
t = int(eval(input()))
temple.append(t)
temple.sort()
for _ in range(q):
x = int(e... | p03112 |
import bisect
a, b, q = list(map(int, input().split()))
s = [int(eval(input())) for _i in range(a)]
t = [int(eval(input())) for _i in range(b)]
s.append(float('inf'))
s.insert(0, -float('inf'))
t.append(float('inf'))
t.insert(0, -float('inf'))
x = [int(eval(input())) for _i in range(q)]
for i in x:
n = ... | import bisect
a, b, q = list(map(int, input().split()))
s = [int(eval(input())) for _i in range(a)]
t = [int(eval(input())) for _i in range(b)]
s.append(float('inf'))
s.insert(0, -float('inf'))
t.append(float('inf'))
t.insert(0, -float('inf'))
x = [int(eval(input())) for _i in range(q)]
for i in x:
n = ... | p03112 |
def main():
inf = float("INF")
a,b,q = list(map(int, input().split()))
s = [None] * (a + 3)
s[0:2] = [-inf,-inf]
s[-1] = inf
t = [None] * (b + 3)
t[0:2] = [-inf,-inf]
t[-1] = inf
for i in range(a):
s[i+2] = int(eval(input()))
for i in range(b):
t[i+2] = int(eval(input()))
... | def main():
inf = float("INF")
a,b,q = list(map(int, input().split()))
s = [None] * (a + 3)
s[0:2] = [-inf,-inf]
s[-1] = inf
t = [None] * (b + 3)
t[0:2] = [-inf,-inf]
t[-1] = inf
for i in range(a):
s[i+2] = int(eval(input()))
for i in range(b):
t[i+2] = int(eval(input()))
... | p03112 |
import bisect
A, B, Q = list(map(int, input().split()))
s = [0]*(A+4)
t = [0]*(B+4)
for i in range(2, A+2):
s[i] = int(eval(input()))
for i in range(2, B+2):
t[i] = int(eval(input()))
s[0], s[1], s[-2], s[-1] = -10**11-1, -10**11, 10**11, 10**11+1
t[0], t[1], t[-2], t[-1] = -10**11-1, -10**11, ... | from bisect import bisect_right
A, B, Q = list(map(int, input().split()))
INF = 10**18
s = [-INF] + [int(eval(input())) for _ in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for _ in range(B)] + [INF]
for _ in range(Q):
x = int(eval(input()))
sh_r, te_r = bisect_right(s, x), bisect_right(t, x)
... | p03112 |
a,b,q = list(map(int,input().split()))
jinjya = []
otera = []
for i in range(a):
jinjya.append(int(eval(input())))
for i in range(b):
otera.append(int(eval(input())))
def find(arr,tar,start,end):
if start >= end:
return start
bar = (start+end)//2
if arr[bar]<tar:
retu... | import bisect
a,b,q = list(map(int,input().split()))
jinjya = []
otera = []
for i in range(a):
jinjya.append(int(eval(input())))
for i in range(b):
otera.append(int(eval(input())))
INF = 10**18
jinjya = [-INF] + jinjya + [INF]
otera = [-INF] + otera + [INF]
for i in range(q):
res = INF... | p03112 |
import bisect
a, b, q = list(map(int, input().split()))
s, t = [0]*(a+2), [0]*(b+2)
for i in range(a):
s[i+1] = int(eval(input()))
for i in range(b):
t[i+1] = int(eval(input()))
s[0] = -float("inf")
s[-1] = float("inf")
t[0] = -float("inf")
t[-1] = float("inf")
#print(s)
#print(t)
for _ in range(... | import bisect
a, b, q = list(map(int, input().split()))
inf = 10**18
s = [-inf] + [int(eval(input())) for _ in range(a)] + [inf]
t = [-inf] + [int(eval(input())) for _ in range(b)] + [inf]
#print(s)
#print(t)
for _ in range(q):
start = int(eval(input()))
x = bisect.bisect_right(s, start)
y = bisec... | p03112 |
# baseline
class AvlTree: # std::set
def __init__(self, values=None, sorted_=False):
if values is None:
self.left = [-1]
self.right = [-1]
self.values = [-float("inf")]
self.diff = [0] # left - right
self.size_l = [0]
else:
... | # baseline!?
class AvlTree: # std::set
def __init__(self, values=None, sorted_=False):
if values is None:
self.left = [-1]
self.right = [-1]
self.values = [-float("inf")]
self.diff = [0] # left - right
self.size_l = [0]
else:
... | p03112 |
# __slots__
class AvlTree: # std::set
__slots__ = ["left", "right", "values", "diff", "size_l"]
def __init__(self, values=None, sorted_=False):
if values is None:
self.left = [-1]
self.right = [-1]
self.values = [-float("inf")]
self.diff = [0] ... | # _ _
class AvlTree: # std::set
def __init__(self, values=None, sorted_=False):
if values is None:
self.left = [-1]
self.right = [-1]
self.values = [-float("inf")]
self.diff = [0] # left - right
self.size_l = [0]
else:
... | p03112 |
class AvlTree: # std::set
def __init__(self, values=None, sorted_=False):
if values is None:
self.left = [-1]
self.right = [-1]
self.values = [-float("inf")]
self.diff = [0] # left - right
self.size_l = [0]
else:
if n... | class AvlTree: # std::set
def __init__(self, values=None, sorted_=False):
if values is None:
self.left = [-1]
self.right = [-1]
self.values = [-float("inf")]
self.diff = [0] # left - right
self.size_l = [0]
else:
if n... | p03112 |
# クエリ処理部分を改善
class AvlTree: # std::set
def __init__(self, values=None, sorted_=False):
if values is None:
self.left = [-1]
self.right = [-1]
self.values = [-float("inf")]
self.diff = [0] # left - right
self.size_l = [0]
else:
... | # クエリ処理改善2
class AvlTree: # std::set
def __init__(self, values=None, sorted_=False):
if values is None:
self.left = [-1]
self.right = [-1]
self.values = [-float("inf")]
self.diff = [0] # left - right
self.size_l = [0]
else:
... | p03112 |
import bisect
def main():
a,b,q = list(map(int, input().split()))
sl = [int(eval(input())) for _ in range(a)]
tl = [int(eval(input())) for _ in range(b)]
xl = [int(eval(input())) for _ in range(q)]
for x in xl:
ans = 10**11
curr_dist = 0
ind_s = bisect.bisect... | import bisect
import sys
input = sys.stdin.readline
def main():
a,b,q = list(map(int, input().split()))
sl = [int(eval(input())) for _ in range(a)]
tl = [int(eval(input())) for _ in range(b)]
xl = [int(eval(input())) for _ in range(q)]
for x in xl:
ans = 10**11
curr... | p03112 |
from bisect import bisect_left as bl
A,B,Q=list(map(int,input().split()))
S=[]
T=[]
X=[]
for i in range(A):
S.append(int(eval(input())))
for i in range(B):
T.append(int(eval(input())))
def rl(X,a):
ind=bl(X,a)
if ind>=len(X):
return ind-1
return ind
def ll(X,a):
ind=bl(X,a... | from bisect import bisect_left as bl
A,B,Q=list(map(int,input().split()))
S=[]
T=[]
X=[]
INF=10**18
S.append(-INF)
T.append(-INF)
for i in range(A):
S.append(int(eval(input())))
for i in range(B):
T.append(int(eval(input())))
S.append(INF)
T.append(INF)
for i in range(Q):
x=int(eval(input()))... | p03112 |
A,B,Q = list(map(int, input().split()))
S = [int(eval(input())) for i in range(A)]
T = [int(eval(input())) for i in range(B)]
X = [int(eval(input())) for i in range(Q)]
def bs(x, L, ub, lb):
if x < L[0]:
return -1
if x > L[-1]:
return len(L)-1
c = (ub+lb)//2
if ub-lb <= 1:
... | import bisect
A, B, Q = list(map(int, input().split()))
INF = 10 ** 18
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
for q in range(Q):
x = int(eval(input()))
b, d = bisect.bisect_right(s, x), bisect.bisect_right(t, x)
res =... | p03112 |
A, B, Q = list(map(int, input().split()))
INF = 10 ** 18
S = [-INF] + [int(eval(input())) for _ in range(A)] + [INF]
T = [-INF] + [int(eval(input())) for _ in range(B)] + [INF]
X = [int(eval(input())) for _ in range(Q)]
def binary_search(q, A):
l, r = 0, len(A)
while r - l > 1:
mid = (l + r)... | import sys
import bisect
A, B, Q = list(map(int, sys.stdin.readline().split()))
INF = 10 ** 18
S = [-INF] + [int(sys.stdin.readline()) for _ in range(A)] + [INF]
T = [-INF] + [int(sys.stdin.readline()) for _ in range(B)] + [INF]
X = [int(sys.stdin.readline()) for _ in range(Q)]
# def binary_search(q, A):
... | p03112 |
from collections import deque
import bisect
a, b, q = [int(x) for x in input().split()]
s = [int(eval(input())) for i in range(a)]
t = [int(eval(input())) for i in range(b)]
#x = [int(input()) for i in range(q)]
s_que = deque(s)
s_que.appendleft(-10 ** 12)
s_que.append(10 ** 12)
t_que = deque(t)
t_que.a... | #from collections import deque
import bisect
a, b, q = [int(x) for x in input().split()]
s = [-10**12] + [int(eval(input())) for i in range(a)] + [10**12]
t = [-10**12] + [int(eval(input())) for i in range(b)] + [10**12]
#x = [int(input()) for i in range(q)]
#s_que = deque(s)
#s_que.appendleft(-10 ** 12)
#s... | p03112 |
import sys
sys.setrecursionlimit(10000)
def my_search(l, low, high, t):
n = (low+high)//2
if t > l[n]:
low = n
else:
high = n
if high == low + 1:
return low
else:
return my_search(l, low, high, t)
a,b,q = [int(_) for _ in input().split()]
s_l = ... | import bisect
a,b,q = [int(_) for _ in input().split()]
s_l = [-float('inf')]
t_l = [-float('inf')]
x_l = []
for i in range(a):
s_l.append(int(eval(input())))
s_l.append(float('inf'))
for i in range(b):
t_l.append(int(eval(input())))
t_l.append(float('inf'))
for i in range(q):
x_l.append(int... | p03112 |
from bisect import bisect_left, bisect_right
def func(x, y, z):
yi = bisect_right(y, x)
if yi == 0 or yi == len(y):
ans = 0
if yi == len(y):
yi -= 1
ans += abs(y[yi] - x)
x = y[yi]
zi = bisect_right(z, x)
ans += min(abs(z[zi % len(z)] -... | from bisect import bisect_right
a, b, q = list(map(int, input().split()))
INF = 10**11
s = [-INF] + [int(eval(input())) for _ in range(a)] + [INF]
t = [-INF] + [int(eval(input())) for _ in range(b)] + [INF]
for _ in range(q):
x = int(eval(input()))
si = bisect_right(s, x)
ti = bisect_right(t, ... | p03112 |
import bisect
from itertools import product
A,B,Q = list(map(int,input().split()))
s = [int(eval(input())) for i in range(A)]
t = [int(eval(input())) for i in range(B)]
stlist = [s,t]
ab = [A,B]
for i in range(Q):
x = int(eval(input()))
cand = []
for i in range(2):
st = stlist[i]
... | import sys
import bisect
from itertools import product
def input(): return sys.stdin.readline().strip()
A,B,Q = list(map(int,input().split()))
s = [int(eval(input())) for i in range(A)]
t = [int(eval(input())) for i in range(B)]
stlist = [s,t]
ab = [A,B]
for i in range(Q):
x = int(eval(input()))
cand... | p03112 |
import sys
import bisect
from itertools import product
def input(): return sys.stdin.readline().strip()
A,B,Q = list(map(int,input().split()))
s = [int(eval(input())) for i in range(A)]
t = [int(eval(input())) for i in range(B)]
stlist = [s,t]
ab = [A,B]
for i in range(Q):
x = int(eval(input()))
cand... | import sys
import bisect
from itertools import product
def input(): return sys.stdin.readline().strip()
A,B,Q = list(map(int,input().split()))
s = [int(eval(input())) for i in range(A)]
t = [int(eval(input())) for i in range(B)]
stlist = [s,t]
ab = [A,B]
for i in range(Q):
x = int(eval(input()))
cand... | p03112 |
import sys
import bisect
from itertools import product
def input(): return sys.stdin.readline().strip()
A,B,Q = list(map(int,input().split()))
s = [int(eval(input())) for i in range(A)]
t = [int(eval(input())) for i in range(B)]
stlist = [s,t]
ab = [A,B]
for i in range(Q):
x = int(eval(input()))
cand... | import sys
import bisect
from itertools import product
def input(): return sys.stdin.readline().strip()
A,B,Q = list(map(int,input().split()))
s = [int(eval(input())) for i in range(A)]
t = [int(eval(input())) for i in range(B)]
stlist = [s,t]
ab = [A,B]
for i in range(Q):
x = int(eval(input()))
cand... | p03112 |
A, B, Q = list(map(int,input().split()))
ss = [-10**10]+[int(eval(input())) for _ in range(A)]+[2*10**10]
ts = [-10**10]+[int(eval(input())) for _ in range(B)]+[2*10**10]
# xs = [int(input()) for _ in range(Q)]
def binarysearch(ls,x):
n = len(ls)
width = n//2
pos = n//2
while True:
... | from bisect import bisect_right as binarysearch
A, B, Q = list(map(int,input().split()))
ss = [-10**10]+[int(eval(input())) for _ in range(A)]+[2*10**10]
ts = [-10**10]+[int(eval(input())) for _ in range(B)]+[2*10**10]
xs = [int(eval(input())) for _ in range(Q)]
for x in xs:
sind = binarysearch(ss,x)-1
... | p03112 |
def main():
a,b,q = list(map(int,input().split()))
A = []
B = []
for _ in range(a):
A.append(int(eval(input())))
for _ in range(b):
B.append(int(eval(input())))
def search(A,x):
left =0
right = len(A)-1
if x<A[0]:
... | def main():
a,b,q = list(map(int,input().split()))
A = []
B = []
for _ in range(a):
A.append(int(eval(input())))
for _ in range(b):
B.append(int(eval(input())))
def search(A,x):
left =0
right = len(A)-1
if x<A[0]:
... | p03112 |
def main():
a,b,q = list(map(int,input().split()))
A = []
B = []
for _ in range(a):
A.append(int(eval(input())))
for _ in range(b):
B.append(int(eval(input())))
def search(A,x):
left =0
right = len(A)-1
if x<A[0]:
... | import sys
readline = sys.stdin.readline
def main():
a,b,q = list(map(int,readline().split()))
A = [int(readline()) for i in range(a)]
B = [int(readline()) for i in range(b)]
def search(A,x):
left =0
right = len(A)-1
if x<A[0]:
return (float('i... | p03112 |
import bisect
A, B, Q = list(map(int, input().split()))
INF = float('inf')
s = [- INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [- INF] + [int(eval(input())) for i in range(B)] + [INF]
for i in range(Q):
x = int(eval(input()))
b, d = bisect.bisect_left(s, x), bisect.bisect_left(t, x)
... | import bisect
A, B, Q = list(map(int, input().split()))
INF = 10 ** 18
s = [- INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [- INF] + [int(eval(input())) for i in range(B)] + [INF]
for i in range(Q):
x = int(eval(input()))
b, d = bisect.bisect_left(s, x), bisect.bisect_left(t, x)
ans... | p03112 |
import bisect
A, B, Q = list(map(int, input().split()))
s = [None] * A
t = [None] * B
x = [None] * Q
for i in range(A):
s[i] = int(eval(input()))
for i in range(B):
t[i] = int(eval(input()))
for i in range(Q):
x[i] = int(eval(input()))
s.sort()
t.sort()
def calc(s, t, x):
len_s = l... | import bisect
A, B, Q = list(map(int, input().split()))
s = [None] * A
t = [None] * B
x = [None] * Q
for i in range(A):
s[i] = int(eval(input()))
for i in range(B):
t[i] = int(eval(input()))
for i in range(Q):
x[i] = int(eval(input()))
s.sort()
t.sort()
def calc(s, t, x):
len_s = l... | p03112 |
a,b,q = list(map(int, input().split()))
s = [0]*a
t = [0]*b
x = [0]*q
for i in range(a):
s[i] = int(eval(input()))
for i in range(b):
t[i] = int(eval(input()))
for i in range(q):
x[i] = int(eval(input()))
s.sort()
t.sort()
#print(s)
#print(t)
import bisect
for xi in x:
i = bisect.bis... | a,b,q = list(map(int, input().split()))
s = [0]*a
t = [0]*b
x = [0]*q
for i in range(a):
s[i] = int(eval(input()))
for i in range(b):
t[i] = int(eval(input()))
for i in range(q):
x[i] = int(eval(input()))
s.sort()
t.sort()
INT_MAX = 10**11
#print(s)
#print(t)
import bisect
def func(xi)... | p03112 |
from bisect import bisect_left
A, B, Q = list(map(int, input().split()))
s = [int(eval(input())) for _ in range(A)]
t = [int(eval(input())) for _ in range(B)]
x = [int(eval(input())) for _ in range(Q)]
for xx in x:
# 神先
ps_r = 0
s_r = bisect_left(s, xx)
if s_r < A:
ps_r += s[s_r] -... | from bisect import bisect_left
from itertools import product
inf = float('inf')
a, b, q = list(map(int, input().split()))
s = [-inf] + [int(eval(input())) for _ in range(a)] + [inf]
t = [-inf] + [int(eval(input())) for _ in range(b)] + [inf]
x = [int(eval(input())) for _ in range(q)]
for xx in x:
ret ... | p03112 |
from bisect import bisect
A, B, Q = list(map(int, input().split()))
s = [-10**15]
t = [-10**15]
for _ in range(A):
s.append(int(eval(input())))
s.append(10**15)
for _ in range(B):
t.append(int(eval(input())))
t.append(10**15)
x = list(map(int, (eval(input()) for _ in range(Q))))
for y in x:
i ... | from bisect import bisect
A, B, Q = list(map(int, input().split()))
s = [-10**15] + [int(eval(input())) for i in range(A)] + [10**15]
t = [-10**15] + [int(eval(input())) for i in range(B)] + [10**15]
# s = [-10**15]
# t = [-10**15]
# for _ in range(A):
# s.append(int(input()))
# s.append(10**15)
# for _ ... | p03112 |
import bisect
A, B, Q = list(map(int, input().split()))
INF = 10 ** 18
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
for q in range(Q):
x = int(eval(input()))
b, d = bisect.bisect_right(s, x), bisect.bisect_right(t, x)
res = INF
for ... | from bisect import bisect_right
A, B, Q = list(map(int, input().split()))
INF = 10**18
s = [-INF]
t = [-INF]
for _ in range(A):
s.append(int(eval(input())))
s.append(INF)
for _ in range(B):
t.append(int(eval(input())))
t.append(INF)
x = list(map(int, (eval(input()) for _ in range(Q))))
for y in x:... | p03112 |
import bisect
A, B, Q = list(map(int, input().split()))
INF = 10 ** 18
s = [-INF]
t = [-INF]
for _ in range(A):
s.append(int(eval(input())))
s.append(INF)
for _ in range(B):
t.append(int(eval(input())))
t.append(INF)
for q in range(Q):
x = int(eval(input()))
i, j = bisect.bisect_right(s, x)... | from bisect import bisect_right
A, B, Q = list(map(int, input().split()))
INF = 10 ** 18
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
xs = [int(eval(input())) for i in range(Q)]
for x in xs:
b, d = bisect_right(s, x), bisect_right(t, ... | p03112 |
from bisect import bisect_right
A, B, Q = list(map(int, input().split()))
INF = 10 ** 18
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
xs = [int(eval(input())) for i in range(Q)]
for x in xs:
b, d = bisect_right(s, x), bisect_right(t, ... | from bisect import bisect_right
# 入力
A, B, Q = list(map(int, input().split()))
s = [int(eval(input())) for _ in range(A)]
t = [int(eval(input())) for _ in range(B)]
x = [int(eval(input())) for _ in range(Q)]
# 計算の便宜のため番兵を導入
INF = 10 ** 18
S = [-INF] + s + [INF]
T = [-INF] + t + [INF]
# 指定した変位に対する問に二分探索を... | p03112 |
#!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import math
import bisect
import random
def LI(): return list(map(int, input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return list(eval(input()))
def IR(n): return [I() ... | #!usr/bin/env python3
import sys
from collections import defaultdict
from heapq import heappush, heappop
import math
import bisect
import random
def LI(): return list(map(int, input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return list(eval(input()))
def IR(n): ... | p03112 |
#!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return... | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS... | p03112 |
# -*- coding: utf-8 -*-
import sys, re
from collections import deque, defaultdict, Counter
from math import sqrt, hypot, factorial, pi, sin, cos, radians, log10
if sys.version_info.minor >= 5: from math import gcd
else: from fractions import gcd
from heapq import heappop, heappush, heapify, heappushpop
from b... | # -*- coding: utf-8 -*-
import sys, re
from collections import deque, defaultdict, Counter
from math import sqrt, hypot, factorial, pi, sin, cos, radians, log10
if sys.version_info.minor >= 5: from math import gcd
else: from fractions import gcd
from heapq import heappop, heappush, heapify, heappushpop
from b... | p03112 |
# -*- coding: utf-8 -*-
import sys, re
from collections import deque, defaultdict, Counter
from math import sqrt, hypot, factorial, pi, sin, cos, radians, log10
if sys.version_info.minor >= 5: from math import gcd
else: from fractions import gcd
from heapq import heappop, heappush, heapify, heappushpop
from b... | # -*- coding: utf-8 -*-
"""
参考：https://img.atcoder.jp/abc119/editorial.pdf
"""
import sys, re
from collections import deque, defaultdict, Counter
from math import sqrt, hypot, factorial, pi, sin, cos, radians, log10
if sys.version_info.minor >= 5: from math import gcd
else: from fractions import gcd
from ... | p03112 |
# -*- coding: utf-8 -*-
"""
参考：https://img.atcoder.jp/abc119/editorial.pdf
・前計算しないで直接やる版
・INFがfloat('inf')だとダメで10**18にしたらいけた。INF-INFがnanになるからだった。
・上記を考慮して修正版
"""
import sys, re
from collections import deque, defaultdict, Counter
from math import sqrt, hypot, factorial, pi, sin, cos, radians, log10
if sys.... | # -*- coding: utf-8 -*-
import sys
from bisect import bisect_left, bisect_right
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d f... | p03112 |
from bisect import bisect_left, bisect_right
a, b, q = list(map(int, input().split()))
inf = 10**18
shrine = [-inf] + [int(eval(input())) for _ in range(a)] + [inf]
temple = [-inf] + [int(eval(input())) for _ in range(b)] + [inf]
for _ in range(q):
ans = inf
x = int(eval(input()))
index_s = bisect... | from bisect import bisect_left, bisect_right
a, b, q = list(map(int, input().split()))
inf = 10**18
shrine = [-inf] + [int(eval(input())) for _ in range(a)] + [inf]
temple = [-inf] + [int(eval(input())) for _ in range(b)] + [inf]
for _ in range(q):
ans = inf
x = int(eval(input()))
index_s = bisect... | p03112 |
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.se... | from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.se... | p03112 |
import bisect
A,B,Q=list(map(int,input().split()))
INF=10**18
S=[-INF]+[int(eval(input())) for i in range(A)]+[INF]
T=[-INF]+[int(eval(input())) for i in range(B)]+[INF]
for q in range(Q):
x=int(eval(input()))
s=bisect.bisect_right(S,x)
t=bisect.bisect_right(T,x)
d=INF
for i in [S[s-1],S[s... | import bisect
A,B,Q=list(map(int,input().split()))
INF=10**18
S=[-INF]+[int(eval(input())) for i in range(A)]+[INF]
T=[-INF]+[int(eval(input())) for i in range(B)]+[INF]
for q in range(Q):
x=int(eval(input()))
i=bisect.bisect_left(S,x)
j=bisect.bisect_left(T,x)
ans=INF
for s in [S[i-1],S[i... | p03112 |
import bisect
import itertools
A, B, Q = list(map(int, input().split()))
INF = 10 ** 15
S = [-INF] + [int(eval(input())) for _ in range(A)] + [INF]
T = [-INF] + [int(eval(input())) for _ in range(B)] + [INF]
for _ in range(Q):
answer = INF
x = int(eval(input()))
si = bisect.bisect_left(S, x) ... | import bisect
import itertools
A,B,Q = list(map(int,input().split()))
# 簡略化のため常に左右に存在するようにしておく
INF = 10 ** 15
S = [-INF] + [int(eval(input())) for _ in range(A)] + [INF]
T = [-INF] + [int(eval(input())) for _ in range(B)] + [INF]
X = [int(eval(input())) for _ in range(Q)]
def solve(x):
# xの位置
i = bi... | p03112 |
import bisect
import itertools
A,B,Q = list(map(int,input().split()))
# 簡略化のため常に左右に存在するようにしておく
INF = 10 ** 15
S = [-INF] + [int(eval(input())) for _ in range(A)] + [INF]
T = [-INF] + [int(eval(input())) for _ in range(B)] + [INF]
X = [int(eval(input())) for _ in range(Q)]
def solve(x):
# xの位置
i = bi... | # coding: utf-8
import sys
from bisect import bisect_left
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# 番兵を左右に置いて、4通り試す
A, B, Q = lr()
INF = 10 ** 12
S = [-INF] + [ir() for _ in range(A)] + [INF]
T = [-INF] + [ir() for _ in range(B)] + [INF]
... | p03112 |
#!/usr/bin/env python3
import sys
from bisect import bisect_right
def solve(A: int, B: int, Q: int, s: "List[int]", t: "List[int]", x: "List[int]"):
b, d = bisect_right(s, x), bisect_right(t, x)
ret = 10e18
for S in [s[b - 1], s[b]]:
for T in [t[d - 1], t[d]]:
d1, d2 = abs(... | #!/usr/bin/env python3
import sys
from bisect import bisect_right
INF = 10e11
def solve(A: int, B: int, Q: int, s: "List[int]", t: "List[int]", x: "List[int]"):
b, d = bisect_right(s, x), bisect_right(t, x)
ret = INF
for S in [s[b - 1], s[b]]:
for T in [t[d - 1], t[d]]:
d1... | p03112 |
INF = 1e20
A, B, Q = [int(i) for i in input().split()]
S = [-INF] + [int(eval(input())) for _ in range(A)] + [INF]
T = [-INF] + [int(eval(input())) for _ in range(B)] + [INF]
X = [int(eval(input())) for _ in range(Q)]
from bisect import bisect_left
for x in X:
s = bisect_left(S, x)
t = bisect_left... | INF = 1e20
A, B, Q = [int(i) for i in input().split()]
S = [-INF] + [int(eval(input())) for _ in range(A)] + [INF]
T = [-INF] + [int(eval(input())) for _ in range(B)] + [INF]
X = [int(eval(input())) for _ in range(Q)]
from bisect import bisect_left
mins = []
for x in X:
s = bisect_left(S, x)
t = ... | p03112 |
from bisect import bisect
A, B, Q = list(map(int, input().split()))
S, T =[None] * (A+2), [None] * (B+2)
S[0], T[0] = -10**20, -10**20
for i in range(A):
S[i+1] = int(eval(input()))
for i in range(B):
T[i+1] = int(eval(input()))
S[A+1] = 10**20
T[B+1] = 10**20
lenS, lenT = len(S), len(T)
for _ in r... | import sys
from bisect import bisect
F = sys.stdin
A, B, Q = list(map(int, F.readline().strip("\n").split(" ")))
S, T =[None] * (A+2), [None] * (B+2)
S[0], T[0] = -10**20, -10**20
for i in range(A):
S[i+1] = int(F.readline().strip("\n"))
for i in range(B):
T[i+1] = int(F.readline().strip("\n"))
S[A+1]... | p03112 |
A, B, Q = list(map(int, input().split()))
INF = 10 ** 11 + 1
S = [-INF] + [int(eval(input())) for _ in range(A)] + [INF]
T = [-INF] + [int(eval(input())) for _ in range(B)] + [INF]
X = [int(eval(input())) for _ in range(Q)]
def bsr(a, v):
lo, hi = 0, len(a) - 1
while lo <= hi:
mi = (lo + hi) // 2
if ... | A, B, Q = list(map(int, input().split()))
INF = 10 ** 11 + 1
S = [-INF] + [int(eval(input())) for _ in range(A)] + [INF]
T = [-INF] + [int(eval(input())) for _ in range(B)] + [INF]
X = [int(eval(input())) for _ in range(Q)]
def bsr(a, v):
lo, hi = 0, len(a)
while lo < hi:
mi = (lo + hi) // 2
if v < a... | p03112 |
import bisect
A, B, Q = list(map(int, input().split()))
S = [int(eval(input())) for _ in range(A)]
T = [int(eval(input())) for _ in range(B)]
X = [int(eval(input())) for _ in range(Q)]
"""
def bsr(a, v, lo=0, hi=None):
if None == hi:
hi = len(a) - 1
while lo <= hi:
mi = (lo + hi) // 2
if a[mi] <= v... | # お約束
INF = float("inf")
MOD = int(1e9 + 7)
def int1(n):
return int(n) - 1
def parse(args, *params):
return tuple(p(v) for p, v in zip(params, next(args).split()))
from bisect import bisect_right as bsr
# エントリーポイント
def main(args):
A, B, Q = parse(args, int, int, int)
S = list(int(next(arg... | p03112 |
import bisect
A, B, Q = list(map(int,input().split()))
s = [-10**20] + [int(eval(input())) for k in range(A)] + [10**20,10**20]
t = [-10**20] + [int(eval(input())) for k in range(B)] + [10**20,10**20]
for _ in range(Q):
x = int(eval(input()))
print((min(
max(s[bisect.bisect_left(s,x)],t[bisect.... | import bisect
A, B, Q = list(map(int,input().split()))
s = [-10**20] + [int(eval(input())) for k in range(A)] + [10**20,10**20]
t = [-10**20] + [int(eval(input())) for k in range(B)] + [10**20,10**20]
for _ in range(Q):
x = int(eval(input()))
S = bisect.bisect_left(s,x)
T = bisect.bisect_left(t,x)
... | p03112 |
import bisect
A, B, Q = list(map(int,input().split()))
s = [-10**20] + [int(eval(input())) for k in range(A)] + [10**20,10**20]
t = [-10**20] + [int(eval(input())) for k in range(B)] + [10**20,10**20]
for _ in range(Q):
x = int(eval(input()))
S = bisect.bisect_left(s,x)
T = bisect.bisect_left(t,x)
... | import bisect
import sys
def input():
return sys.stdin.readline()[:-1]
def main():
A, B, Q = list(map(int,input().split()))
s = [-10**20] + [int(eval(input())) for k in range(A)] + [10**20,10**20]
t = [-10**20] + [int(eval(input())) for k in range(B)] + [10**20,10**20]
for _ in range(Q):
... | p03112 |
import bisect
A,B,Q=list(map(int,input().split()))
Z=[-10**10]
T=[-10**10]
for i in range(A):
s=int(eval(input()))
Z.append(s)
Z.append(10**11)
for i in range(B):
t=int(eval(input()))
T.append(t)
T.append(10**11)
for i in range(Q):
x=int(eval(input()))
a=max(Z[bisect.bi... | import bisect
import sys
input = sys.stdin.readline
A,B,Q=list(map(int,input().split()))
Z=[-10**10]
T=[-10**10]
for i in range(A):
s=int(eval(input()))
Z.append(s)
Z.append(10**11)
for i in range(B):
t=int(eval(input()))
T.append(t)
T.append(10**11)
for i in range(Q):
x=int... | p03112 |
a,b,q=(input().split())
a,b,q=int(a),int(b),int(q)
s=[int(eval(input())) for i in range(a)]
t=[int(eval(input())) for i in range(b)]
x=[int(eval(input())) for i in range(q)]
dist=['' for i in range(8)]
dist1=['' for i in range(2)]
dist2=['' for i in range(4)]
sp1=['' for i in range(2)]
tp1=['' for i in range(4... | a,b,q=(input().split())
a,b,q=int(a),int(b),int(q)
s=[int(eval(input())) for i in range(a)]
t=[int(eval(input())) for i in range(b)]
x=[int(eval(input())) for i in range(q)]
dist=['' for i in range(8)]
dist1=['' for i in range(2)]
dist2=['' for i in range(4)]
sp1=['' for i in range(2)]
tp1=['' for i in range(4... | p03112 |
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque, OrderedDict
from copy import deepcopy
from functools import lru_cache, reduce
from math import ceil, floor
import heapq
import itertools
import operator
inf = float('inf')
def get_int():
return int(... | from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque, OrderedDict
from copy import deepcopy
from functools import lru_cache, reduce
from math import ceil, floor
import heapq
import itertools
import operator
inf = float('inf')
def get_int():
return int(... | p03112 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI():... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI():... | p03112 |
import bisect
a, b, q = list(map(int, input().split()))
s = sorted([int(eval(input())) for _ in range(a)])
t = sorted([int(eval(input())) for _ in range(b)])
for _ in range(q):
x = int(eval(input()))
s_i = bisect.bisect_left(s, x)
t_i = bisect.bisect_left(t, x)
s0, s1, t0, t1 = None, None,... | import bisect
import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines
a, b, q = list(map(int, input().split()))
s = sorted([int(eval(input())) for _ in range(a)])
t = sorted([int(eval(input())) for _ in range(b)])
for _ in range(q):
x = int(eval(i... | p03112 |
# D
a, b, q = list(map(int, input().split()))
s = [int(eval(input())) for i in range(a)]
t = [int(eval(input())) for i in range(b)]
x = [int(eval(input())) for i in range(q)]
def route(start, mid, end):
return abs(start-mid) + abs(mid-end)
for i in range(q):
ans = 10000000000000000000000000
# j... | import bisect
A, B, Q = list(map(int, input().split()))
INF = 10 ** 18
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
for q in range(Q):
x = int(eval(input()))
b, d = bisect.bisect_right(s, x), bisect.bisect_right(t, x)
res = I... | p03112 |
import bisect
def calc_distance(frm, x, y):
#frmからx, yのに地点を通るのに必要な距離を計算する
return min(abs(frm - x), abs(frm - y) ) + abs(x - y)
def calc_both_end(frm, us):
#地点frmに囲まれた2点を返す。
#片側しか囲われていない場合は最寄の2点
if len(us) == 1:
return us[0], us[0]
idx = bisect.bisect_left(us, frm)
if idx == 0:
return us[0], ... | import bisect
def calc_distance(frm, x, y):
return min(abs(frm - x), abs(frm - y) ) + abs(x - y)
def calc_2points(frm, us):
idx = bisect.bisect_left(us, frm)
return us[idx - 1], us[idx]
def calc_min(ss, ts, x):
s1, s2 = calc_2points(x, ss)
t1, t2 = calc_2points(x, ts)
ans = min(calc_distance(x, s1,... | p03112 |
import bisect
a, b, q = list(map(int, input().split()))
INF = 10 ** 18
s = [-INF] + [int(eval(input())) for i in range(a)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(b)] + [INF]
ans = []
for i in range(q):
x = int(eval(input()))
idxs = bisect.bisect(s, x)
idxt = bisect.bisect(t, x)
... | import bisect
import sys
input = sys.stdin.readline
a, b, q = list(map(int, input().split()))
INF = 10 ** 18
s = [-INF] + [int(eval(input())) for i in range(a)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(b)] + [INF]
ans = []
for i in range(q):
x = int(eval(input()))
idxs = bisect.bisect(s... | p03112 |
import bisect
import sys
input = sys.stdin.readline
a, b, q = list(map(int, input().split()))
INF = 10 ** 18
s = [-INF] + [int(eval(input())) for i in range(a)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(b)] + [INF]
ans = []
for i in range(q):
x = int(eval(input()))
idxs = bisect.bisect(s... | import bisect
import sys
input = sys.stdin.readline
a, b, q = list(map(int, input().split()))
INF = 10 ** 18
s = [-INF] + [int(eval(input())) for i in range(a)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(b)] + [INF]
ans = []
for i in range(q):
x = int(eval(input()))
idxs = bisect.bisect(s... | p03112 |
import bisect
import sys
input = sys.stdin.readline
a, b, q = list(map(int, input().split()))
INF = 10 ** 18
s = [-INF] + [int(eval(input())) for i in range(a)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(b)] + [INF]
ans = []
for i in range(q):
x = int(eval(input()))
idxs = bisect.bisect(s... | import bisect
import sys
input = sys.stdin.readline
a, b, q = list(map(int, input().split()))
INF = 10 ** 18
s = [-INF] + [int(eval(input())) for i in range(a)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(b)] + [INF]
ans = []
for i in range(q):
x = int(eval(input()))
idxs = bisect.bisect(s... | p03112 |
import bisect
a,b,q = list(map(int,input().split()))
INF = 10**18
s=[-INF]+[int(eval(input())) for _ in range(a)]+[INF]
t=[-INF]+[int(eval(input())) for _ in range(b)]+[INF]
def dis(x,p,q):
return min(abs(x-s[p])+abs(s[p]-t[q]),abs(x-t[q])+abs(s[p]-t[q]))
def kai(x):
res = INF
s1 = bisect.bisec... | import bisect
a,b,q = list(map(int,input().split()))
INF = 10**18
s=[-INF]+[int(eval(input())) for _ in range(a)]+[INF]
t=[-INF]+[int(eval(input())) for _ in range(b)]+[INF]
def kai(x):
res = INF
s1 = bisect.bisect_right(s,x)
ls = [s1,s1 - 1]
t1 = bisect.bisect_right(t,x)
lt = [t1,t1 - 1... | p03112 |
a, b, q = [int(i) for i in input().split()]
s = [-float('inf')] + [int(eval(input())) for _ in range(a)] + [float('inf')]
t = [-float('inf')] + [int(eval(input())) for _ in range(b)] + [float('inf')]
x = [int(eval(input())) for _ in range(q)]
for xx in x:
low = 0
high = len(s)-1
mid = (low+high)//2
... | def search(x,r):
low = 0
high = len(r) - 1
while low < high:
mid = (low+high)//2
if x < r[mid]:
high = mid
else:
low = mid + 1
return(abs(r[low-1]-x),abs(r[low]-x))
a, b, q = [int(i) for i in input().split()]
s = [-float('inf')] + [int(eval(input())) for _ in range(a)]... | p03112 |
(a, b, q) = list(map(int, input().split()))
s = [int(eval(input())) for _ in range(a)]
t = [int(eval(input())) for _ in range(b)]
x = [int(eval(input())) for _ in range(q)]
def find_left_and_right(st, pos):
for i, s_i in enumerate(st):
if s_i - pos > 0:
return (i-1, i)
return (le... | import bisect
(a, b, q) = list(map(int, input().split()))
s = [-10 ** 19]
for _ in range(a):
s.append(int(eval(input())))
s.append(10 ** 19)
t = [-10 ** 19]
for _ in range(b):
t.append(int(eval(input())))
t.append(10 ** 19)
x = [int(eval(input())) for _ in range(q)]
for x_i in x:
ss = bisect... | p03112 |
import sys
from bisect import bisect_left
inpurt = sys.stdin.readline
a, b, q = list(map(int, input().split()))
INF = 10 ** 11
s = [-INF]
for i in range(a):
si = int(eval(input()))
s.append(si)
s.append(INF)
t = [-INF]
for i in range(b):
ti = int(eval(input()))
t.append(ti)
t.append(INF)
... | import sys
from bisect import bisect_left
inpurt = sys.stdin.readline
a, b, q = list(map(int, input().split()))
INF = 10 ** 11
s = [-INF]
s_append = s.append
for i in range(a):
si = int(eval(input()))
s_append(si)
s_append(INF)
t = [-INF]
t_append = t.append
for i in range(b):
ti = int(eval(in... | p03112 |
import sys
from bisect import bisect_left
inpurt = sys.stdin.readline
a, b, q = list(map(int, input().split()))
INF = 10 ** 11
s = [-INF]
s_append = s.append
for i in range(a):
si = int(eval(input()))
s_append(si)
s_append(INF)
t = [-INF]
t_append = t.append
for i in range(b):
ti = int(eval(in... | import sys
from bisect import bisect_left
inpurt = sys.stdin.readline
a, b, q = list(map(int, input().split()))
INF = 10 ** 11
s = [-INF] + [int(eval(input())) for _ in range(a)] + [INF]
t = [-INF] + [int(eval(input())) for _ in range(b)] + [INF]
x = [int(eval(input())) for _ in range(q)]
for xi in x:
in... | p03112 |
A=list(map(int,input().split()))
S,T,X=[[int(eval(input())) for i in range(A[j])] for j in range(3)]
def binary(a,l,):
low=0
high=len(l)-1
while high-low>1:
mid=(low+high)//2
if l[mid]<a:
low=mid
else:
high=mid
return [l[high],l[low]]
for x in X:
s=set(binary(x,S))
t=set(binary(x,T)... | import sys
input=sys.stdin.readline
A=list(map(int,input().split()))
S,T,X=[[int(eval(input())) for i in range(A[j])] for j in range(3)]
def binary(a,l,):
low=0
high=len(l)-1
while high-low>1:
mid=(low+high)//2
if l[mid]<a:
low=mid
else:
high=mid
return [l[high],l[low]]
for x in X:
... | p03112 |
from bisect import bisect_left
A, B, Q = list(map(int, input().split()))
S = [int(eval(input())) for _ in range(A)]
T = [int(eval(input())) for _ in range(B)]
Q = [int(eval(input())) for _ in range(Q)]
for q in Q:
ps = bisect_left(S, q)
if ps == len(S):
s1, s2 = S[ps - 1], S[ps - 1]
e... | from bisect import bisect_left
INF = 10 ** 12
A, B, Q = list(map(int, input().split()))
S = [-INF] + [int(eval(input())) for _ in range(A)] + [INF]
T = [-INF] + [int(eval(input())) for _ in range(B)] + [INF]
Q = [int(eval(input())) for _ in range(Q)]
for q in Q:
ps = bisect_left(S, q)
s1, s2 = S... | p03112 |
A, B, Q = list(map(int, input().split()))
s = [int(eval(input())) for _ in range(A)]
t = [int(eval(input())) for _ in range(B)]
x = [int(eval(input())) for _ in range(Q)]
inf = 10 ** 18
s = [-inf] + s + [inf]
t = [-inf] + t + [inf]
ans_Q = [None] * Q
i_last = j_last = 0
for idx, x_tmp in sorted(enumerate(x... | import sys, bisect
input = sys.stdin.readline
A, B, Q = list(map(int, input().split()))
s = [int(eval(input())) for _ in range(A)]
t = [int(eval(input())) for _ in range(B)]
x = [int(eval(input())) for _ in range(Q)]
inf = 10 ** 18
s = [-inf] + s + [inf]
t = [-inf] + t + [inf]
ans_Q = [None] * Q
i_last = ... | p03112 |
import bisect
A, B, Q = list(map(int, input().split()))
s = []
for i in range(A):
s.append(int(eval(input())))
t = []
for i in range(B):
t.append(int(eval(input())))
x = []
for i in range(Q):
x.append(int(eval(input())))
for i in range(Q):
sx, tx, sy, ty = [], [], [], []
for j in s:... | import bisect
A, B, Q = list(map(int, input().split()))
INF = 10**18
S = [-INF]
for i in range(A):
S.append(int(eval(input())))
S.append(INF)
T = [-INF]
for i in range(B):
T.append(int(eval(input())))
T.append(INF)
X = []
for i in range(Q):
X.append(int(eval(input())))
for x in X:
a, ... | p03112 |
import bisect
A, B, Q = list(map(int, input().split()))
INF = 10 ** 18
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
for q in range(Q):
x = int(eval(input()))
b, d = bisect.bisect_left(s, x), bisect.bisect_left(t, x)
res = INF
fo... | import bisect
A, B, Q = list(map(int, input().split()))
INF = 10 ** 18
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
for q in range(Q):
x = int(eval(input()))
b, d = bisect.bisect_right(s, x), bisect.bisect_right(t, x)
res = INF
... | p03112 |
from bisect import bisect
A,B,Q = map(int,input().split())
S = [int(input()) for i in range(A)]
T = [int(input()) for i in range(B)]
qs = [int(input()) for i in range(Q)]
st = []
for s in S:
ti = bisect(T,s)
if ti == 0:
st.append(abs(s-T[0]))
elif ti == B:
st.append(abs(s-T[-1])... | import sys
input = sys.stdin.readline
from bisect import bisect
A,B,Q = map(int,input().split())
S = [int(input()) for i in range(A)]
T = [int(input()) for i in range(B)]
X = [int(input()) for i in range(Q)]
INF = float('inf')
st = []
for s in S:
i = bisect(T,s)
x0,x1 = -INF,INF
if i > 0: x0... | p03112 |
import bisect
def main():
A, B, Q = list(map(int, input().split()))
s = list(int(eval(input())) for _ in range(A))
t = list(int(eval(input())) for _ in range(B))
sort_s = sorted(s)
sort_t = sorted(t)
for _ in range(Q):
x = int(eval(input()))
s_near = bisect.bisect_le... | import bisect
import sys
input = sys.stdin.readline
def main():
A, B, Q = list(map(int, input().split()))
s = list(int(eval(input())) for _ in range(A))
t = list(int(eval(input())) for _ in range(B))
sort_s = sorted(s)
sort_t = sorted(t)
for _ in range(Q):
x = int(eval(inpu... | p03112 |
import bisect
A, B, Q = list(map(int, input().split()))
shrines = []
for i in range(A):
shrines.append(int(eval(input())))
temples = []
for i in range(B):
temples.append(int(eval(input())))
shortest_s_to_t = {}
for shrine in shrines:
index = bisect.bisect_left(temples, shrine)
if inde... | import bisect
import sys
def input():
return sys.stdin.readline()
A, B, Q = list(map(int, input().split()))
shrines = []
for i in range(A):
shrines.append(int(eval(input())))
temples = []
for i in range(B):
temples.append(int(eval(input())))
shortest_s_to_t = {}
for shrine in shrines:
... | p03112 |
# -*- coding: utf-8 -*-
"""
D - Lazy Faith
https://atcoder.jp/contests/abc119/tasks/abc119_d
"""
import sys
from bisect import bisect_left, bisect_right
def solve(x):
i = bisect_right(shrines, x)
ds = x - shrines[i-1]
j = bisect_right(temples, x)
dt = x - temples[j-1]
ans1 = max(ds, ... | # -*- coding: utf-8 -*-
"""
D - Lazy Faith
https://atcoder.jp/contests/abc119/tasks/abc119_d
"""
import sys
from bisect import bisect_left, bisect_right
def solve(x):
i = bisect_right(shrines, x)
s_left = x - shrines[i-1]
j = bisect_right(temples, x)
t_left = x - temples[j-1]
i = b... | p03112 |
#coding:utf-8
import bisect,math
import multiprocessing
A,B,Q=list(map(int,input().split()))
s=[0]*A
t=[0]*B
for i in range(A):
s[i]=eval(input())
for i in range(B):
t[i]=eval(input())
buf=[]
def f(x):
sl=bisect.bisect_left(s,x)-1
sr=sl+1
tl=bisect.bisect_left(t,x)-1
tr=tl+1
... | #coding:utf-8
import bisect,sys
A,B,Q=list(map(int,input().split()))
s=[0]*A
t=[0]*B
for i in range(A):
s[i]=int(sys.stdin.readline())
for i in range(B):
t[i]=int(sys.stdin.readline())
buf=[]
def f(x):
sl=bisect.bisect_left(s,x)-1
sr=sl+1
tl=bisect.bisect_left(t,x)-1
tr=tl+1
... | p03112 |
import bisect
import sys
A, B, Q = list(map(int,input().split()))
s = [-(10**18)] + list(map(int, (sys.stdin.readline() for _ in [0]*A))) + [10**18]
t = [-(10**18)] + list(map(int, (sys.stdin.readline() for _ in [0]*B))) + [10**18]
def solve(s,t,x):
ans = 10**18
for i in range(2):
a, b = (... | import bisect
import sys
A, B, Q = list(map(int,input().split()))
s = tuple([-(10**18)] + list(map(int, (sys.stdin.readline() for _ in [0]*A))) + [10**18])
t = tuple([-(10**18)] + list(map(int, (sys.stdin.readline() for _ in [0]*B))) + [10**18])
def solve(s,t,x):
ans = 10**18
for i in range(2):
... | p03112 |
import bisect
import sys
A, B, Q = list(map(int,input().split()))
s = tuple([-(10**18)] + list(map(int, (sys.stdin.readline() for _ in [0]*A))) + [10**18])
t = tuple([-(10**18)] + list(map(int, (sys.stdin.readline() for _ in [0]*B))) + [10**18])
def solve(s,t,x):
ans = 10**18
for i in range(2):
... | import bisect
import sys
A, B, Q = map(int,input().split())
s = tuple([-(10**18)] + list(map(int, (sys.stdin.readline() for _ in [0]*A))) + [10**18])
t = tuple([-(10**18)] + list(map(int, (sys.stdin.readline() for _ in [0]*B))) + [10**18])
def solve(s,t,x):
ans = 10**18
for i in range(2):
... | p03112 |
from bisect import bisect_right
A, B, Q = list(map(int, input().split()))
BIG = 10**10 + 1
S = [-BIG] + [int(eval(input())) for _ in range(A)] + [BIG*2]
T = [-BIG] + [int(eval(input())) for _ in range(B)] + [BIG*2]
for _ in range(Q):
x = int(eval(input()))
shrine_b = bisect_right(S, x)
dsl = x-S[shrine_b-... | from bisect import bisect_left
A, B, Q = list(map(int, input().split()))
BIG = 10**10 + 1
S = [-BIG] + sorted([int(eval(input())) for _ in range(A)]) + [BIG*2]
T = [-BIG] + sorted([int(eval(input())) for _ in range(B)]) + [BIG*2]
for _ in range(Q):
x = int(eval(input()))
shrine_b = bisect_left(S, x)
shrin... | p03112 |
A, B, Q = list(map(int, input().split()))
s = [int(eval(input())) for i in range(A)]
t = [int(eval(input())) for i in range(B)]
X = [int(eval(input())) for i in range(Q)]
for x in X:
s_min = A-1
for i in range(A):
if s[i] > x:
s_min = i-1
break
t_min = B-1
fo... | import bisect
A, B, Q = list(map(int, input().split()))
INF = 10**18
s = [-INF]+[int(eval(input())) for i in range(A)]+[INF]
t = [-INF]+[int(eval(input())) for i in range(B)]+[INF]
X = [int(eval(input())) for i in range(Q)]
for x in X:
s_min = bisect.bisect_left(s, x)
t_min = bisect.bisect_left(t, x... | p03112 |
from bisect import bisect_left,bisect_right
A,B,Q = list(map(int,input().split()))
S = []
T = []
for i in range(A):
S.append(int(eval(input())))
for i in range(B):
T.append(int(eval(input())))
for i in range(Q):
x = int(eval(input()))
values = []
p1 = bisect_left(S,x)
if p1 == 0:
... | from bisect import bisect_left,bisect_right
import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__
A,B,Q = list(map(int,input().split()))
S = []
T = []
for i in range(A):
S.append(int(eval(input())))
for i in range(B):
T.append(int(eval(input())))
for i in range(Q):
x = int(... | p03112 |
# coding: utf-8
# Your code here!
A,B,Q=list(map(int,input().split()))
def bisearch(target,lis):
low=0
high=len(lis)-1
if lis[0]>target:
return low-1
elif lis[-1]<target:
return high
while lis[low]>target or lis[low+1]<target:
mid=(low+high)//2
if ... | # coding: utf-8
# Your code here!
import bisect
A,B,Q=list(map(int,input().split()))
god=[-10**18]
for _ in range(A):
god.append(int(eval(input())))
god.append(10**18)
buddha=[-10**18]
for _ in range(B):
buddha.append(int(eval(input())))
buddha.append(10**18)
#print(god,buddha)
for _ in ran... | p03112 |
A, B, Q = [int(_) for _ in input().split()]
S = [int(eval(input())) for i in range(A)]
T = [int(eval(input())) for i in range(B)]
Q = [int(eval(input())) for i in range(Q)]
#print(S, T, Q)
def calc_m(xs):
return [(a + b) / 2 for a, b in zip(xs, xs[1:])]
sm = calc_m(S)
tm = calc_m(T)
#print(sm)
#pr... | A, B, Q = [int(_) for _ in input().split()]
S = [int(eval(input())) for i in range(A)]
T = [int(eval(input())) for i in range(B)]
Q = [int(eval(input())) for i in range(Q)]
import bisect
def calc_nearest_distance(xs, ys):
result = []
for x in xs:
i = bisect.bisect(ys, x)
if i == 0:
... | p03112 |
import bisect
import itertools
import sys
A, B, Q = list(map(int, input().split()))
s = [int(eval(input())) for _ in range(A)]
t = [int(eval(input())) for _ in range(B)]
x = [int(eval(input())) for _ in range(Q)]
def most_simRL(ds, x):
index = bisect.bisect_left(ds, x)
if index == 0:
ret... | import bisect
import itertools
import sys
A, B, Q = list(map(int, input().split()))
s = [int(eval(input())) for _ in range(A)]
t = [int(eval(input())) for _ in range(B)]
X = [int(eval(input())) for _ in range(Q)]
def most_simRL(ds, x):
index = bisect.bisect_left(ds, x)
if index == 0:
ret... | p03112 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.