#687232 (Crystal) No.1640 簡単な色塗り

提出ソース

結果

問題	No.1640 簡単な色塗り
ユーザー	te-sh
提出日時	2021-08-07 15:39:18
言語	Crystal (1.11.2)
結果	TLE
実行時間	-
コード長	9,285 bytes
コンパイル時間	13,114 ms
コンパイル使用メモリ	307,124 KB
実行使用メモリ	110,080 KB
最終ジャッジ日時	2024-06-29 16:52:31
合計ジャッジ時間	23,304 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 10,624 KB
testcase_01	AC	1 ms 5,248 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	1 ms 5,376 KB
testcase_04	AC	289 ms 90,752 KB
testcase_05	AC	287 ms 91,008 KB
testcase_06	AC	1 ms 5,376 KB
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	2 ms 5,376 KB
testcase_09	AC	2 ms 5,376 KB
testcase_10	AC	998 ms 67,456 KB
testcase_11	AC	800 ms 55,280 KB
testcase_12	AC	678 ms 52,096 KB
testcase_13	TLE	-
testcase_14	TLE	-
testcase_15	AC	422 ms 43,828 KB
testcase_16	AC	580 ms 48,260 KB
testcase_17	AC	1,525 ms 91,504 KB
testcase_18	AC	55 ms 12,928 KB
testcase_19	AC	687 ms 50,408 KB
testcase_20	AC	1,020 ms 66,592 KB
testcase_21	AC	760 ms 54,716 KB
testcase_22	AC	36 ms 9,728 KB
testcase_23	AC	1,106 ms 77,300 KB
testcase_24	AC	188 ms 24,272 KB
testcase_25	AC	681 ms 50,908 KB
testcase_26	AC	1,292 ms 81,116 KB
testcase_27	AC	371 ms 42,552 KB
testcase_28	AC	1,959 ms 94,952 KB
testcase_29	AC	1,238 ms 80,684 KB
testcase_30	AC	31 ms 15,104 KB
testcase_31	AC	313 ms 92,888 KB
testcase_32	AC	276 ms 75,960 KB
testcase_33	AC	171 ms 50,528 KB
testcase_34	AC	279 ms 68,928 KB
testcase_35	AC	137 ms 50,884 KB
testcase_36	AC	31 ms 16,716 KB
testcase_37	AC	40 ms 19,764 KB
testcase_38	AC	278 ms 80,548 KB
testcase_39	AC	94 ms 37,432 KB
testcase_40	AC	85 ms 37,040 KB
testcase_41	AC	190 ms 64,476 KB
testcase_42	AC	98 ms 42,596 KB
testcase_43	AC	124 ms 45,224 KB
testcase_44	AC	102 ms 41,488 KB
testcase_45	AC	81 ms 29,492 KB
testcase_46	AC	35 ms 18,280 KB
testcase_47	AC	22 ms 11,776 KB
testcase_48	AC	300 ms 79,844 KB
testcase_49	AC	10 ms 6,940 KB
testcase_50	AC	2 ms 6,944 KB
testcase_51	AC	2 ms 6,940 KB
testcase_52	AC	581 ms 104,412 KB
testcase_53	TLE	-
07_evil_01.txt	--	-
07_evil_02.txt	--	-

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

コンパイルメッセージ

In Main.cr:37:19

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

In Main.cr:38:15

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

In Main.cr:37:19

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

In Main.cr:38:15

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

In Main.cr:37:19

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

In Main.cr:38:15

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

In Main.cr:37:19

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

In Main.cr:38:15

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

In Main.cr:37:19

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

In Main.cr:38:15

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

In Main.cr:37:19

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

In Main.cr:38:15

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

In Main.cr:37:19

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

In Main.cr:38:15

 38

ソースコード

raw source code

def solve(io)
  n = io.get

  g = GraphW(Int32).new(n * 2 + 2)
  s, t = n * 2, n * 2 + 1
  n.times do |i|
    g.add_edge(s, i, 1)
    g.add_edge(i + n, t, 1)

    ai, bi = io.get2; ai -= 1; bi -= 1
    g.add_edge(i, ai + n, 1)
    g.add_edge(i, bi + n, 1)
  end

  ff = g.dinic(s, t)
  io.put_e "No" unless ff.flow == n

  fg = ff.flow_graph
  io.put "Yes"
  n.times do |i|
    io.put fg[i][0].dst - n + 1
  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({{ *(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.35.0") < 0 %}
    def digits(base = 10)
      raise ArgumentError.new("Invalid base #{base}") if base < 2
      raise ArgumentError.new("Can't request digits of negative number") if self < 0
      return [0] if self == 0

      num = self
      digits_count = (Math.log(self.to_f + 1) / Math.log(base)).ceil.to_i
      ary = Array(Int32).new(digits_count)
      while num != 0
        ary << num.remainder(base).to_i
        num = num.tdiv(base)
      end
      ary
    end
  {% 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 Float64
  def near?(x)
    (self - x).abs <= (self.abs < x.abs ? x.abs : 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

module Math
  {% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "1.2.0") < 0 %}
    def isqrt(value : Int::Primitive)
      raise ArgumentError.new "Input must be non-negative integer" if value < 0
      return value if value < 2
      res = value.class.zero
      bit = res.succ << (res.leading_zeros_count - 2)
      bit >>= value.leading_zeros_count & ~0x3
      while (bit != 0)
        if value >= res + bit
          value -= res + bit
          res = (res >> 1) + bit
        else
          res >>= 1
        end
        bit >>= 2
      end
      res
    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

require "bit_array"

class Graph
  alias Node = Int32

  def initialize(@size : Node)
    @g = Array(Array(Node)).new(@size) { [] of Node }
  end

  getter size : Int32

  delegate :[], to: @g

  def add_edge(u : Node, v : Node)
    @g[u] << v
  end

  def add_edge_b(u : Node, v : Node)
    @g[u] << v
    @g[v] << u
  end

  def bfs(u : Node)
    b = BitArray.new(@size)
    yield u, -1
    b[u] = true
    q = Deque.new([u])
    until q.empty?
      v = q.shift
      @g[v].each do |w|
        next if b[w]
        yield w, v
        b[w] = true
        q.push(w)
      end
    end
  end
end

class GraphW(T)
  alias Node = Int32

  struct Edge(T)
    def initialize(@src : Node, @dst : Node, @wt : T)
    end

    getter src : Node, dst : Node

    getter wt : T
  end
      
  def initialize(@size : Node, @inf = 10**9)
    @g = Array(Array(Edge(T))).new(@size) { [] of Edge(T) }
  end

  getter size : Int32

  getter inf : T

  delegate :[], to: @g

  def add_edge(u : Node, v : Node, wt : T)
    @g[u] << Edge.new(u, v, wt)
  end

  def add_edge_b(u : Node, v : Node, wt : T)
    @g[u] << Edge.new(u, v, wt)
    @g[v] << Edge.new(v, u, wt)
  end
end

class GraphM(T)
  alias Node = Int32

  def initialize(@size : Int32, @inf = 10**9)
    @g = Array.new_md(@size, @size, @inf)
    @size.times do |i|
      @g[i][i] = T.zero
    end
  end

  getter size : Int32

  getter inf : T

  delegate :[], to: @g

  def add_edge(u : Node, v : Node, wt : T)
    @g[u][v] = wt
  end

  def add_edge_b(u : Node, v : Node, wt : T)
    @g[u][v] = @g[v][u] = wt
  end


  @g : Array(Array(T))
end

class Dinic(T)
  alias Node = GraphW::Node

  def initialize(@g : GraphW(T), @s : Node, @t : Node)
    @adj = build_adj
    @level = Array.new(@g.size, 0)
    @flow = T.zero

    while levelize >= 0
      iter = @adj.map(&.each)
      while (f = augment(iter, @s, @g.inf)) > 0
        @flow += f
      end
    end
  end

  getter flow : T

  def flow_graph
    g = GraphW(T).new(@g.size, @g.inf)
    @g.size.times do |i|
      @adj[i].each do |e|
        if e.flow > T.zero
          g.add_edge(e.src, e.dst, e.flow)
        end
      end
    end
    g
  end


  class EdgeR(T)
    def initialize(@src : Node, @dst : Node, @cap : T, @flow : T, @rev : Node)
    end

    getter src, dst, cap, rev
    property flow
  end

  def build_adj
    adj = Array.new(@g.size) { [] of EdgeR(T) }
    @g.size.times do |i|
      @g[i].each do |e|
        adj[e.src] << EdgeR.new(e.src, e.dst, e.wt, T.zero, adj[e.dst].size)
        adj[e.dst] << EdgeR.new(e.dst, e.src, T.zero, T.zero, adj[e.src].size - 1)
      end
    end
    adj
  end

  def levelize
    @level.fill(-1)
    @level[@s] = 0

    q = Deque(Node){@s}
    until q.empty?
      u = q.shift
      break if u == @t
      @adj[u].each do |e|
        if e.cap > e.flow && @level[e.dst] < 0
          q.push(e.dst)
          @level[e.dst] = @level[u] + 1
        end
      end
    end

    @level[@t]
  end

  def augment(iter, u : Node, cur : T)
    return cur if u == @t

    iter[u].each do |e|
      r = @adj[e.dst][e.rev]
      if e.cap > e.flow && @level[u] < @level[e.dst]
        f = augment(iter, e.dst, {e.cap - e.flow, cur}.min)
        if f > 0
          e.flow += f
          r.flow -= f
          return f
        end
      end
    end

    T.zero
  end

  @adj : Array(Array(EdgeR(T)))
  @level : Array(Int32)
end

class GraphW(T)
  def dinic(s, t)
    Dinic.new(self, s, t)
  end
end

solve(ProconIO.new)

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード