input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from collections import defaultdict
import sys
input = sys.stdin.readline
N = int(eval(input()))
a = list(map(int, input().split()))
pow2 = [1]
for i in range(31):
pow2.append(pow2[-1] * 2)
a = sorted(a, reverse=True)
d = defaultdict(int)
for i in a:
d[i] += 1
num = 0
for i in range(N):
if... | from collections import defaultdict
import sys
input = sys.stdin.readline
N = int(eval(input()))
a = list(map(int, input().split()))
pow2 = [1]
for i in range(31):
pow2.append(pow2[-1] * 2)
a = sorted(a, reverse=True)
d = defaultdict(int)
for i in a:
d[i] += 1
num = 0
for i in range(N):
if... | p03201 |
from collections import Counter
def larger_nibeki(i):
return 2 ** len(format(i, "b"))
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort(reverse=True)
ans = 0
c = Counter(a)
#print(larger_nibeki(n))
for i in range(n):
if c[a[i]] == 0:
continue
else:
c[a[i]] -= 1
if c[larger_n... | from collections import Counter
def larger_nibeki(i):
return 2 ** len(format(i, "b"))
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort(reverse=True)
ans = 0
c = Counter(a)
for i in range(n):
if c[a[i]] == 0:
continue
else:
c[a[i]] -= 1
if c[larger_nibeki(a[i]) - a[i]] > 0:
... | p03201 |
from bisect import bisect
N = int(eval(input()))
*A, = list(map(int, input().split()))
B = {}
for a in A:
B[a] = B.get(a, 0) + 1
R = sorted(B.items())
C = []; D = []
for k, v in sorted(B.items()):
C.append(k)
D.append(v)
M = len(C)
j = 0
ans = 0
for i in range(M-1, -1, -1):
if D[i] == 0:
... | from bisect import bisect
N = int(eval(input()))
*A, = list(map(int, input().split()))
B = {}
for a in A:
B[a] = B.get(a, 0) + 1
R = sorted(B.items())
C = []; D = []
for k, v in sorted(B.items()):
C.append(k)
D.append(v)
M = len(C)
j = 0
ans = 0
for i in range(M-1, -1, -1):
if D[i] == 0:
... | p03201 |
def main():
from collections import Counter
import sys
input = sys.stdin.buffer.readline
_ = int(eval(input()))
A = [int(i) for i in input().split()]
ans = 0
c = Counter(A)
B = sorted(list(c.keys()), reverse=True)
for b in B:
if c[b] == 0:
continu... | def main():
from collections import Counter
import sys
input = sys.stdin.buffer.readline
_ = int(eval(input()))
A = [int(i) for i in input().split()]
ans = 0
c = Counter(A)
B = sorted(list(c.keys()), reverse=True)
for b in B:
if c[b] == 0:
continu... | p03201 |
import bisect
from collections import defaultdict
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
memo = defaultdict(int)
for i in range(n):
memo[a[i]] += 1
count = 0
for t in reversed(list(range(1, 31))):
for i in reversed(list(range(n))):
if memo[a[i]] == 0:
... | from collections import defaultdict
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
memo = defaultdict(int)
for i in range(n):
memo[a[i]] += 1
count = 0
for i in reversed(list(range(n))):
if memo[a[i]] == 0:
continue
if (memo[(1 << (len(bin(a[i])) - 2)) - a[i]] >... | p03201 |
#!/usr/bin/env python3
import sys, os
try: from typing import Any, Union, List, Tuple, Dict
except ImportError: pass
sys.setrecursionlimit(10**6)
def debug(*args): True if os.environ.get("USER")=="shun" else None
def exit(): sys.exit(0)
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
m... | #!/usr/bin/env python3
import sys, os
try: from typing import Any, Union, List, Tuple, Dict
except ImportError: pass
sys.setrecursionlimit(10**6)
def debug(*args): pass # if os.environ.get("USER")=="shun" else None
def exit(): sys.exit(0)
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
... | p03201 |
n = int(eval(input()))
A = list(map(int,input().split()))
A.append(-float("inf"))
n = len(A)
A.sort()
s = 2
while s <= A[-1]+A[-2]:
s *= 2
s //= 2
U = [0] * n
ans = 0
while s > 0:
ll = 0
rr = n-1
while rr >= 1 and rr-ll >= 2:
# print("rr",rr,"ll",ll)
t = s - A[rr]
... | n = int(eval(input()))
A = list(map(int,input().split()))
A.append(-float("inf"))
n = len(A)
A.sort()
s = 2
while s <= A[-1]+A[-2]:
s *= 2
s //= 2
U = [0] * n
ans = 0
while s > 0:
ll = 0
rr = n-1
while rr >= 1 and s <= A[rr]:
rr -= 1
while rr >= 1 and rr-ll >= 2:
... | p03201 |
import collections
N = eval(input())
A = list(map(int, input().split()))
C = collections.Counter(A)
K = list(C.keys())
K.sort(reverse=1)
res = 0
for i in K:
for j in range(60):
p = 2 ** j
if i > p:
continue
elif i == p:
res += C[i] // 2
C[i... | import collections
N = eval(input())
A = list(map(int, input().split()))
C = collections.Counter(A)
K = list(C.keys())
K.sort(reverse=1)
res = 0
for i in K:
for j in range(60):
p = 2 ** j
if i <= p:
break
if i == p:
res += C[i] // 2
C[i] = C[i] // 2 * 2
... | p03201 |
from bisect import bisect_right
n = int(eval(input()))
d = {}
amax = 0
for a in map(int, input().split()):
if a in d:
d[a] += 1
else:
d[a] = 1
amax = max(d.keys())
t = 1
valids = []
while t < 2 * amax:
t *= 2
valids.append(t)
result = 0
while True:
prev = result
keys = list(sorted(... | from bisect import bisect_right
n = int(eval(input()))
d = {}
for a in map(int, input().split()):
if a in d:
d[a] += 1
else:
d[a] = 1
amax = max(d.keys())
t = 1
valids = []
while t < 2 * amax:
t *= 2
valids.append(t)
result = 0
keys = list(sorted(list(d.keys()), reverse = True))
for a in... | p03201 |
from bisect import bisect_right
n = int(eval(input()))
d = {}
for a in map(int, input().split()):
if a in d:
d[a] += 1
else:
d[a] = 1
alist = list(sorted(list(d.keys()), reverse = True))
amax = alist[0]
t = 1
power_of_two = []
while t < 2 * amax:
t *= 2
power_of_two.append(t)
result = 0
... | from bisect import bisect_right
n = int(eval(input()))
d = {}
for a in map(int, input().split()):
if a in d:
d[a] += 1
else:
d[a] = 1
alist = list(sorted(list(d.keys()), reverse = True))
amax = alist[0]
t = 1
power_of_two = []
while t < 2 * amax:
t *= 2
power_of_two.append(t)
result = 0
... | p03201 |
from bisect import bisect_right
n = int(eval(input()))
d = {}
for a in map(int, input().split()):
if a in d:
d[a] += 1
else:
d[a] = 1
alist = list(sorted(list(d.keys()), reverse = True))
amax = alist[0]
t = 1
power_of_two = []
while t < 2 * amax:
t *= 2
power_of_two.append(t)
result = 0
... | from bisect import bisect_right
n = int(eval(input()))
d = {}
for a in map(int, input().split()):
if a in d:
d[a] += 1
else:
d[a] = 1
alist = list(sorted(list(d.keys()), reverse = True))
amax = alist[0]
t = 1
power_of_two = []
while t < 2 * amax:
t *= 2
power_of_two.append(t)
result = 0
... | p03201 |
from bisect import bisect_right
n = int(eval(input()))
d = {}
for a in map(int, input().split()):
if a in d:
d[a] += 1
else:
d[a] = 1
alist = list(sorted(list(d.keys()), reverse = True))
amax = alist[0]
t = 1
power_of_two = []
while t < 2 * amax:
t *= 2
power_of_two.append(t)
result = 0
... | from bisect import bisect_right
n = int(eval(input()))
d = {}
for a in map(int, input().split()):
if a in d:
d[a] += 1
else:
d[a] = 1
alist = list(sorted(list(d.keys()), reverse = True))
amax = alist[0]
t = 1
power_of_two = []
while t < 2 * amax:
t *= 2
power_of_two.append(t)
result = 0
... | p03201 |
N = int(eval(input()))
A_list = list(map(int, input().split()))
two_list = [2 ** i for i in range(32)]
count = 0
items = {}
for a in A_list:
if a in items:
items[a] += 1
else:
items[a] = 1
A_list.sort(reverse=True)
for a in A_list:
if items[a] >= 1:
for t in two... | N = int(eval(input()))
A_list = list(map(int, input().split()))
two_list = [2 ** i for i in range(32)]
count = 0
items = {}
for a in A_list:
if a in list(items.keys()):
items[a] += 1
else:
items[a] = 1
A_list.sort(reverse=True)
import bisect
for a in A_list:
if items[a] >= 1... | p03201 |
N = int(input().rstrip())
A = [int(s) for s in input().rstrip().split()]
A.sort()
squared = [2]
tmp = 2
while tmp < 2 * 10**9:
tmp *= 2
squared.append(tmp)
pairs = []
for i in range(N):
for j in range(i+1, N):
if A[i] + A[j] in squared:
pairs.append([A[i], A[j]])
adopt... | N = int(input().rstrip())
A = [int(s) for s in input().rstrip().split()]
A.sort()
squared = [2]
tmp = 2
while tmp < 2 * 10**9:
tmp *= 2
squared.append(tmp)
cnt = 0
while A:
max_num = A.pop()
for i in range(len(A)):
if max_num + A[i] in squared:
cnt += 1
... | p03201 |
N=int(eval(input()))
a=list(map(int,input().split()))
a_=sorted(a,key=lambda x:-x)
ans=0
from collections import Counter
c=Counter(a_)
for i in a_:
if c[i]==0:
continue
c[i]-=1
for n in range(i):
if i<2**n:
t=n
break
elif i==2**n:
t=... | N=int(eval(input()))
a=list(map(int,input().split()))
a_=sorted(a,key=lambda x:-x)
ans=0
from collections import Counter
c=Counter(a_)
for i in a_:
if c[i]==0:
continue
c[i]-=1
m=1<<i.bit_length()
j=m-i
if j in c and c[j]>0:
ans+=1
c[j]-=1
print(ans) | p03201 |
N = int(eval(input()))
A = [int(a) for a in input().split()]
A.sort()
used = [0]*N
import bisect
ans = 0
for i in range(N-1, -1, -1):
if used[i] == 1:
continue
num = pow(2, len(bin(A[i]))-2) - A[i]
idx = bisect.bisect_left(A, num)
while idx < i and used[idx] == 1:
idx +... | N = int(eval(input()))
A = [int(a) for a in input().split()]
dic = {}
for a in A:
if a in dic:
dic[a] += 1
else:
dic[a] = 1
A.sort(reverse=True)
ans = 0
for a in A:
if dic[a] == 0:
continue
dic[a] -= 1
num = pow(2, len(bin(a))-2) - a
if num in d... | p03201 |
import math
N = int(eval(input()))
a = list(map(int,input().split()))
count = 0
a.sort()
a.reverse()
while(a!=[]):
temp = a[0]
a.pop(0)
b=2**math.floor(math.log2(temp))
if a ==[]:
break
if 2*b-temp in a:
count += 1
a.pop(a.index(2*b-temp))
... | n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
b = {}
for i in range(len(a)):
if a[i] in b:
b[a[i]] += 1
else:
b[a[i]] = 1
twins = []
now = 1
while now <= a[-1]:
now *= 2
twins.append(now)
for i in range(len(a) - 1, -1, -1):
tmpa = 0
if b[a[i... | p03201 |
import queue
N=int(eval(input()))
A=sorted([int(i) for i in input().split()],reverse=True)
B=[2**(len(bin(i))-2) for i in A]
R=[0 for i in range(N)]
D=dict()
for i in range(N):
if not(A[i] in D):
D[A[i]]=queue.Queue()
D[A[i]].put(i)
ans=0
for i in range(N):
if R[i]==1:
continue
... | N=int(eval(input()))
A=sorted([int(i) for i in input().split()],reverse=True)
B=[2**(len(bin(i))-2) for i in A]
D=dict()
for i in range(N):
if not(A[i] in D):
D[A[i]]=1
else:
D[A[i]]+=1
ans=0
for i in range(N):
if D[A[i]]<=0:
continue
if B[i]==2*A[i]:
if D[A... | p03201 |
# https://beta.atcoder.jp/contests/agc029/submissions/3804087
from collections import Counter
N = int(eval(input()))
a = list(map(int, input().split()))
a = sorted(a, reverse=True)
b = Counter(a)
ans = 0
for t in a:
if b[t] == 0: continue
s = (1 << t.bit_length()) - t
if t == s:
ans +... | N = int(eval(input()))
a = list(map(int, input().split()))
a = sorted(a, reverse=True)
cnt = {}
for n in a:
cnt[n] = cnt.get(n, 0) + 1
ans = 0
for n in a:
g = 2 ** n.bit_length()
s = g - n
if n == s:
pair = cnt.get(s, 0) // 2
ans += pair
cnt[s] = cnt.get(s, 0) % ... | p03201 |
import collections
N=int(eval(input()))
x=list(map(int,input().split()))
c=collections.Counter(x)
t=[2**i for i in range(len(str(bin(max(x)*2))[2:])+1)[::-1]]
count=0
x.sort()
for i in range(len(x))[::-1]:
for j in range(len(t)):
if t[j]-x[i] in list(c.keys()):
if t[j] < x[i]:
... | import collections
N=int(eval(input()))
x=list(map(int,input().split()))
c=collections.Counter(x)
t=[2**i for i in range(len(str(bin(max(x)*2))[2:])+1)[::-1]]
count=0
start=0
x.sort()
for i in range(len(x))[::-1]:
for j in range(start,len(t)):
if t[j] > 2*x[i]:
start = j
if t... | p03201 |
from bisect import bisect_left
N = int(eval(input()))
A = sorted(list(map(int,input().split())))
cnt = 0
hist = [0 for _ in range(N)]
for i in range(N-1,0,-1):
if hist[i]==0:
a = A[i]
k = 0
while 2**k<=a:
k += 1
b = 2**k-a
ind = bisect_left(A,b)
... | from bisect import bisect_left
N = int(eval(input()))
A = sorted(list(map(int,input().split())))
A = [[A[i],0] for i in range(N)]
cnt = 0
for i in range(N-1,0,-1):
if A[i][1]==0:
a = A[i][0]
A[i][1]=1
k = 0
while 2**k<=a:
k += 1
b = 2**k-a
ind... | p03201 |
import sys
nbs = list(sorted(map(int, list(sys.stdin)[1].strip().split())))
used = set()
count = 0
for k in reversed(list(range(1, 31))):
p = 1 << k
j = len(nbs) - 1
for i, a in enumerate(nbs):
if i not in used:
while j > i and (nbs[j] > p - a or j in used):
... | eval(input())
nbs = list(map(int, input().split()))
answer = 0
count = {}
for nb in nbs:
count[nb] = count.get(nb, 0) + 1
for nb in sorted(list(count.keys()), reverse=True):
searching = (1 << nb.bit_length()) - nb
nb_count = count[nb]
sr_count = count.get(searching, 0)
if sr_count:
... | p03201 |
from collections import Counter
n = int(eval(input()))
nums = sorted(list(map(int, input().split())), reverse=True)
num_map = Counter(nums)
answer = 0
for num in nums:
pair = (1 << (num.bit_length())) - num
if num_map[num] > 0 and num_map[pair]:
if num == pair and num_map[num] > 1:
... | from collections import Counter
n = int(eval(input()))
nums = sorted(list(map(int, input().split())), reverse=True)
num_map = Counter(nums)
answer = 0
for num in nums:
pair = (1 << (num.bit_length())) - num
if num_map[num] > 0 and num_map[pair]:
if num == pair and num_map[num] > 1:
... | p03201 |
from collections import*
from bisect import*
p=[1]
for _ in range(30):p+=p[-1]*2,
n,*a=list(map(int,open(0).read().split()))
d=Counter(a)
c=0
for b in sorted(a)[::-1]:
if d[b]<1:continue
d[b]-=1
x=p[bisect(p,b)]-b
if d[x]:
d[x]-=1
c+=1
print(c) | from collections import*
C=Counter(a:=sorted(map(int,[*open(r:=0)][1].split())))
for x in a[::-1]:
if C[x]>0:y=2**x.bit_length()-x;C[x]-=1;r+=C[y]>0;C[y]-=1
print(r) | p03201 |
from collections import Counter
N = int(eval(input()))
A_arr = list(map(int, input().split()))
A_arr = sorted(A_arr, reverse=True)
C_arr = Counter(A_arr)
count = 0
while len(A_arr) != 0:
v_max = A_arr.pop(0)
C_arr[v_max] -= 1
v_pair = 2**v_max.bit_length() - v_max
if C_arr[v_pair] != 0:
... | from collections import Counter
N = int(eval(input()))
A_arr = list(map(int, input().split()))
A_arr = sorted(A_arr, reverse=True)
C_arr = Counter(A_arr)
count = 0
for i in range(N):
v_max = A_arr[i]
if C_arr[v_max] == 0:
continue
C_arr[v_max] -= 1
v_pair = 2**v_max.bit_length() -... | p03201 |
n=int(eval(input()))
lists=list(map(int,input().split()))
lists=sorted(lists,reverse=True)
from collections import Counter
dic=dict(Counter(lists))
ans=0
howmuch=[[] for i in range(30)]
for num in lists:
c=0
while num%2==0:
num=num//2
c+=1
howmuch[c].append(num)
for i in range... |
from collections import defaultdict
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
D = defaultdict(int)
for x in A:
D[x] += 1
A.sort(reverse=True)
for x in A:
for i in range(1, 31):
if D[x] > 0:
if 2**i-x in list(D.keys()) and D[2**i-x] > 0:
... | p03201 |
import math,collections
n=int(eval(input()))
a=sorted(map(int,input().split()))[::-1]
s=collections.Counter(a)
r=0
f=0
for i,v in enumerate(a):
if f:f=0;continue
if s[v]==0:continue
p=2**math.ceil(math.log2(v))-v
if p in list(s.keys()) and s[p]>0:s[v]-=1;s[p]-=1;r+=1;continue
if i<n-1 and p==0 and a[i+1... | import math,collections
n=int(eval(input()))
a=sorted(map(int,input().split()))[::-1]
s=collections.Counter(a)
r=0
f=0
for i,v in enumerate(a):
p=2**math.ceil(math.log2(v))-v
if f:f=0
elif s[v]==0:pass
elif p in list(s.keys())and s[p]>0:s[v]-=1;s[p]-=1;r+=1
elif i<n-1 and p==0 and v==a[i+1]and s[v]>1:s[... | p03201 |
N = int(eval(input()))
A = [int(_) for _ in input().split()]
from collections import defaultdict
xs = sorted(A, reverse=True)
cs = defaultdict(int)
for x in xs:
cs[x] += 1
result = 0
for x in xs:
if cs[x]:
for i in range(31, 0, - 1):
m = 2**i
y = m - x
... | N = int(eval(input()))
A = [int(_) for _ in input().split()]
xs = sorted(A, reverse=True)
cs = {}
for x in xs:
cs[x] = cs.get(x, 0) + 1
result = 0
for x in xs:
if cs[x]:
for i in range(31, 0, - 1):
m = 2**i
y = m - x
if y > x or y < 1:
... | p03201 |
N=int(eval(input()))
A=list(map(int,input().split()))
import math
import collections
powers =[2**i for i in range(1,int(math.log(max(A),2)+2))]
table=collections.defaultdict(int)
table2=collections.defaultdict(set)
ans=0
for i in range(N):
table[A[i]]+=1
for x in table:
for y in reversed(powers):
if... | def main():
from collections import Counter
import sys
input = sys.stdin.buffer.readline
_ = int(eval(input()))
A = [int(i) for i in input().split()]
ans = 0
c = Counter(A)
B = sorted(list(c.keys()), reverse=True)
for b in B:
if c[b] == 0:
continu... | p03201 |
#! /usr/bin/env python
# -*- coding: utf-8 -*-
# vim:fenc=utf-8
#
"""
agc 029 B
"""
from collections import Counter
n = int(eval(input()))
ali = list(map(int, input().split()))
ali.sort(reverse=True)
c = Counter(ali)
ans = 0
def pow2(n):
m = n
tmp = 1
while m > 0:
tmp = ... | #! /usr/bin/env python
# -*- coding: utf-8 -*-
# vim:fenc=utf-8
#
"""
agc 029 B
"""
from collections import Counter
nn = int(eval(input()))
ali = list(map(int, input().split()))
ali.sort(reverse=True)
c = Counter(ali)
ans = 0
def pow2(n):
m = n
tmp = 1
while m > 0:
tmp =... | p03201 |
import bisect
"""
def wantp(n):
wq = []
while p[n] != n:
wq.append(n)
n = p[n]
for i in wq:
p[i] = n
return n
"""
N = int(eval(input()))
A = list(map(int,input().split()))
A.sort()
"""
p = [i for i in range(N)]
rank = [1] * N
"""
used = [False]... |
import bisect
"""
def wantp(n):
wq = []
while p[n] != n:
wq.append(n)
n = p[n]
for i in wq:
p[i] = n
return n
"""
N = int(eval(input()))
B = list(map(int,input().split()))
B.sort()
A = []
AS = []
for i in range(N):
if len(A) == 0:
A... | p03201 |
N = int(eval(input()))
A = list(map(int,input().split()))
"""
2べきになる条件は？
→片方が2の補数であること
Nが大きい→貪欲的に
最大の奴はそれより小さい奴としかペアを組めない
→大きい奴から貪欲にとっけいけばいける？
いけそうかなぁ
"""
A.sort()
An = []
for i in range(N):
if i == 0 or An[-1][0] != A[i]:
An.append([ A[i] , 1 ])
else:
An[-1][1] += ... |
N = int(eval(input()))
A = list(map(int,input().split()))
"""
2べきになる条件は？
→片方が2の補数であること
Nが大きい→貪欲的に
最大の奴はそれより小さい奴としかペアを組めない
→大きい奴から貪欲にとっけいけばいける？
いけそうかなぁ
"""
A.sort()
dic = {}
lis = []
for i in range(N):
if i == 0 or A[i-1] != A[i]:
dic[A[i]] = 1
lis.append(A[i])
... | p03201 |
N = int(eval(input()))
ball = list(map(int, input().split()))
ball.sort(reverse = True)
dic = {}
for i in range(ball[0] + 1):
dic[i] = 0
for x in ball:
dic[x] += 1
ans = 0
for x in ball:
if dic[x] != 0:
y = 2**(x.bit_length()) - x
if dic[y] != 0:
if y == x and dic[... | N = int(eval(input()))
ball = list(map(int, input().split()))
ball.sort(reverse = True)
ok = {}
for x in ball:
if x in ok:
ok[x] += 1
else:
ok[x] = 1
ans = 0
for x in ball:
if ok[x] != 0:
y = 2**(x.bit_length()) - x
if y in ok:
if ok[y] != 0:
... | p03201 |
from collections import defaultdict
n = int(eval(input()))
a = list(map(int,input().split()))
a.sort(key=lambda x:-x)
d = defaultdict(int)
for i in a:
d[i] += 1
beki = [2**i for i in range(60,0,-1)]
ans = 0
for i in a:
if d[i] == 0:
continue
for j in beki:
if j <= i:
... | from collections import defaultdict
n = int(eval(input()))
a = list(map(int,input().split()))
a.sort(key=lambda x:-x)
d = defaultdict(int)
for i in a:
d[i] += 1
beki = [2**i for i in range(32,0,-1)]
ans = 0
for i in a:
if d[i] == 0:
continue
for j in beki:
if j <= i:
... | p03201 |
import bisect
from collections import Counter
n = int(eval(input()))
A = list(map(int,input().split()))
A.sort()
C = Counter(A)
ans = 0
for i in range(n-1,-1,-1):
temp = A[i]
beki = 1
while beki <= temp:
beki *= 2
counterpart = beki-temp
if C[counterpart] > 0 and C[temp] > 0 and... | from collections import Counter
n = int(eval(input()))
A = list(map(int,input().split()))
A.sort()
C = Counter(A)
ans = 0
for i in range(n-1,-1,-1):
temp = A[i]
beki = 1
if C[temp] == 0:
continue
while beki <= temp:
beki *= 2
counterpart = beki-temp
if C[counterpart... | p03201 |
import sys
from collections import Counter
read = sys.stdin.read
readline = sys.stdin.readline
N, *A = list(map(int, read().split()))
A.sort()
a = Counter(A)
answer = 0
# 可能な最大の2冪
limit = 1 << ((2 * 10 ** 9 + 1).bit_length() - 1)
while A:
n = A.pop()
if a[n] == 0:
continue
a[... | import sys
from collections import Counter
read = sys.stdin.read
readline = sys.stdin.readline
N, *A = list(map(int, read().split()))
A.sort()
a = Counter(A)
answer = 0
while A:
n = A.pop()
if a[n] == 0:
continue
a[n] -= 1
# 実現可能な最大の2冪
s = 1 << (2 * n).bit_length()
... | p03201 |
import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
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)... | import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
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)... | p03112 |
# input
A, B, Q = list(map(int, input().split()))
S, T, X = [], [], []
for _ in range(A):
S.append(int(eval(input())))
for _ in range(B):
T.append(int(eval(input())))
for _ in range(Q):
X.append(int(eval(input())))
# end of world
EOW = 10 ** 10
# boundary info
tbounds = [(T[i+1] + T[i]) ... | 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
a,b,q=list(map(int,input().split()))
s=[-999999999999]+[int(eval(input())) for i in range(a)]+[999999999999]
t=[-999999999999]+[int(eval(input())) for i in range(b)]+[999999999999]
x=[int(eval(input())) for i in range(q)]
for i in range(q):
a1=s[bisect.bisect_left(s,x[i])-1]
a2=s[bisect.bisect_... | import bisect
import sys
input=sys.stdin.readline
a,b,q=list(map(int,input().split()))
s=[-999999999999]+[int(eval(input())) for i in range(a)]+[999999999999]
t=[-999999999999]+[int(eval(input())) for i in range(b)]+[999999999999]
x=[int(eval(input())) for i in range(q)]
for i in range(q):
a1=s[bisect.bisect_... | p03112 |
import sys
def main():
input = sys.stdin.readline
a, b, q = list(map(int, input().split()))
s = [0]*a
for i in range(a):
s[i] = int(eval(input()))
t = [0]*b
for i in range(b):
t[i] = int(eval(input()))
s_near = [0]*a
k = 0
for i in range(a):
if k == b-1:
s_near[... | import sys
import bisect
def main():
input = sys.stdin.readline
inf = pow(10, 18)
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]
for _ in range(q):
x = int(eval(input()))
i = bi... | p03112 |
import bisect
A, B, Q = list(map(int, input().split()))
ss = [int(eval(input())) for _ in range(A)]
ts = [int(eval(input())) for _ in range(B)]
xs = [int(eval(input())) for _ in range(Q)]
ss.sort()
ts.sort()
for x in xs:
i = bisect.bisect_left(ss, x)
s1 = ss[i - 1] if 0 < i else -(10 ** 20)
s2... | import bisect
import io
import sys
LINES = sys.stdin.read().splitlines()[::-1]
def readline():
return LINES.pop()
A, B, Q = list(map(int, readline().split()))
ss = [int(readline()) for _ in range(A)]
ts = [int(readline()) for _ in range(B)]
xs = [int(readline()) for _ in range(Q)]
ss.sort()
t... | p03112 |
import sys
input = sys.stdin.readline
class AvlTree:
""" Avl木を表現するクラス """
def __init__(self):
self.avl = [None,None,None,0]
def node(self,key):
return [None,key,None,0]
# search(x) xが存在するならTrueをしないならFalseを返す
def search(self,key,avl=None):
if avl == None:
... | 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 e in x:
b, d = bisect.bisect_right(s,e), bisect.bisect_right(t,e)
... | p03112 |
read = input
# read = Read(False, """
# 1 1 3
# 1
# 10000000000
# 2
# 9999999999
# 5000000000
# """).read
A,B,Q = list(map(int, read().split(' ')))
arrA = list(map(int, [read() for i in range(A)]))
arrB = list(map(int, [read() for i in range(B)]))
arrQ = list(map(int, [read() for i in range(Q)]))
arrA.sort... | import bisect
read = input
bisect_right = bisect.bisect_right
# @ see https://docs.python.org/zh-cn/3/library/bisect.html
a ,b , q = list(map(int, read().split()))
INF = 10**18
A =[-INF] + [int(read()) for i in range(a)] +[INF]
B =[-INF] + [int(read()) for i in range(b)] +[INF]
A.sort()
B.sort()
try:
for... | p03112 |
import bisect
left_sentinel = -2 * (10 ** 10)
right_sentinel = 3 * (10 ** 10)
A, B, Q = list(map(int, input().split()))
ss = [left_sentinel] + [int(eval(input())) for _ in range(A)] + [right_sentinel]
ts = [left_sentinel] + [int(eval(input())) for _ in range(B)] + [right_sentinel]
for _ in range(Q):
x ... | import sys
from bisect import *
input = sys.stdin.buffer.readline
INF = 10 ** 13
A, B, Q = list(map(int, input().split()))
shrines = [-INF] + [int(eval(input())) for _ in range(A)] + [INF]
temples = [-INF] + [int(eval(input())) for _ in range(B)] + [INF]
queries = [int(eval(input())) for _ in range(Q)]
fo... | p03112 |
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
A, B, Q = mapint()
Ss = [-10**20]+[int(eval(input())) for _ in range(A)]+[10**20]
Ts = [-10**20]+[int(eval(input())) for _ in range(B)]+[10**20]
Ss.sort()
Ts.sort()
fr... | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
A, B, Q = mapint()
Ss = [-10**18]+[int(eval(input())) for _ in range(A)]+[10**18]
Ts = [-10**18]+[int(eval(input())) for _ in range(B)]+[10**18]
from bisect import bisec... | p03112 |
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]
for i in range(Q):
b = bisect_right(s... |
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]
X = [int(eval(input())) for _ in range(Q)]
for x in X:
b = bisect_right(S, x)
d = bisect_... | p03112 |
from bisect import bisect_left
INF = 10**18
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]
for _ in range(Q):
x = int(eval(input()))
si = bisect_left(S,x)
ti = bisect_left(T,x)
... | from bisect import bisect_left
import sys
input = sys.stdin.readline
INF = 10**18
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]
for _ in range(Q):
x = int(eval(input()))
si = bisect... | p03112 |
from bisect import bisect_left
A, B, Q = list(map(int, 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')]
S_rev = [-s for s in S][::-1]
T_rev = [-t for t in T][::-1]
for q in range(Q):
... | def main():
from bisect import bisect_left
A, B, Q = list(map(int, input().split()))
INF = 2 * 10 ** 10
S = [-INF] + [int(eval(input())) for _ in range(A)] + [INF]
T = [-INF] + [int(eval(input())) for _ in range(B)] + [INF]
S_rev = [-s for s in S][::-1]
T_rev = [-t for t in T][::-1]
... | p03112 |
#!/usr/bin/env python3
from bisect import bisect_right
def main():
A, B, Q = list(map(int, input().split()))
s = [int(eval(input())) for _ in range(A)]
t = [int(eval(input())) for _ in range(B)]
# print(s,t)
s = [-10**12] + s + [10**12]
t = [-10**12] + t + [10**12]
for _ in rang... | from bisect import bisect_left
A, B, Q = list(map(int, input().split()))
INF = 10**12
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_left(s,x)
ti = bisect_left(t,x)
... | p03112 |
def calc(a_list, b_list, x):
inf = 10**11
aa = [a - x for a in a_list]
bb = [b - x for b in b_list]
if len([b for b in bb if b>=0])*len([a for a in aa if a>=0]) >0:
p_1 = max([b for b in bb if b>=0][0], [a for a in aa if a>=0][0])
else:
p_1 = inf
if len([b for b in bb if ... | import bisect
a, b, q = list(map(int, input().split()))
s = []
for i in range(a):
s.append(int(eval(input())))
t = []
for j in range(b):
t.append(int(eval(input())))
inf = 10 ** 18
s = [-inf] + s + [inf]
t = [-inf] + t + [inf]
for k in range(q):
x = int(eval(input()))
s_r, t_r = bisect.bise... | p03112 |
import bisect
A, B, Q = list(map(int, input().split()))
INF = 10 ** 11
s_list = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t_list = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
for q in range(Q):
x = int(eval(input()))
near_right_s = bisect.bisect_right(s_list, x)
near_righ... | from sys import stdin
nii=lambda:list(map(int,stdin.readline().split()))
lnii=lambda:list(map(int,stdin.readline().split()))
from bisect import bisect
a,b,q=nii()
s=[-10**18]+[int(eval(input())) for i in range(a)]+[10**18]
t=[-10**18]+[int(eval(input())) for i in range(b)]+[10**18]
for i in range(q):
x=in... | p03112 |
from sys import stdout
printn = lambda x: stdout.write(str(x))
inn = lambda : int(eval(input()))
inl = lambda: list(map(int, input().split()))
inm = lambda: list(map(int, input().split()))
ins = lambda : input().strip()
DBG = True # and False
BIG = 999999999999
R = 10**9 + 7
import bisect
def ddpri... | from sys import stdout
printn = lambda x: stdout.write(str(x))
inn = lambda : int(eval(input()))
inl = lambda: list(map(int, input().split()))
inm = lambda: list(map(int, input().split()))
ins = lambda : input().strip()
DBG = True # and False
BIG = 999999999999
R = 10**9 + 7
import bisect
def ddpri... | p03112 |
import sys
from bisect import bisect_left
def input(): return sys.stdin.readline().strip()
def main():
A, B, Q = list(map(int, input().split()))
S = [-10**100]
T = [-10**100]
for _ in range(A): S.append(int(eval(input())))
for _ in range(B): T.append(int(eval(input())))
S.append(10**1... | import sys
from bisect import bisect_left
def input(): return sys.stdin.readline().strip()
def main():
A, B, Q = list(map(int, input().split()))
S = [-10**50]
T = [-10**50]
for _ in range(A): S.append(int(eval(input())))
for _ in range(B): T.append(int(eval(input())))
S.append(10**50)... | p03112 |
def main():
import bisect
A, B, Q = list(map(int, input().split()))
s = list()
t = list()
s.append(-10**12)
t.append(-10**12)
for i in range(A):
s.append(int(eval(input())))
for i in range(B):
t.append(int(eval(input())))
s.append(10**12)
t.append(10**12)
for i in range(Q):
... | import bisect
INF = 10**15
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]
for i in range(Q):
x = int(eval(input()))
sw = bisect.bisect_right(s, x)-1 #xより西で一番近い(同じ場所でもいい)神社の番号
se = sw + 1 #xより... | 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)]
StoT_W = [10000000010]*A
t = 0
for i in range(A):
if S[i]<T[0]:
continue
while(((t+1)<B)and(T[t+1] < S[i])):
t += 1
... | from bisect import bisect_left
I = lambda x: [-1<<50] + [int(eval(input())) for i in range(x)] + [1<<50]
A,B,Q = list(map(int,input().split()))
S,T = I(A),I(B)
for _ in range(Q):
x = int(eval(input()))
LS_ = bisect_left(S,x)
LT_ = bisect_left(T,x)
LS = S[LS_-1]
RS = S[LS_]
LT... | p03112 |
def main():
from bisect import bisect_left as bl
a, b, q, *stx = list(map(int, open(0).read().split()))
s = [-float('Inf')] + stx[:a] + [float('Inf')]
t = [-float('Inf')] + stx[a:a + b] + [float('Inf')]
x = stx[a + b:]
tmp = []
for i in x:
f, g = bl(s, i), bl(t, i)
... | def main():
from bisect import bisect_left as bl
a, b, q, *stx = list(map(int, open(0).read().split()))
s = [-float('Inf')] + stx[:a] + [float('Inf')]
t = [-float('Inf')] + stx[a:a + b] + [float('Inf')]
x = stx[a + b:]
tmp = []
for i in x:
f, g = bl(s, i), bl(t, i)
... | 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)]
for i in range(q):
x = int(eval(input()))
idx_s = bisect.bisect_left(s, x)
idx_t = bisect.bisect_left(t, x)
indices_s = []
indices_t = []
if... | import sys
import 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)]
for i in range(q):
x = int(eval(input()))
idx_s = bisect.bisect_left(s, x)
idx_t = bisect.bisect_left(t, x)
indi... | p03112 |
from bisect import bisect_left as bl
A, B, Q = list(map(int, input().split()))
inf = 10 ** 11
Sh = [-1 * inf] + [int(eval(input())) for _ in range(A)] + [inf]
Te = [-1 * inf] + [int(eval(input())) for _ in range(B)] + [inf]
for _ in range(Q):
q = int(eval(input()))
temp = inf
i = bl(Sh, q)
que = []
... | from bisect import bisect_left as bl
A, B, Q = list(map(int, input().split()))
inf = 10 ** 11
Sh = [-1 * inf] + [int(eval(input())) for _ in range(A)] + [inf]
Te = [-1 * inf] + [int(eval(input())) for _ in range(B)] + [inf]
for _ in range(Q):
x = int(eval(input()))
b, d = bl(Sh, x), bl(Te, x)
res = inf
... | p03112 |
import sys
import bisect
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
in_n = lambda: int(readline())
in_nn = lambda: list(map(int, readline().split()))
in_s = lambda: readline().rstrip().decode('utf-8')
INF = 10**12
d = lambda a, b: abs(a - b)
def main():
A, B, Q = in_nn()
... | import sys
import bisect
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
in_n = lambda: int(readline())
in_nn = lambda: list(map(int, readline().split()))
in_s = lambda: readline().rstrip().decode('utf-8')
INF = 10**12
def main():
A, B, Q = in_nn()
tmp = list(map(int, read(... | p03112 |
import bisect
f_inf = float('inf')
def cal(syurui, d, index):
if d == 'e':
return syurui[index]
elif d == 'w':
return syurui[index - 1]
A, B, Q = list(map(int, input().split()))
s = [int(eval(input())) for i in range(A)]
s.sort()
t = [int(eval(input())) for i in range(B)]
t.... | import bisect
import sys
f_inf = float('inf')
def cal(syurui, d, index):
if d == 'e':
return syurui[index]
elif d == 'w':
return syurui[index - 1]
A, B, Q = list(map(int, input().split()))
s = [int(eval(input())) for i in range(A)]
s.sort()
t = [int(eval(input())) for i in r... | p03112 |
from bisect import bisect_left
INF = 2 * 10**10
A, B, Q = map(int, input().split())
S = [int(input()) for _ in range(A)]
T = [int(input()) for _ in range(B)]
X = [int(input()) for _ in range(Q)]
ans = []
for x in X:
sr = bisect_left(S, x)
sl = sr -1
if sr != len(S) and S[sr] == x:
sl... | from bisect import bisect_left
INF = 2 * 10**10
A, B, Q = map(int, input().split())
S = [-INF] + [int(input()) for _ in range(A)] + [INF]
T = [-INF] + [int(input()) for _ in range(B)] + [INF]
X = [int(input()) for _ in range(Q)]
ans = []
for x in X:
sr = bisect_left(S, x)
sl = sr if S[sr] == x els... | p03112 |
from bisect import bisect_left
def main():
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)]
inf=10**11
minf=-10**11
s=[minf]+s+[inf]
t=[minf]+t+[inf]
for i in range(q):
ns=bise... | from bisect import bisect_left
import sys
def main():
input=sys.stdin.readline
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)]
inf=10**11
minf=-10**11
s=[minf]+s+[inf]
t=[minf]+t+... | p03112 |
import sys
input = sys.stdin.readline
import bisect
INF = 1e+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]
x = [int(eval(input())) for _ in range(Q)]
for i in range(Q):
a,b= bisect.bisect_right(... | import sys
input = sys.stdin.readline
import bisect
INF = 1e+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]
x=[int(eval(input())) for _ in range(Q)]
for i in range(Q):
a,b=bisect.bisect_right(s,x[i])... | 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)]
for i in range(q):
x = int(eval(input()))
xs = bisect.bisect(s,x)
xt = bisect.bisect(t,x)
ds = []
if 0 < xs < a:
ds.append([s[xs-1],abs(... | import bisect
a,b,q = list(map(int,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')]
for i in range(q):
x = int(eval(input()))
xs = bisect.bisect(s,x)
xt = bisect.bisect(t,x)
... | p03112 |
A, B, Q = list(map(int, input().split()))
# もし神社(寺)が1つしかなかった場合に両端に仮想の神社を建築して処理の一貫性を保つ。かりにこれが選ばれても最大のコストなので最終的に最適になることはない。
INF = 10 ** 18
S = [-INF] + [int(eval(input())) for _ in range(A)]+[INF]
T = [-INF] + [int(eval(input())) for _ in range(B)]+[INF]
from bisect import bisect_left as bisect_right
from itert... | from sys import stdin
A, B, Q = list(map(int, input().split()))
# もし神社(寺)が1つしかなかった場合に両端に仮想の神社を建築して処理の一貫性を保つ。かりにこれが選ばれても最大のコストなので最終的に最適になることはない。
INF = 10 ** 18
S = [-INF] + [int(stdin.readline()) for _ in range(A)]+[INF]
T = [-INF] + [int(stdin.readline()) for _ in range(B)]+[INF]
from bisect import bisect_rig... | p03112 |
from sys import stdin
A, B, Q = list(map(int, input().split()))
# もし神社(寺)が1つしかなかった場合に両端に仮想の神社を建築して処理の一貫性を保つ。かりにこれが選ばれても最大のコストなので最終的に最適になることはない。
INF = 10 ** 18
S = [-INF] + [int(stdin.readline()) for _ in range(A)]+[INF]
T = [-INF] + [int(stdin.readline()) for _ in range(B)]+[INF]
from bisect import bisect_rig... | from sys import stdin
A, B, Q = list(map(int, input().split()))
# もし神社(寺)が1つしかなかった場合に両端に仮想の神社を建築して処理の一貫性を保つ。かりにこれが選ばれても最大のコストなので最終的に最適になることはない。
INF = 10 ** 18
S = [-INF] + list(map(int, (stdin.readline() for _ in range(A))))+[INF]
T = [-INF] + list(map(int, (stdin.readline() for _ in range(B))))+[INF]
from bi... | p03112 |
# from sys import stdin #入力の高速化(0.2秒ぐらい早くなる)
A, B, Q = list(map(int, input().split()))
# もし神社(寺)が1つしかなかった場合に両端に仮想の神社を建築して処理の一貫性を保つ。かりにこれが選ばれても最大のコストなので最終的に最適になることはない。
INF = 10 ** 18
# S = [-INF] + list(map(int, (stdin.readline() for _ in [0] * A))) + [INF]
# T = [-INF] + list(map(int, [stdin.readline() for _ in ... | 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 |
A,B,Q = list(map(int,input().split()))
Ss = []
for i in range(A):
Ss.append(int(eval(input())))
Ts = []
for i in range(B):
Ts.append(int(eval(input())))
def binary_search(search_list,target):
left = 0
right = len(search_list)
while left < right:
center = (left + right)//2
... | 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 |
a, b, q = list(map(int, input().split()))
S = [int(eval(input())) for _ in range(a)]
T = [int(eval(input())) for _ in range(b)]
S.sort()
T.sort()
INF = 10**18
S = [-INF] + S + [INF]
T = [-INF] + T + [INF]
import bisect
for _ in range(q):
x = int(eval(input()))
i = bisect.bisect_right(S, x)
j =... | import sys
input = sys.stdin.buffer.readline
a, b, q = list(map(int, input().split()))
S = [0]*a
T = [0]*b
for i in range(a):
s = int(eval(input()))
S[i] = s
for i in range(b):
t = int(eval(input()))
T[i] = t
S.sort()
T.sort()
S = [-10**18]+S+[10**18]
T = [-10**18]+T+[10**18]
import b... | p03112 |
import bisect
from functools import reduce
A, B, Q = list(map(int,input().split()))
INF = float("inf")
s = [-1*INF]
t = [-1*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 _ in range(Q):
x = int(eval(input())... | from bisect import bisect_left
A, B, Q = list(map(int,input().split()))
INF = 2 * 10 ** 10
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 _ in range(Q):
x = int(eval(input()))
s = bisect_l... | p03112 |
import sys
import bisect
a, b, q = [int(i) for i in sys.stdin.readline().split()]
s_ls = []
t_ls = []
INF = 10 ** 18
for i in range(a):
s = int(eval(input()))
s_ls.append(s)
for i in range(b):
t = int(eval(input()))
t_ls.append(t)
for i in range(q):
x = int(eval(input()))
s_ind =... | import sys
import bisect
_input = sys.stdin.readlines()
a, b, q = [int(i) for i in _input[0].split()]
data = [int(i) for i in _input[1:]]
s_ls = data[:a]
t_ls = data[a:a+b]
x_ls = data[-q:]
INF = 10 ** 18
for x in x_ls:
s_ind = min(bisect.bisect_left(s_ls, x), a-1)
t_ind = min(bisect.bisect_left(t_... | p03112 |
import sys
input = sys.stdin.readline
A,B,Q = list(map(int,input().split()))
S = []
for i in range(A):
temp = int(eval(input()))
S.append(temp)
#S.sort()
T = []
for i in range(B):
temp = int(eval(input()))
T.append(temp)
#T.sort()
#print(S,T)
def jinja(x): #移動距離、神社の位置を出力
if x <= S[0]:
re... | 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)
#print(b,d)
... | p03112 |
#!/usr/bin/env python3
import sys
def solve(n: int, m: int, Q: int, s: "List[int]", t: "List[int]", x: "List[int]"):
def check_pos(target, a, x):
ret = {}
a_x = a + x
a_x.sort()
idx = 0
while idx < len(a_x) and a_x[idx] < target[0]:
dis = target[0] ... | #!/usr/bin/env python3
import sys
def solve(N: int, M: int, Q: int, s: "List[int]", t: "List[int]", x: "List[int]"):
def binary_search(ary, val):
n = len(ary)
l = -1
r = n
while r - l > 1:
mid = (l + r) // 2
if ary[mid] >= val:
... | p03112 |
import bisect
A, B, Q = map(int, input().split())
S = [int(input()) for _ in range(A)]
T = [int(input()) for _ in range(B)]
X = [int(input()) for _ in range(Q)]
R = []
for x in X:
SL, SR, TL, TR = 10**20, 10**20, 10**20, 10**20
i = bisect.bisect_left(S, x)
if i != 0:
SL = x-S[i-1]
i... | 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)]
for x in X:
SL, SR, TL, TR = 10**20, 10**20, 10**20, 10**20
i = bisect.bisect_left(S, x)
if i != 0:
SL =... | p03112 |
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())))
s.sort()
t.sort()
for i in range(q):
x=int(eval(input()))
n=x
start=0
end=a-1
count=0
mid=start+(end-start)//2
while start... | import bisect
a,b,q=list(map(int,input().split(' ')))
INF=10**19
s=[-INF]+[int(eval(input())) for i in range(a)]+[INF]
t=[-INF]+[int(eval(input())) for i in range(b)]+[INF]
s.sort()
t.sort()
for i in range(q):
x=int(eval(input()))
b,d=bisect.bisect(s,x),bisect.bisect(t,x)
mi=INF
for j in [s[b... | 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)]
#x = [int(input()) for i in range(q)]
ans = 10**100
for i in range(q):
x = int(eval(input()))
ans = 10**100
s_idx = bisect.bisect_left(s,x)
t_idx =... | import sys
import bisect
input = sys.stdin.readline
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(input()) for i in range(q)]
ans = 10**100
for i in range(q):
x = int(eval(input()))
ans = 10**100
s_id... | p03112 |
import sys
import bisect
input = sys.stdin.readline
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(input()) for i in range(q)]
ans = 10**100
for i in range(q):
x = int(eval(input()))
ans = 10**100
s_id... | import sys
import bisect
input = sys.stdin.readline
a,b,q = list(map(int,input().split()))
ans = 10**100
s = [-ans] + [int(eval(input())) for i in range(a)] + [ans]
t = [-ans] + [int(eval(input())) for i in range(b)] + [ans]
x = [int(eval(input())) for i in range(q)]
ans = 10**100
for i in range(q)... | p03112 |
import sys
import bisect
input = sys.stdin.readline
a,b,q = list(map(int,input().split()))
ans = 10**100
s = [-ans] + [int(eval(input())) for i in range(a)] + [ans]
t = [-ans] + [int(eval(input())) for i in range(b)] + [ans]
x = [int(eval(input())) for i in range(q)]
ans = 10**100
for i in range(q)... | import sys
import bisect
input = sys.stdin.readline
a,b,q = list(map(int,input().split()))
ans = 10**100
s = [-ans] + [int(eval(input())) for i in range(a)] + [ans]
t = [-ans] + [int(eval(input())) for i in range(b)] + [ans]
x = [int(eval(input())) for i in range(q)]
ans = 10**100
for i in range(q)... | p03112 |
import sys
import bisect
input = sys.stdin.readline
a,b,q = list(map(int,input().split()))
ans = 10**100
s = [-ans] + [int(eval(input())) for i in range(a)] + [ans]
t = [-ans] + [int(eval(input())) for i in range(b)] + [ans]
x = [int(eval(input())) for i in range(q)]
ans = 10**100
for i in range(q)... | import sys
import bisect
input = sys.stdin.readline
a,b,q = list(map(int,input().split()))
ans = 10**100
s = [-ans] + [int(eval(input())) for i in range(a)] + [ans]
t = [-ans] + [int(eval(input())) for i in range(b)] + [ans]
#x = [int(input()) for i in range(q)]
ans = 10**100
for i in range(q):
... | p03112 |
from bisect import bisect_left, 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)]
q = [int(eval(input())) for _ in range(q)]
for qi in q:
qans = 10**18
ai = bisect_left(s, qi)
bi = bisect_left(t, qi)
ac =... | from bisect import bisect_left, 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)]
q = [int(eval(input())) for _ in range(q)]
for qi in q:
qans = 10**18
ai = bisect_left(s, qi)
bi = bisect_left(t, qi)
ac =... | p03112 |
from bisect import bisect_left, 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)]
q = [int(eval(input())) for _ in range(q)]
for qi in q:
qans = 10**18
ai = bisect_left(s, qi)
bi = bisect_left(t, qi)
ac =... | from bisect import bisect_left, bisect_right
import sys
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)]
q = [int(eval(input())) for _ in range(q)]
for qi in q:
qans = 10**18
ai = bisect_left(s, qi... | p03112 |
import bisect
A, B, Q = list(map(int, input().split()))
S = [-float("inf")]
T = [-float("inf")]
X = []
for i in range(A):
S.append(int(eval(input())))
S.append(float("inf"))
for i in range(B):
T.append(int(eval(input())))
T.append(float("inf"))
for i in range(Q):
X.append(int(eval(... |
import bisect
A, B, Q = list(map(int, input().split()))
S = [int(eval(input())) for i in range(A)]
S.insert(0, -float("inf"))
S.append(float("inf"))
T = [int(eval(input())) for i in range(B)]
T.insert(0, -float("inf"))
T.append(float("inf"))
X = [int(eval(input())) for i in range(Q)]
for x in X:
... | p03112 |
import bisect
A,B,C =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]
for _ in range(C):
x =int(eval(input()))
ns = bisect.bisect_left(s,x)
nt = bisect.bisect_left(t,x)
sx =[s[ns-1],s[ns... | import bisect
import sys
input = sys.stdin.readline
A,B,C =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]
for _ in range(C):
x =int(eval(input()))
ns = bisect.bisect_left(s,x)
nt = bisect... | 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
... | 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]
for _ in range(Q):
x = int(eval(input()))
s1 = bisect.bisect_left(S, x) -1 #自分の左側のindex
s2 = s1 + 1 #自分の右側... | 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)]
INF = float('inf')
for _ in range(q):
x = int(eval(input()))
if x > s[a-1]:
sl = x - s[a-1]
sr = INF
elif x < s[0]:
sl = INF
... | import bisect
import sys
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)]
INF = float('inf')
for _ in range(q):
x = int(eval(input()))
if x > s[a-1]:
sl = x - s[a-1]
sr = INF
... | p03112 |
import bisect
a,b,q=list(map(int,input().split()))
s=[]
t=[]
x=[]
s.append(-float("inf"))
t.append(-float("inf"))
for i in range(a):
s.append(int(eval(input())))
for i in range(b):
t.append(int(eval(input())))
s.append(float("inf"))
t.append(float("inf"))
s.sort()
t.sort()
for i in range(q):
... | from bisect import bisect_left
a,b,q=list(map(int,input().split()))
s=[]
t=[]
x=[]
s.append(-float("inf"))
t.append(-float("inf"))
for i in range(a):
s.append(int(eval(input())))
for i in range(b):
t.append(int(eval(input())))
s.append(float("inf"))
t.append(float("inf"))
s.sort()
t.sort()
for i ... | p03112 |
from bisect import bisect_left
a,b,q=list(map(int,input().split()))
s=[]
t=[]
x=[]
s.append(-float("inf"))
t.append(-float("inf"))
for i in range(a):
s.append(int(eval(input())))
for i in range(b):
t.append(int(eval(input())))
s.append(float("inf"))
t.append(float("inf"))
for i in range(q):
x=... | from bisect import bisect_left
a,b,q=list(map(int,input().split()))
s=[]
t=[]
x=[]
s.append(-10**12)
t.append(-10**12)
for i in range(a):
s.append(int(eval(input())))
for i in range(b):
t.append(int(eval(input())))
s.append(10**12)
t.append(10**12)
for i in range(q):
x=int(eval(input()))
... | p03112 |
from bisect import bisect_left
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]
def f(S,T):
res = 10**30
s = bisect_left(S,x)
ans = 0
t = bisect_left(T,S[s-1])
ans ... | from bisect import bisect_left
import sys
input = sys.stdin.readline
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]
def f(S,T):
res = 10**30
s = bisect_left(S,x)
ans = 0
... | p03112 |
import bisect,sys
input = sys.stdin.readline
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]
def f(S,T):
res = INF
s = bisect.bisect_left(S,x)
for i in range(2):
for j i... | from bisect import bisect_left
import sys
input = sys.stdin.readline
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]
def f(S,T):
res = 10**30
s = bisect_left(S,x)
ans = 0
... | 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 search(a):
cur = a
sx, tx = [], [] #xiとsi、tiの差のリスト
for si in s:
sx.append(abs(si - a))
for ti in t:
tx.append(abs(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 = INF
... | 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)]
#print("S:", S)
#print("T:", T)
for i in range(Q):
x = X[i]
answer = 10 ** 12
i1 = bisect.bisect_right(S, x... | 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)]
#print("S:", S)
#print("T:", T)
answer1 = []
answer2 = []
for x in X:
answer = 10 ** 12
i1 = bisect.bisect... | p03112 |
import bisect
def solve(A, B, Q, Ss, Ts, Xs):
ans = []
Ss.append(10 ** 21)
Ss.insert(0, -10 ** 21)
Ts.append(10 ** 21)
Ts.insert(0, -10 ** 21)
for x in Xs:
s_right = bisect.bisect_right(Ss, x)
s_left = max(s_right - 1, 0)
t_right = bisect.bisect_right(Ts, x)... | import bisect
def solve(A, B, Q, Ss, Ts, Xs):
ans = []
Ss.append(10 ** 21)
Ss.insert(0, -10 ** 21)
Ts.append(10 ** 21)
Ts.insert(0, -10 ** 21)
for x in Xs:
s_right = bisect.bisect_right(Ss, x)
s_left = max(s_right - 1, 0)
t_right = bisect.bisect_right(Ts, x)... | p03112 |
from bisect import bisect_right
def getINearests(ss, ts):
iNearests = [-1] * len(ss)
for iS, s in enumerate(ss):
iT = bisect_right(ts, s)
if iT == len(ts):
iNearests[iS] = iT-1
elif iT == 0:
iNearests[iS] = 0
else:
d1 = abs(s - ts[i... | import sys
from bisect import bisect_right
def solve():
def getINearests(ss, ts):
iNearests = [-1] * len(ss)
for iS, s in enumerate(ss):
iT = bisect_right(ts, s)
if iT == len(ts):
iNearests[iS] = iT-1
elif iT == 0:
iNear... | 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 question in range(q):
x = int(eval(input()))
b, d = bisect.bisect_right(s, x), bisect.bisect_right(t, x)
... | from bisect import bisect_right as br
a,b,q=list(map(int,input().split()))
I=2<<60
s,t=[-I]+[int(eval(input())) for _ in range(a)]+[I],[-I]+[int(eval(input())) for _ in range(b)]+[I]
for question in range(q):
x=int(eval(input()))
b,d,r=br(s,x),br(t,x),I
for S in [s[b-1],s[b]]:
for T in [t[d-... | p03112 |
import bisect
A, B, Q = list(map(int, input().split()))
s = [-10 ** 12] + [int(eval(input())) for _ in range(A)] + [10 ** 12]
t = [-10 ** 12] + [int(eval(input())) for _ in range(B)] + [10 ** 12]
x = [int(eval(input())) for _ in range(Q)]
for i in x:
si = bisect.bisect_left(s, i)
ti = bisect.bisect_l... | 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)]
S = [-10 ** 12] + S + [10 ** 12]
T = [-10 ** 12] + T + [10 ** 12]
for x in X:
si = bisect.bisect_right(S, x)
ti = ... | 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 BinaryIndexSearch_floor(p, SL):
"""
search the minimum number among the larger numbers than the ginven nymber "n".
return the index of... | 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 BinaryIndexSearch_floor(p, SL):
"""
search the minimum number among the larger numbers than the ginven nymber "n".
return the index of... | p03112 |
A,B,Q=list(map(int,input().split()))
s=[0]*(A+2)
t=[0]*(B+2)
X=[0]*Q
s[0] = -float('inf')
s[A+1] = float('inf')
t[0] = -float('inf')
t[B+1] = float('inf')
for i in range(1,A+1):
s[i] = int(eval(input()))
for i in range(1,B+1):
t[i] = int(eval(input()))
for i in range(Q):
X[i] = int(eval(input()... | A,B,Q=list(map(int,input().split()))
s=[0]*(A+2)
t=[0]*(B+2)
X=[0]*Q
s[0] = -float('inf')
s[A+1] = float('inf')
t[0] = -float('inf')
t[B+1] = float('inf')
for i in range(1,A+1):
s[i] = int(eval(input()))
for i in range(1,B+1):
t[i] = int(eval(input()))
for i in range(Q):
X[i] = int(eval(input()... | p03112 |
import bisect
A,B,Q=list(map(int,input().split()))
S=[-10**18]+[int(eval(input())) for _ in range(A)]+[10**18]
T=[-10**18]+[int(eval(input())) for _ in range(B)]+[10**18]
for i in range(Q):
x=int(eval(input()))
b,d=bisect.bisect_right(S,x), bisect.bisect_right(T,x)
ans=float("inf")
for s in ... | import bisect
INF=10**18
A,B,Q=list(map(int,input().split()))
S=[0]*(A+2)
T=[0]*(B+2)
S[0],T[0]=-INF,-INF
S[A+1],T[B+1]=INF,INF
for i in range(1,A+1):
S[i]=int(eval(input()))
for i in range(1,B+1):
T[i]=int(eval(input()))
for i in range(Q):
x=int(eval(input()))
b,d=bisect.bisect_rig... | p03112 |
import bisect
import sys
a, b, q = list(map(int, input().split()))
lines = sys.stdin.readlines()
sss = list(map(int, lines[:a]))
ttt = list(map(int, lines[a:a + b]))
xxx = list(map(int, lines[a + b:]))
nearest_temples = [0] * a
nearest_shrines = [0] * b
for i, s in enumerate(sss):
ti = bisect.bisect(t... | import bisect
import sys
SENTINEL = 10 ** 12
a, b, q = list(map(int, input().split()))
lines = sys.stdin.readlines()
sss = [-SENTINEL] + list(map(int, lines[:a])) + [SENTINEL]
ttt = [-SENTINEL] + list(map(int, lines[a:a + b])) + [SENTINEL]
xxx = list(map(int, lines[a + b:]))
nearest_temples = [SENTINEL] +... | p03112 |
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())))
for i in range(q):
x.append(int(eval(input())))
import bisect
def get(x):
ls,rs,lt,rt=10**13,10**13,10**13,10**13
s_ind = bisect... | import sys
input=sys.stdin.readline
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())))
for i in range(q):
x.append(int(eval(input())))
import bisect
def get(x):
ls,rs,lt,rt=10**13,10... | p03112 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.