提出 #67007860

---

ソースコード 拡げる

read_line.to_i.times do
  puts solve()
end

def solve
  n, m = read_line.split.map(&.to_i)
  a = read_line.split.map(&.to_i64).sort.reverse
  b = read_line.split.map(&.to_i64).sort
  b += b.map { |v| v + m }
  left = b.bsearch_index { |v, _| v + a[0] >= m }.not_nil! % n
  if ok(a, b, m, 0, left)
    return 0
  end
  lo = 0
  hi = m - 1
  while hi - lo > 1
    if hi > lo * 2
      mid = ((hi.to_i64 * {1, lo}.max) ** 0.5).round.to_i
    else
      mid = (hi + lo) // 2
    end
    if ok(a, b, m, mid, left)
      hi = mid
    else
      lo = mid
    end
  end
  hi
end

def ok(a, b, m, ans, left)
  n = a.size
  return false if (a[0] + b[left]) % m > ans
  right = left
  while right < left + n
    break if (a[0] + b[right + 1]) % m > ans
    right += 1
  end
  need = left
  1.upto(n - 1) do |i|
    need += 1
    prev_left = left
    prev_right = right
    while true
      break if a[i] + b[left] >= m
      left += 1
    end
    return false if (a[i] + b[left]) % m > ans
    while right < left + n
      break if (a[i] + b[(right + 1) % n]) % m > ans
      right += 1
    end
    if prev_right + 1 < left
      return false
    end
    if right < need
      return false
    end
    need = {need, left}.max
  end
  return right >= left + n - 1
end

提出情報

コンパイルエラー

I: Dependencies are satisfied
I: Building: main

ジャッジ結果