結果

問題 No.788 トラックの移動
ユーザー te-shte-sh
提出日時 2021-07-21 16:46:07
言語 Crystal
(1.11.2)
結果
AC  
実行時間 1,012 ms / 2,000 ms
コード長 8,419 bytes
コンパイル時間 14,428 ms
コンパイル使用メモリ 307,400 KB
実行使用メモリ 48,856 KB
最終ジャッジ日時 2024-05-08 23:07:00
合計ジャッジ時間 19,748 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,012 ms
47,152 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 224 ms
14,848 KB
testcase_05 AC 958 ms
48,356 KB
testcase_06 AC 991 ms
47,232 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 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 1 ms
5,376 KB
testcase_13 AC 2 ms
5,376 KB
testcase_14 AC 2 ms
5,376 KB
testcase_15 AC 276 ms
48,856 KB
testcase_16 AC 936 ms
47,064 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
In Main.cr:144:19

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

In Main.cr:145:15

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

In Main.cr:144:19

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

In Main.cr:145:15

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

In Main.cr:144:19

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

In Main.cr:145:15

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

In Main.cr:144:19

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

In Main.cr:145:15

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

In Main.cr:144:19

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

In Main.cr:145:15

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

In Main.cr:144:19

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

In Main.cr:145:15

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

In Main.cr:144:19

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

ソースコード

diff # 

def solve(io)
  n, m, l = io.get3; l -= 1
  t = io.get_a(n)

  io.put_e 0 if t.count(&.> 0) == 1

  g = GraphW(Int64).new(n, 10_i64**18)
  m.times do
    a, b, c = io.get(Int32, Int32, Int64) a -= 1; b -= 1
    g.add_edge_b(a, b, c)
  end

  dist = Array.new(n) { |i| g.dijkstra(i).dist }

  r = g.inf
  (0...n).each do |c|
    s = zip(dist[c], t).map { |a, b| a * b }.sum * 2
    (0...n).each do |f|
      min_u(r, s + dist[l][f] - dist[f][c]) if t[f] > 0
    end
  end

  io.put r
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({{ *(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

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 Heap(T)
  def initialize
    initialize { |a, b| a <=> b }
  end

  def initialize(&@cmp : (T, T) -> Int32)
    dummy = uninitialized T
    @b = [dummy]
  end

  def initialize(a : Array(T))
    initialize(a) { |a, b| a <=> b }
  end

  def initialize(a : Array(T), &@cmp : (T, T) -> Int32)
    dummy = uninitialized T
    @b = [dummy]
    a.each do |e|
      push(e)
    end
  end

  def empty?
    @b.size == 1
  end

  def size
    @b.size - 1
  end

  def first
    @b[1]
  end

  def first=(v : T)
    @b[1], i = v, 1
    while @b.size > i << 1
      l, r = i << 1, i << 1 | 1
	  j = @b.size <= r || @cmp.call(@b[l], @b[r]) < 0 ? l : r
      break if @cmp.call(@b[i], @b[j]) < 0
      @b[j], @b[i] = @b[i], @b[j]
      i = j
    end
  end

  def push(v : T)
    @b.push(v)
    i = @b.size - 1
    while i > 1
      j = i >> 1
      break if @cmp.call(@b[j], @b[i]) < 0
      @b[j], @b[i] = @b[i], @b[j]
      i = j
    end
    self
  end

  def pop
    v, w = @b[1], @b.pop
    self.first = w unless empty?
    v
  end


  @b : Array(T)
end

class Dijkstra(T)
  alias Node = GraphW::Node
  alias Edge = GraphW::Edge

  def initialize(@g : GraphW(T), s : Node)
    size = @g.size
    @dist = Array.new(size, @g.inf)
    @dist[s] = T.additive_identity
    @prev = Array.new(size, -1)

    se = Edge.new(-1, s, T.new(0))
    h = Heap.new([se]) { |a, b| a.wt <=> b.wt }
    until h.empty?
      e = h.pop

      next if @prev[e.dst] != -1
      @prev[e.dst] = e.src

      @g[e.dst].each do |f|
        w = e.wt + f.wt
        if w < @dist[f.dst]
          @dist[f.dst] = w
          h.push(Edge.new(f.src, f.dst, w))
        end
      end
    end
  end

  getter dist : Array(T)


  @prev : Array(Node)
end

class GraphW(T)
  def dijkstra(s)
    Dijkstra.new(self, s)
  end
end

solve(ProconIO.new)
0