#682332 (Crystal) No.861 ケーキカット

提出ソース

結果

問題	No.861 ケーキカット
ユーザー	te-sh
提出日時	2021-07-23 12:50:58
言語	Crystal (1.11.2)
結果	AC
実行時間	57 ms / 1,000 ms
コード長	6,130 bytes
コンパイル時間	15,047 ms
コンパイル使用メモリ	304,988 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-07-18 08:58:31
合計ジャッジ時間	17,023 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	55 ms 6,812 KB
testcase_01	AC	54 ms 6,816 KB
testcase_02	AC	55 ms 6,940 KB
testcase_03	AC	55 ms 6,940 KB
testcase_04	AC	54 ms 6,940 KB
testcase_05	AC	54 ms 6,944 KB
testcase_06	AC	55 ms 6,944 KB
testcase_07	AC	55 ms 6,940 KB
testcase_08	AC	54 ms 6,940 KB
testcase_09	AC	54 ms 6,940 KB
testcase_10	AC	55 ms 6,940 KB
testcase_11	AC	54 ms 6,944 KB
testcase_12	AC	56 ms 6,944 KB
testcase_13	AC	56 ms 6,940 KB
testcase_14	AC	57 ms 6,940 KB
testcase_15	AC	56 ms 6,940 KB
testcase_16	AC	56 ms 6,944 KB
testcase_17	AC	57 ms 6,940 KB
testcase_18	AC	57 ms 6,940 KB
testcase_19	AC	57 ms 6,944 KB
testcase_20	AC	56 ms 6,940 KB
testcase_21	AC	57 ms 6,940 KB
testcase_22	AC	56 ms 6,944 KB
testcase_23	AC	56 ms 6,944 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

In Main.cr:61:19

 61 | def get({{ *(1..i).map { |j| "k#{j}".id } }})
                  ^
Warning: Deprecated use of splat operator. Use `#splat` instead

In Main.cr:62:15

 62 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} }
            ^
Warning: Deprecated use of splat operator. Use `#splat` instead

In Main.cr:61:19

 61 | def get({{ *(1..i).map { |j| "k#{j}".id } }})
                  ^
Warning: Deprecated use of splat operator. Use `#splat` instead

In Main.cr:62:15

 62 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} }
            ^
Warning: Deprecated use of splat operator. Use `#splat` instead

In Main.cr:61:19

 61 | def get({{ *(1..i).map { |j| "k#{j}".id } }})
                  ^
Warning: Deprecated use of splat operator. Use `#splat` instead

In Main.cr:62:15

 62 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} }
            ^
Warning: Deprecated use of splat operator. Use `#splat` instead

In Main.cr:61:19

 61 | def get({{ *(1..i).map { |j| "k#{j}".id } }})
                  ^
Warning: Deprecated use of splat operator. Use `#splat` instead

In Main.cr:62:15

 62 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} }
            ^
Warning: Deprecated use of splat operator. Use `#splat` instead

In Main.cr:61:19

 61 | def get({{ *(1..i).map { |j| "k#{j}".id } }})
                  ^
Warning: Deprecated use of splat operator. Use `#splat` instead

In Main.cr:62:15

 62 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} }
            ^
Warning: Deprecated use of splat operator. Use `#splat` instead

In Main.cr:61:19

 61 | def get({{ *(1..i).map { |j| "k#{j}".id } }})
                  ^
Warning: Deprecated use of splat operator. Use `#splat` instead

In Main.cr:62:15

 62 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} }
            ^
Warning: Deprecated use of splat operator. Use `#splat` instead

In Main.cr:61:19

 61 | def get({{ *(1..i).map { |j| "k#{j}".id } }})
                  ^
Warning: Deprecated use of splat operator. Use `#splat` instead

In Main.cr:62:15

 62

ソースコード

raw source code

def solve(io)
  c = io.get_m(5, 5, Int64)
  d = c.flatten
  ds = d.sum

  s = [0]
  (1..15).each do |i|
    (0..15-i).each do |j|
      s << (((1 << i) - 1) << j)
    end
  end

  r = 10_i64**18
  s.each do |si|
    (1 << 9).times do |ti|
      p = 0
      {0, 1, 2, 3, 4, 9, 14, 19, 24, 23, 22, 21, 20, 15, 10, 5}.each_with_index do |i, j|
        p = p.set_bit(i) if si.bit?(j)
      end
      {6, 7, 8, 11, 12, 13, 16, 17, 18}.each_with_index do |i, j|
        p = p.set_bit(i) if ti.bit?(j)
      end

      uf = UnionFind.new(25)
      5.times do |i|
        4.times do |j|
          x1 = i * 5 + j
          x2 = x1 + 1
          uf.unite(x1, x2) if p.bit?(x1) == p.bit?(x2)

          y1 = j * 5 + i
          y2 = y1 + 5
          uf.unite(y1, y2) if p.bit?(y1) == p.bit?(y2)
        end
      end
      next unless uf.count_forests == 2

      e = 0_i64
      25.times do |i|
        e += d[i] unless p.bit?(i)
      end
      min_u(r, (e * 2 - ds).abs)
    end
  end

  io.put r
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({{ *(1..i).map { |j| "k#{j}".id } }})
        { {{ *(1..i).map { |j| "get(k#{j})".id } }} }
      end
    {% end %}
  end
  define_get

  macro define_getn
    {% for i in (2..9) %}
      def get{{i}}(k : T.class = Int32) forall T
        get({{ *(1..i).map { "k".id } }})
      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, {{ *(1..i).map { |j| "k#{j}".id } }})
        a = Array.new(n) { get({{ *(1..i).map { |j| "k#{j}".id } }}) }
        { {{ *(1..i).map { |j| "a.map { |e| e[#{j-1}] }".id } }} }
      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, {{ *(1..i).map { "k".id } }})
      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({{ *(1..i).map { |j| "v#{j}".id } }}, *, 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

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

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

class UnionFind
  def initialize(@n : Int32)
    @s = @n
    @p = Array.new(@n, @s)
    @cf = @n
    @cn = Array.new(@n, 1)
  end

  def unite(u : Int, v : Int)
    pu, pv = subst(u), subst(v)
    if pu != pv
      @p[pv] = pu
      @cf -= 1
      @cn[pu] += @cn[pv]
    end
    pu != pv
  end

  def subst(u : Int) : Int32
    @p[u] == @s ? u.to_i32 : (@p[u] = subst(@p[u]))
  end

  def same?(u : Int, v : Int)
    subst(u) == subst(v)
  end

  def count_forests
    @cf
  end

  def count_nodes_of(u : Int)
    @cn[subst(u)]
  end


  @p : Array(Int32)
  @cn : Array(Int32)
end

solve(ProconIO.new)

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード