Problem:


Score : 400 points

Problem Statement

Along a road running in an east-west direction, there are A shrines and B temples.
The i-th shrine from the west is located at a distance of s_i meters from the west end of the road, and the i-th temple from the west is located at a distance of t_i meters from the west end of the road.

Answer the following Q queries:

Query i (1 \leq i \leq Q): If we start from a point at a distance of x_i meters from the west end of the road and freely travel along the road, what is the minimum distance that needs to be traveled in order to visit one shrine and one temple? (It is allowed to pass by more shrines and temples than required.)

Constraints

1 \leq A, B \leq 10^5

1 \leq Q \leq 10^5

1 \leq s_1 < s_2 < ... < s_A \leq 10^{10}

1 \leq t_1 < t_2 < ... < t_B \leq 10^{10}

1 \leq x_i \leq 10^{10}

s_1, ..., s_A, t_1, ..., t_B, x_1, ..., x_Q are all different.

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B Q
s_1
:
s_A
t_1
:
t_B
x_1
:
x_Q

Output

Print Q lines. The i-th line should contain the answer to the i-th query.

Sample Input 1

2 3 4
100
600
400
900
1000
150
2000
899
799

Sample Output 1

350
1400
301
399

There are two shrines and three temples. The shrines are located at distances of 100, 600 meters from the west end of the road, and the temples are located at distances of 400, 900, 1000 meters from the west end of the road.

Query 1: If we start from a point at a distance of 150 meters from the west end of the road, the optimal move is first to walk 50 meters west to visit a shrine, then to walk 300 meters east to visit a temple.

Query 2: If we start from a point at a distance of 2000 meters from the west end of the road, the optimal move is first to walk 1000 meters west to visit a temple, then to walk 400 meters west to visit a shrine. We will pass by another temple on the way, but it is fine.

Query 3: If we start from a point at a distance of 899 meters from the west end of the road, the optimal move is first to walk 1 meter east to visit a temple, then to walk 300 meters west to visit a shrine.

Query 4: If we start from a point at a distance of 799 meters from the west end of the road, the optimal move is first to walk 199 meters west to visit a shrine, then to walk 200 meters west to visit a temple.

Sample Input 2

1 1 3
1
10000000000
2
9999999999
5000000000

Sample Output 2

10000000000
10000000000
14999999998

The road is quite long, and we may need to travel a distance that does not fit into a 32-bit integer.



Sample input:
2 3 4
100
600
400
900
1000
150
2000
899
799


Sample output:
350
1400
301
399

Submission status: Accepted

Solution code:
# baseline!? re
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:
            n = len(values)
            self.left = [-1] * (n+1)
            self.right = [-1] * (n+1)
            self.values = [-float("inf")] + values
            self.diff = [0] * (n+1)  # left - right
            self.size_l = [0] * (n+1)
            if not sorted_:
                values.sort()

            st = [[1, n+1, 0]]
            while len(st) > 0:
                l, r, idx_par = st.pop()  # 半開区間
                c = (l+r) // 2
                if self.values[c] < self.values[idx_par]:
                    self.left[idx_par] = c
                else:
                    self.right[idx_par] = c
                siz = r - l
                if siz & -siz == siz and siz != 1:  # 2冪だったら
                    self.diff[c] = 1
                siz_l = c - l
                self.size_l[c] = siz_l
                if siz_l > 0:
                    st.append([l, c, c])
                    c1 = c + 1
                    if c1 < r:  # 左にノードがなければ右には必ず無いので
                        st.append([c1, r, c])

    # def print(self):
    #     print(f"left  ={self.left}")
    #     print(f"right ={self.right}")
    #     print(f"values={self.values}")
    #     print(f"diff  ={self.diff}")
    #     print(f"dixr_l={self.size_l}")

    def rotate_right(self, idx_par, lr):  # lr: 親の左なら 0
        idx = self.left[idx_par] if lr==0 else self.right[idx_par]
        idx_l = self.left[idx]
        assert idx_l != -1  # 左の子が存在する

        # 部分木の大きさの計算
        self.size_l[idx] -= self.size_l[idx_l] + 1

        # 高さの計算
        a = self.diff[idx]
        b = self.diff[idx_l]  # 左の子の高さの差
        if b >= 0:
            na = a - 1 - b
            if na >= 0:
                nb = b - 1
            else:
                nb = a - 2
        else:
            na = a - 1
            if na >= 0:
                nb = b - 1
            else:
                nb = a + b - 2
        self.diff[idx] = na
        self.diff[idx_l] = nb

        # 回転
        self.left[idx] = self.right[idx_l]
        self.right[idx_l] = idx
        if lr==0:
            self.left[idx_par] = idx_l
        else:
            self.right[idx_par] = idx_l

    def rotate_left(self, idx_par, lr):  # lr: 親の左なら 0
        idx = self.left[idx_par] if lr==0 else self.right[idx_par]
        idx_r = self.right[idx]
        assert idx_r != -1  # 右の子が存在する

        # 部分木の大きさの計算
        self.size_l[idx_r] += self.size_l[idx] + 1

        # 高さの計算
        a = self.diff[idx]
        b = self.diff[idx_r]  # 右の子の高さの差
        if b <= 0:
            na = a + 1 - b
            if na <= 0:
                nb = b + 1
            else:
                nb = a + 2
        else:
            na = a + 1
            if na <= 0:
                nb = b + 1
            else:
                nb = a + b + 2
        self.diff[idx] = na
        self.diff[idx_r] = nb

        # 回転
        self.right[idx] = self.left[idx_r]
        self.left[idx_r] = idx
        if lr == 0:
            self.left[idx_par] = idx_r
        else:
            self.right[idx_par] = idx_r

    def add(self, x):  # insert
        idx = 0
        path = []
        path_left = []
        while idx != -1:
            path.append(idx)
            value = self.values[idx]
            if x == value:
                return  # 重複を許さない
            elif x < value:
                path_left.append(idx)
                idx = self.left[idx]
            else:
                idx = self.right[idx]

        if x < value:
            self.left[path[-1]] = len(self.values)
        else:
            self.right[path[-1]] = len(self.values)
        self.left.append(-1)
        self.right.append(-1)
        self.values.append(x)
        self.diff.append(0)
        self.size_l.append(0)

        for idx_ in path_left:
            self.size_l[idx_] += 1

        self.diff[path[-1]] += 1 if x < value else -1
        for idx, idx_par in zip(path[:0:-1], path[-2::-1]):
            diff = self.diff[idx]
            if diff == 0:
                return
            elif diff == 2:  # 右回転
                idx_l = self.left[idx]  # 左の子
                if self.diff[idx_l] == -1:  # 左右のパターン
                    self.rotate_left(idx, 0)
                self.rotate_right(idx_par, self.right[idx_par]==idx)
                return
            elif diff == -2:  # 左回転
                idx_r = self.right[idx]  # 右の子
                if self.diff[idx_r] == 1:  # 右左のパターン
                    self.rotate_right(idx, 1)
                self.rotate_left(idx_par, self.right[idx_par]==idx)
                return
            else:
                self.diff[idx_par] += 1 if self.left[idx_par]==idx else -1

    def remove(self):  # erase
        raise NotImplementedError

    def __contains__(self, x):  # count
        raise NotImplementedError

    def bisect_left(self, x):  # lower_bound
        idx = self.right[0]
        res = 0
        while idx != -1:
            value = self.values[idx]
            if value == x:
                return res + self.size_l[idx]
            elif value < x:
                res += self.size_l[idx] + 1
                idx = self.right[idx]
            else:
                idx = self.left[idx]
        return res

    def bisect_right(self):  # upper_bound
        raise NotImplementedError


from bisect import bisect_left
import sys
input = sys.stdin.readline
A, B, Q = map(int, input().split())

S = [int(input()) for _ in range(A)]
T = [int(input()) for _ in range(B)]
avl_S = AvlTree(S, True)
avl_T = AvlTree(T, True)

def f(x):
    if 0 <= x and A - 1 >= x:
        return True
    return False
def g(x):
    if 0 <= x and B - 1 >= x:
        return True
    return False

for i in range(Q):
    x = int(input())
    p = avl_S.bisect_left(x)
    m = avl_T.bisect_left(x)

    res = []
    if f(p) and g(m):
        res.append(max(T[m], S[p]) - x)
    if f(p) and g(m - 1):
        res.append(min(S[p] - x, x - T[m - 1]) + S[p] - T[m - 1])
    if f(p - 1) and g(m):
        res.append(T[m] - S[p - 1] + min(T[m] - x, x - S[p - 1]))
    if f(p - 1) and g(m - 1):
        res.append(x - min(T[m - 1], S[p - 1]))
    print(min(res))

Submission status: Accepted

Solution code:
# space2 re
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:
      n = len(values)
      self.left = [-1] * (n+1)
      self.right = [-1] * (n+1)
      self.values = [-float("inf")] + values
      self.diff = [0] * (n+1)  # left - right
      self.size_l = [0] * (n+1)
      if not sorted_:
        values.sort()

      st = [[1, n+1, 0]]
      while len(st) > 0:
        l, r, idx_par = st.pop()  # 半開区間
        c = (l+r) // 2
        if self.values[c] < self.values[idx_par]:
          self.left[idx_par] = c
        else:
          self.right[idx_par] = c
        siz = r - l
        if siz & -siz == siz and siz != 1:  # 2冪だったら
          self.diff[c] = 1
        siz_l = c - l
        self.size_l[c] = siz_l
        if siz_l > 0:
          st.append([l, c, c])
          c1 = c + 1
          if c1 < r:  # 左にノードがなければ右には必ず無いので
            st.append([c1, r, c])

  # def print(self):
  #   print(f"left  ={self.left}")
  #   print(f"right ={self.right}")
  #   print(f"values={self.values}")
  #   print(f"diff  ={self.diff}")
  #   print(f"dixr_l={self.size_l}")

  def rotate_right(self, idx_par, lr):  # lr: 親の左なら 0
    idx = self.left[idx_par] if lr==0 else self.right[idx_par]
    idx_l = self.left[idx]
    assert idx_l != -1  # 左の子が存在する

    # 部分木の大きさの計算
    self.size_l[idx] -= self.size_l[idx_l] + 1

    # 高さの計算
    a = self.diff[idx]
    b = self.diff[idx_l]  # 左の子の高さの差
    if b >= 0:
      na = a - 1 - b
      if na >= 0:
        nb = b - 1
      else:
        nb = a - 2
    else:
      na = a - 1
      if na >= 0:
        nb = b - 1
      else:
        nb = a + b - 2
    self.diff[idx] = na
    self.diff[idx_l] = nb

    # 回転
    self.left[idx] = self.right[idx_l]
    self.right[idx_l] = idx
    if lr==0:
      self.left[idx_par] = idx_l
    else:
      self.right[idx_par] = idx_l

  def rotate_left(self, idx_par, lr):  # lr: 親の左なら 0
    idx = self.left[idx_par] if lr==0 else self.right[idx_par]
    idx_r = self.right[idx]
    assert idx_r != -1  # 右の子が存在する

    # 部分木の大きさの計算
    self.size_l[idx_r] += self.size_l[idx] + 1

    # 高さの計算
    a = self.diff[idx]
    b = self.diff[idx_r]  # 右の子の高さの差
    if b <= 0:
      na = a + 1 - b
      if na <= 0:
        nb = b + 1
      else:
        nb = a + 2
    else:
      na = a + 1
      if na <= 0:
        nb = b + 1
      else:
        nb = a + b + 2
    self.diff[idx] = na
    self.diff[idx_r] = nb

    # 回転
    self.right[idx] = self.left[idx_r]
    self.left[idx_r] = idx
    if lr == 0:
      self.left[idx_par] = idx_r
    else:
      self.right[idx_par] = idx_r

  def add(self, x):  # insert
    idx = 0
    path = []
    path_left = []
    while idx != -1:
      path.append(idx)
      value = self.values[idx]
      if x == value:
        return  # 重複を許さない
      elif x < value:
        path_left.append(idx)
        idx = self.left[idx]
      else:
        idx = self.right[idx]

    if x < value:
      self.left[path[-1]] = len(self.values)
    else:
      self.right[path[-1]] = len(self.values)
    self.left.append(-1)
    self.right.append(-1)
    self.values.append(x)
    self.diff.append(0)
    self.size_l.append(0)

    for idx_ in path_left:
      self.size_l[idx_] += 1

    self.diff[path[-1]] += 1 if x < value else -1
    for idx, idx_par in zip(path[:0:-1], path[-2::-1]):
      diff = self.diff[idx]
      if diff == 0:
        return
      elif diff == 2:  # 右回転
        idx_l = self.left[idx]  # 左の子
        if self.diff[idx_l] == -1:  # 左右のパターン
          self.rotate_left(idx, 0)
        self.rotate_right(idx_par, self.right[idx_par]==idx)
        return
      elif diff == -2:  # 左回転
        idx_r = self.right[idx]  # 右の子
        if self.diff[idx_r] == 1:  # 右左のパターン
          self.rotate_right(idx, 1)
        self.rotate_left(idx_par, self.right[idx_par]==idx)
        return
      else:
        self.diff[idx_par] += 1 if self.left[idx_par]==idx else -1

  def remove(self):  # erase
    raise NotImplementedError

  def __contains__(self, x):  # count
    raise NotImplementedError

  def bisect_left(self, x):  # lower_bound
    idx = self.right[0]
    res = 0
    while idx != -1:
      value = self.values[idx]
      if value == x:
        return res + self.size_l[idx]
      elif value < x:
        res += self.size_l[idx] + 1
        idx = self.right[idx]
      else:
        idx = self.left[idx]
    return res

  def bisect_right(self):  # upper_bound
    raise NotImplementedError


from bisect import bisect_left
import sys
input = sys.stdin.readline
A, B, Q = map(int, input().split())

S = [int(input()) for _ in range(A)]
T = [int(input()) for _ in range(B)]
avl_S = AvlTree(S, True)
avl_T = AvlTree(T, True)

def f(x):
  if 0 <= x and A - 1 >= x:
    return True
  return False
def g(x):
  if 0 <= x and B - 1 >= x:
    return True
  return False

for i in range(Q):
  x = int(input())
  p = avl_S.bisect_left(x)
  m = avl_T.bisect_left(x)

  res = []
  if f(p) and g(m):
    res.append(max(T[m], S[p]) - x)
  if f(p) and g(m - 1):
    res.append(min(S[p] - x, x - T[m - 1]) + S[p] - T[m - 1])
  if f(p - 1) and g(m):
    res.append(T[m] - S[p - 1] + min(T[m] - x, x - S[p - 1]))
  if f(p - 1) and g(m - 1):
    res.append(x - min(T[m - 1], S[p - 1]))
  print(min(res))

Submission status: Accepted

Solution code:
# //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:
      n = len(values)
      self.left = [-1] * (n+1)
      self.right = [-1] * (n+1)
      self.values = [-float("inf")] + values
      self.diff = [0] * (n+1)  # left - right
      self.size_l = [0] * (n+1)
      if not sorted_:
        values.sort()

      st = [[1, n+1, 0]]
      while len(st) > 0:
        l, r, idx_par = st.pop()  # 半開区間
        c = (l+r) // 2
        if self.values[c] < self.values[idx_par]:
          self.left[idx_par] = c
        else:
          self.right[idx_par] = c
        siz = r - l
        if siz & -siz == siz and siz != 1:  # 2冪だったら
          self.diff[c] = 1
        siz_l = c - l
        self.size_l[c] = siz_l
        if siz_l > 0:
          st.append([l, c, c])
          c1 = c + 1
          if c1 < r:  # 左にノードがなければ右には必ず無いので
            st.append([c1, r, c])

  # def print(self):
  #   print(f"left  ={self.left}")
  #   print(f"right ={self.right}")
  #   print(f"values={self.values}")
  #   print(f"diff  ={self.diff}")
  #   print(f"dixr_l={self.size_l}")

  def rotate_right(self, idx_par, lr):  # lr: 親の左なら 0
    idx = self.left[idx_par] if lr==0 else self.right[idx_par]
    idx_l = self.left[idx]
    assert idx_l != -1  # 左の子が存在する

    # 部分木の大きさの計算
    self.size_l[idx] -= self.size_l[idx_l] + 1

    # 高さの計算
    a = self.diff[idx]
    b = self.diff[idx_l]  # 左の子の高さの差
    if b >= 0:
      na = a - 1 - b
      if na >= 0:
        nb = b - 1
      else:
        nb = a - 2
    else:
      na = a - 1
      if na >= 0:
        nb = b - 1
      else:
        nb = a + b - 2
    self.diff[idx] = na
    self.diff[idx_l] = nb

    # 回転
    self.left[idx] = self.right[idx_l]
    self.right[idx_l] = idx
    if lr==0:
      self.left[idx_par] = idx_l
    else:
      self.right[idx_par] = idx_l

  def rotate_left(self, idx_par, lr):  # lr: 親の左なら 0
    idx = self.left[idx_par] if lr==0 else self.right[idx_par]
    idx_r = self.right[idx]
    assert idx_r != -1  # 右の子が存在する

    # 部分木の大きさの計算
    self.size_l[idx_r] += self.size_l[idx] + 1

    # 高さの計算
    a = self.diff[idx]
    b = self.diff[idx_r]  # 右の子の高さの差
    if b <= 0:
      na = a + 1 - b
      if na <= 0:
        nb = b + 1
      else:
        nb = a + 2
    else:
      na = a + 1
      if na <= 0:
        nb = b + 1
      else:
        nb = a + b + 2
    self.diff[idx] = na
    self.diff[idx_r] = nb

    # 回転
    self.right[idx] = self.left[idx_r]
    self.left[idx_r] = idx
    if lr == 0:
      self.left[idx_par] = idx_r
    else:
      self.right[idx_par] = idx_r

  def add(self, x):  # insert
    idx = 0
    path = []
    path_left = []
    while idx != -1:
      path.append(idx)
      value = self.values[idx]
      if x == value:
        return  # 重複を許さない
      elif x < value:
        path_left.append(idx)
        idx = self.left[idx]
      else:
        idx = self.right[idx]

    if x < value:
      self.left[path[-1]] = len(self.values)
    else:
      self.right[path[-1]] = len(self.values)
    self.left.append(-1)
    self.right.append(-1)
    self.values.append(x)
    self.diff.append(0)
    self.size_l.append(0)

    for idx_ in path_left:
      self.size_l[idx_] += 1

    self.diff[path[-1]] += 1 if x < value else -1
    for idx, idx_par in zip(path[:0:-1], path[-2::-1]):
      diff = self.diff[idx]
      if diff == 0:
        return
      elif diff == 2:  # 右回転
        idx_l = self.left[idx]  # 左の子
        if self.diff[idx_l] == -1:  # 左右のパターン
          self.rotate_left(idx, 0)
        self.rotate_right(idx_par, self.right[idx_par]==idx)
        return
      elif diff == -2:  # 左回転
        idx_r = self.right[idx]  # 右の子
        if self.diff[idx_r] == 1:  # 右左のパターン
          self.rotate_right(idx, 1)
        self.rotate_left(idx_par, self.right[idx_par]==idx)
        return
      else:
        self.diff[idx_par] += 1 if self.left[idx_par]==idx else -1

  def remove(self):  # erase
    raise NotImplementedError

  def __contains__(self, x):  # count
    raise NotImplementedError

  def bisect_left(self, x):  # lower_bound
    idx = self.right[0]
    res = 0
    while idx != -1:
      value = self.values[idx]
      if value == x:
        return res + self.size_l[idx]
      elif value < x:
        res += self.size_l[idx] + 1
        idx = self.right[idx]
      else:
        idx = self.left[idx]
    return res

  def bisect_right(self):  # upper_bound
    raise NotImplementedError


from bisect import bisect_left
import sys
input = sys.stdin.readline
A, B, Q = map(int, input().split())

S = [int(input()) for _ in range(A)]
T = [int(input()) for _ in range(B)]
avl_S = AvlTree(S, True)
avl_T = AvlTree(T, True)

def f(x):
  if 0 <= x and A - 1 >= x:
    return True
  return False
def g(x):
  if 0 <= x and B - 1 >= x:
    return True
  return False

for i in range(Q):
  x = int(input())
  p = avl_S.bisect_left(x)
  m = avl_T.bisect_left(x)

  res = []
  if f(p) and g(m):
    res.append(max(T[m], S[p]) - x)
  if f(p) and g(m - 1):
    res.append(min(S[p] - x, x - T[m - 1]) + S[p] - T[m - 1])
  if f(p - 1) and g(m):
    res.append(T[m] - S[p - 1] + min(T[m] - x, x - S[p - 1]))
  if f(p - 1) and g(m - 1):
    res.append(x - min(T[m - 1], S[p - 1]))
  print(min(res))

Submission status: Accepted

Solution code:
A, B, Q = map(int, input().split())

INF = 10 ** 11 + 1
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)]

def bsr(a, v):
	lo, hi = 0, len(a)
	while lo < hi:
		mid = (lo + hi) // 2
		if x < a[mid]: hi = mid
		else: lo = mid + 1
	return lo

for x in X:
	sr = bsr(S, x)
	sl = sr - 1
	tr = bsr(T, x)
	tl = tr - 1
	cost = []
	for m in [S[sr], S[sl]]:
		for n in [T[tr], T[tl]]:
			cost += [abs(x - m) + abs(m - n), abs(x - n) + abs(m - n)]
	print(min(cost))

Submission status: Accepted

Solution code:
A, B, Q = map(int, input().split())

INF = 10 ** 11 + 1
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)]

def bsr(a, v):
	lo, hi = 0, len(a)
	while lo < hi:
		mi = (lo + hi) // 2
		if v < a[mi]:
			hi = mi
		else:
			lo = mi + 1
	return lo

for x in X:
	sr = bsr(S, x)
	sl = sr - 1
	tr = bsr(T, x)
	tl = tr - 1
	cost = []
	for m in [S[sr], S[sl]]:
		for n in [T[tr], T[tl]]:
			cost += [abs(x - m) + abs(m - n), abs(x - n) + abs(m - n)]
	print(min(cost))

Submission status: Accepted

Solution code:
# 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:
            n = len(values)
            self.left = [-1] * (n+1)
            self.right = [-1] * (n+1)
            self.values = [-float("inf")] + values
            self.diff = [0] * (n+1)  # left - right
            self.size_l = [0] * (n+1)
            if not sorted_:
                values.sort()

            st = [[1, n+1, 0]]
            while len(st) > 0:
                l, r, idx_par = st.pop()  # 半開区間
                c = (l+r) // 2
                if self.values[c] < self.values[idx_par]:
                    self.left[idx_par] = c
                else:
                    self.right[idx_par] = c
                siz = r - l
                if siz & -siz == siz and siz != 1:  # 2冪だったら
                    self.diff[c] = 1
                siz_l = c - l
                self.size_l[c] = siz_l
                if siz_l > 0:
                    st.append([l, c, c])
                    c1 = c + 1
                    if c1 < r:  # 左にノードがなければ右には必ず無いので
                        st.append([c1, r, c])

    # def print(self):
    #     print(f"left  ={self.left}")
    #     print(f"right ={self.right}")
    #     print(f"values={self.values}")
    #     print(f"diff  ={self.diff}")
    #     print(f"dixr_l={self.size_l}")

    def rotate_right(self, idx_par, lr):  # lr: 親の左なら 0
        idx = self.left[idx_par] if lr==0 else self.right[idx_par]
        idx_l = self.left[idx]
        assert idx_l != -1  # 左の子が存在する

        # 部分木の大きさの計算
        self.size_l[idx] -= self.size_l[idx_l] + 1

        # 高さの計算
        a = self.diff[idx]
        b = self.diff[idx_l]  # 左の子の高さの差
        if b >= 0:
            na = a - 1 - b
            if na >= 0:
                nb = b - 1
            else:
                nb = a - 2
        else:
            na = a - 1
            if na >= 0:
                nb = b - 1
            else:
                nb = a + b - 2
        self.diff[idx] = na
        self.diff[idx_l] = nb

        # 回転
        self.left[idx] = self.right[idx_l]
        self.right[idx_l] = idx
        if lr==0:
            self.left[idx_par] = idx_l
        else:
            self.right[idx_par] = idx_l

    def rotate_left(self, idx_par, lr):  # lr: 親の左なら 0
        idx = self.left[idx_par] if lr==0 else self.right[idx_par]
        idx_r = self.right[idx]
        assert idx_r != -1  # 右の子が存在する

        # 部分木の大きさの計算
        self.size_l[idx_r] += self.size_l[idx] + 1

        # 高さの計算
        a = self.diff[idx]
        b = self.diff[idx_r]  # 右の子の高さの差
        if b <= 0:
            na = a + 1 - b
            if na <= 0:
                nb = b + 1
            else:
                nb = a + 2
        else:
            na = a + 1
            if na <= 0:
                nb = b + 1
            else:
                nb = a + b + 2
        self.diff[idx] = na
        self.diff[idx_r] = nb

        # 回転
        self.right[idx] = self.left[idx_r]
        self.left[idx_r] = idx
        if lr == 0:
            self.left[idx_par] = idx_r
        else:
            self.right[idx_par] = idx_r

    def add(self, x):  # insert
        idx = 0
        path = []
        path_left = []
        while idx != -1:
            path.append(idx)
            value = self.values[idx]
            if x == value:
                return  # 重複を許さない
            elif x < value:
                path_left.append(idx)
                idx = self.left[idx]
            else:
                idx = self.right[idx]

        if x < value:
            self.left[path[-1]] = len(self.values)
        else:
            self.right[path[-1]] = len(self.values)
        self.left.append(-1)
        self.right.append(-1)
        self.values.append(x)
        self.diff.append(0)
        self.size_l.append(0)

        for idx_ in path_left:
            self.size_l[idx_] += 1

        self.diff[path[-1]] += 1 if x < value else -1
        for idx, idx_par in zip(path[:0:-1], path[-2::-1]):
            diff = self.diff[idx]
            if diff == 0:
                return
            elif diff == 2:  # 右回転
                idx_l = self.left[idx]  # 左の子
                if self.diff[idx_l] == -1:  # 左右のパターン
                    self.rotate_left(idx, 0)
                self.rotate_right(idx_par, self.right[idx_par]==idx)
                return
            elif diff == -2:  # 左回転
                idx_r = self.right[idx]  # 右の子
                if self.diff[idx_r] == 1:  # 右左のパターン
                    self.rotate_right(idx, 1)
                self.rotate_left(idx_par, self.right[idx_par]==idx)
                return
            else:
                self.diff[idx_par] += 1 if self.left[idx_par]==idx else -1

    def remove(self):  # erase
        raise NotImplementedError

    def __contains__(self, x):  # count
        raise NotImplementedError

    def bisect_left(self, x):  # lower_bound
        idx = self.right[0]
        res = 0
        while idx != -1:
            value = self.values[idx]
            if value == x:
                return res + self.size_l[idx]
            elif value < x:
                res += self.size_l[idx] + 1
                idx = self.right[idx]
            else:
                idx = self.left[idx]
        return res

    def bisect_right(self):  # upper_bound
        raise NotImplementedError


from bisect import bisect_left
import sys
input = sys.stdin.readline
A, B, Q = map(int, input().split())

S = [int(input()) for _ in range(A)]
T = [int(input()) for _ in range(B)]
avl_S = AvlTree(S, True)
avl_T = AvlTree(T, True)

def f(x):
    if 0 <= x and A - 1 >= x:
        return True
    return False
def g(x):
    if 0 <= x and B - 1 >= x:
        return True
    return False

for i in range(Q):
    x = int(input())
    p = avl_S.bisect_left(x)
    m = avl_T.bisect_left(x)

    res = []
    if f(p) and g(m):
        res.append(max(T[m], S[p]) - x)
    if f(p) and g(m - 1):
        res.append(min(S[p] - x, x - T[m - 1]) + S[p] - T[m - 1])
    if f(p - 1) and g(m):
        res.append(T[m] - S[p - 1] + min(T[m] - x, x - S[p - 1]))
    if f(p - 1) and g(m - 1):
        res.append(x - min(T[m - 1], S[p - 1]))
    print(min(res))

Submission status: Accepted

Solution code:
A, B, Q = map(int, input().split())

INF = 10 ** 11 + 1
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)]

def bsr(a, v):
	lo, hi = 0, len(a) - 1
	while lo <= hi:
		mi = (lo + hi) // 2
		if v < a[mi]:
			hi = mi - 1
		else:
			lo = mi + 1
	return lo

for x in X:
	sr = bsr(S, x)
	sl = sr - 1
	tr = bsr(T, x)
	tl = tr - 1
	cost = []
	for m in [S[sr], S[sl]]:
		for n in [T[tr], T[tl]]:
			cost += [abs(x - m) + abs(m - n), abs(x - n) + abs(m - n)]
	print(min(cost))