結果

問題 No.771 しおり
ユーザー te-shte-sh
提出日時 2021-07-15 15:02:27
言語 Crystal
(1.11.2)
結果
AC  
実行時間 800 ms / 2,000 ms
コード長 5,652 bytes
コンパイル時間 18,976 ms
コンパイル使用メモリ 261,676 KB
実行使用メモリ 23,072 KB
最終ジャッジ日時 2023-09-29 13:09:28
合計ジャッジ時間 29,228 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 746 ms
23,072 KB
testcase_01 AC 49 ms
6,416 KB
testcase_02 AC 2 ms
4,364 KB
testcase_03 AC 2 ms
4,360 KB
testcase_04 AC 2 ms
4,364 KB
testcase_05 AC 3 ms
4,364 KB
testcase_06 AC 2 ms
4,364 KB
testcase_07 AC 2 ms
4,368 KB
testcase_08 AC 3 ms
4,440 KB
testcase_09 AC 2 ms
4,364 KB
testcase_10 AC 2 ms
4,364 KB
testcase_11 AC 3 ms
4,388 KB
testcase_12 AC 2 ms
4,400 KB
testcase_13 AC 2 ms
4,400 KB
testcase_14 AC 3 ms
4,472 KB
testcase_15 AC 2 ms
4,412 KB
testcase_16 AC 2 ms
4,364 KB
testcase_17 AC 2 ms
4,364 KB
testcase_18 AC 2 ms
4,364 KB
testcase_19 AC 2 ms
4,408 KB
testcase_20 AC 3 ms
4,364 KB
testcase_21 AC 2 ms
4,364 KB
testcase_22 AC 2 ms
4,360 KB
testcase_23 AC 2 ms
4,368 KB
testcase_24 AC 2 ms
4,364 KB
testcase_25 AC 292 ms
13,308 KB
testcase_26 AC 7 ms
4,652 KB
testcase_27 AC 49 ms
6,352 KB
testcase_28 AC 110 ms
8,592 KB
testcase_29 AC 47 ms
6,384 KB
testcase_30 AC 769 ms
22,920 KB
testcase_31 AC 740 ms
22,888 KB
testcase_32 AC 11 ms
4,748 KB
testcase_33 AC 748 ms
22,952 KB
testcase_34 AC 777 ms
22,924 KB
testcase_35 AC 11 ms
4,812 KB
testcase_36 AC 4 ms
4,380 KB
testcase_37 AC 4 ms
4,432 KB
testcase_38 AC 11 ms
4,752 KB
testcase_39 AC 4 ms
4,384 KB
testcase_40 AC 291 ms
13,652 KB
testcase_41 AC 757 ms
22,884 KB
testcase_42 AC 754 ms
22,924 KB
testcase_43 AC 48 ms
6,336 KB
testcase_44 AC 800 ms
22,932 KB
testcase_45 AC 735 ms
22,936 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

def solve(io)
  n = io.get
  a, b = io.get2_c(n)

  memo = Array.new_md(n, 1 << n, -1)
  calc = uninitialized Int32, Int32 -> Int32
  calc = ->(i : Int32, s : Int32) do
    return 0 if s == 0
    return memo[i][s] if memo[i][s] >= 0

    m = 100_000
    n.times do |j|
      if s.bit?(j)
        min_u(m, Math.max((b[i] - a[i]) + a[j], calc.call(j, s.reset_bit(j))))
      end
    end

    memo[i][s] = m
  end

  io.put (0...n).map { |i| calc.call(i, ((1 << n) - 1).reset_bit(i)) }.min
end

struct Int
  def cdiv(b : Int)
    (self + b - 1) // b
  end

  def bit?(i : Int)
    bit(i) == 1
  end

  def set_bit(i : Int)
    self | (self.class.new(1) << i)
  end

  def reset_bit(i : Int)
    self & ~(self.class.new(1) << i)
  end

  {% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "0.34.0") < 0 %}
    def bit_length : Int32
      x = self < 0 ? ~self : self

      if x.is_a?(Int::Primitive)
        Int32.new(sizeof(self) * 8 - x.leading_zeros_count)
      else
        to_s(2).size
      end
    end
  {% end %}
end

struct Int32
  SQRT_MAX = 46_340_i32

  def isqrt
    m = SQRT_MAX
    r = (1_i32..SQRT_MAX).bsearch { |i| i**2 > self }
    r.nil? ? SQRT_MAX : r - 1
  end
end

struct Int64
  SQRT_MAX = 3_037_000_499_i64

  def isqrt
    r = (1_i64..SQRT_MAX).bsearch { |i| i**2 > self }
    r.nil? ? SQRT_MAX : r - 1
  end
end

struct Float64
  def near_zero?
    self.abs < EPSILON
  end
end

struct Number
  {% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "1.1.0") < 0 %}
    def zero?
      self == 0
    end

    def positive?
      self > 0
    end

    def negative?
      self < 0
    end
  {% end %}

  {% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "0.36.0") < 0 %}
    def self.additive_identity
      zero
    end

    def self.multiplicative_identity
      new(1)
    end
  {% end %}
end

class Array
  macro new_md(*args, &block)
    {% if !block %}
      {% for arg, i in args[0...-2] %}
        Array.new({{arg}}) {
      {% end %}
      Array.new({{args[-2]}}, {{args[-1]}})
      {% for arg in args[0...-2] %}
        }
      {% end %}
    {% else %}
      {% for arg, i in args %}
        Array.new({{arg}}) { |_i{{i}}|
      {% end %}
      {% for block_arg, i in block.args %}
        {{block_arg}} = _i{{i}}
      {% end %}
      {{block.body}}
      {% for arg in args %}
        }
      {% end %}
    {% end %}
  end
end

class ProconIO
  def initialize(@ins : IO = STDIN, @outs : IO = STDOUT)
    @buf = IO::Memory.new("")
  end

  def get(k : T.class = Int32) forall T
    get_v(k)
  end

  macro define_get
    {% for i in (2..9) %}
      def get(
            {% for j in (1..i) %}
              k{{j}}{% if j < i %},{% end %}
            {% end %}
          )
        {
          {% for j in (1..i) %}
            get(k{{j}}){% if j < i %},{% end %}
          {% end %}
        }
      end
    {% end %}
  end
  define_get

  macro define_getn
    {% for i in (2..9) %}
      def get{{i}}(k : T.class = Int32) forall T
        get(
          {% for j in (1..i) %}
            k{% if j < i %}, {% end %}
          {% end %}
        )
      end
    {% end %}
  end
  define_getn

  def get_a(n : Int, k : T.class = Int32) forall T
    Array.new(n) { get_v(k) }
  end

  def get_c(n : Int, k : T.class = Int32) forall T
    get_a(n, k)
  end

  macro define_get_c
    {% for i in (2..9) %}
      def get_c(
            n : Int,
            {% for j in (1..i) %}
              k{{j}}{% if j < i %},{% end %}
            {% end %}
          )
        a = Array.new(n) do
          get(
            {% for j in (1..i) %}
              k{{j}}{% if j < i %},{% end %}
            {% end %}
          )
        end
        {
          {% for j in (1..i) %}
            a.map { |e| e[{{j-1}}] }{% if j < i %},{% end %}
          {% end %}
        }
      end
    {% end %}
  end
  define_get_c

  macro define_getn_c
    {% for i in (2..9) %}
      def get{{i}}_c(n : Int, k : T.class = Int32) forall T
        get_c(
          n,
          {% for j in (1..i) %}
            k{% if j < i %},{% end %}
          {% end %}
        )
      end
    {% end %}
  end
  define_getn_c

  def get_m(r : Int, c : Int, k : T.class = Int32) forall T
    Array.new(r) { get_a(c, k) }
  end

  macro define_put
    {% for i in (1..9) %}
      def put(
           {% for j in (1..i) %}
             v{{j}},
           {% end %}
           *, delimiter = " "
          )
        {% for j in (1..i) %}
          print_v(v{{j}}, delimiter)
          {% if j < i %}@outs << delimiter{% end %}
        {% end %}
        @outs.puts
      end
    {% end %}
  end
  define_put

  def put_e(*vs)
    put(*vs)
    exit
  end

  def put_f(*vs)
    put(*vs)
    @outs.flush
  end


  private def get_v(k : Int32.class); get_token.to_i32; end
  private def get_v(k : Int64.class); get_token.to_i64; end
  private def get_v(k : UInt32.class); get_token.to_u32; end
  private def get_v(k : UInt64.class); get_token.to_u64; end
  private def get_v(k : Float64.class); get_token.to_f64; end
  private def get_v(k : String.class); get_token; end

  private def get_token
    loop do
      token = @buf.gets(' ', chomp: true)
      break token unless token.nil?
      @buf = IO::Memory.new(@ins.read_line)
    end
  end

  private def print_v(v, dlimiter)
    @outs << v
  end

  private def print_v(v : Enumerable, delimiter)
    v.each_with_index do |e, i|
      @outs << e
      @outs << delimiter if i < v.size - 1
    end
  end
end

macro min_u(a, b)
  {{a}} = Math.min({{a}}, {{b}})
end

macro max_u(a, b)
  {{a}} = Math.max({{a}}, {{b}})
end

macro zip(a, *b, &block)
  {{a}}.zip({{*b}}) {{block}}
end

solve(ProconIO.new)
0