結果

問題 No.812 Change of Class
ユーザー te-shte-sh
提出日時 2021-07-10 13:34:58
言語 Crystal
(1.11.2)
結果
AC  
実行時間 264 ms / 4,000 ms
コード長 6,110 bytes
コンパイル時間 23,428 ms
コンパイル使用メモリ 262,620 KB
実行使用メモリ 25,280 KB
最終ジャッジ日時 2023-09-14 19:00:39
合計ジャッジ時間 33,766 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 81 ms
18,132 KB
testcase_01 AC 14 ms
6,760 KB
testcase_02 AC 44 ms
11,908 KB
testcase_03 AC 94 ms
15,904 KB
testcase_04 AC 84 ms
18,424 KB
testcase_05 AC 242 ms
18,756 KB
testcase_06 AC 191 ms
16,148 KB
testcase_07 AC 9 ms
8,836 KB
testcase_08 AC 5 ms
5,780 KB
testcase_09 AC 234 ms
20,508 KB
testcase_10 AC 245 ms
20,664 KB
testcase_11 AC 26 ms
16,720 KB
testcase_12 AC 152 ms
20,376 KB
testcase_13 AC 3 ms
4,380 KB
testcase_14 AC 2 ms
4,376 KB
testcase_15 AC 146 ms
16,788 KB
testcase_16 AC 11 ms
6,068 KB
testcase_17 AC 136 ms
17,400 KB
testcase_18 AC 102 ms
13,424 KB
testcase_19 AC 115 ms
15,268 KB
testcase_20 AC 264 ms
20,276 KB
testcase_21 AC 95 ms
14,744 KB
testcase_22 AC 44 ms
8,936 KB
testcase_23 AC 10 ms
5,808 KB
testcase_24 AC 13 ms
6,268 KB
testcase_25 AC 35 ms
8,904 KB
testcase_26 AC 190 ms
18,800 KB
testcase_27 AC 162 ms
17,448 KB
testcase_28 AC 114 ms
16,148 KB
testcase_29 AC 27 ms
7,604 KB
testcase_30 AC 148 ms
17,248 KB
testcase_31 AC 125 ms
15,824 KB
testcase_32 AC 56 ms
11,080 KB
testcase_33 AC 161 ms
18,264 KB
testcase_34 AC 11 ms
6,260 KB
testcase_35 AC 29 ms
7,752 KB
testcase_36 AC 13 ms
6,256 KB
testcase_37 AC 72 ms
11,320 KB
testcase_38 AC 12 ms
9,996 KB
testcase_39 AC 72 ms
11,288 KB
testcase_40 AC 18 ms
6,964 KB
testcase_41 AC 10 ms
8,512 KB
testcase_42 AC 167 ms
16,888 KB
testcase_43 AC 37 ms
13,084 KB
testcase_44 AC 112 ms
12,000 KB
testcase_45 AC 13 ms
6,184 KB
testcase_46 AC 36 ms
12,868 KB
testcase_47 AC 109 ms
12,128 KB
testcase_48 AC 126 ms
13,472 KB
testcase_49 AC 30 ms
7,868 KB
testcase_50 AC 4 ms
4,868 KB
testcase_51 AC 32 ms
9,096 KB
testcase_52 AC 72 ms
13,072 KB
testcase_53 AC 21 ms
6,940 KB
testcase_54 AC 17 ms
6,628 KB
testcase_55 AC 71 ms
16,988 KB
testcase_56 AC 89 ms
22,972 KB
testcase_57 AC 91 ms
23,476 KB
testcase_58 AC 47 ms
14,152 KB
testcase_59 AC 106 ms
25,280 KB
testcase_60 AC 3 ms
4,400 KB
testcase_61 AC 2 ms
4,380 KB
testcase_62 AC 2 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

def solve(io)
  n, m = io.get2
  g = Graph.new(n)
  m.times do
    pi, qi = io.get2; pi -= 1; qi -= 1
    g.add_edge_b(pi, qi)
  end

  q = io.get
  q.times do
    ai = io.get; ai -= 1
    d = Array.new(n, 0)
    s, m = 0, 0
    g.bfs(ai) do |u, p|
      d[u] = d[p] + 1 if p != -1
      s += 1
      max_u(m, d[u])
    end

    x = 0
    while m > 1
      m = m.cdiv(2)
      x += 1
    end
    io.put s-1, x
  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 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 = [] of String
    @index = 0
  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

  def put(*vs)
    vs.each.with_index do |v, i|
      put_v(v)
      @outs.print i < vs.size - 1 ? " " : "\n"
    end
  end

  def put_e(*vs)
    put(*vs)
    exit
  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 : String.class); get_token; end

  private def get_token
    if @buf.size == @index
      str = @ins.read_line
      @buf = str.split
      @index = 0
    end
    v = @buf[@index]
    @index += 1
    v
  end

  private def put_v(vs : Enumerable)
    vs.each_with_index do |v, i|
      @outs.print v
      @outs.print " " if i < vs.size - 1
    end
  end

  private def put_v(v)
    @outs.print v
  end
end

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

macro max_u(a, b)
  {{a}} = Math.max({{a}}, {{b}})
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

solve(ProconIO.new)
0