結果

問題 No.771 しおり
ユーザー te-sh
提出日時 2021-07-15 15:02:27
言語 Crystal
(1.14.0)
結果
AC  
実行時間 751 ms / 2,000 ms
コード長 5,652 bytes
コンパイル時間 14,648 ms
コンパイル使用メモリ 300,372 KB
実行使用メモリ 22,808 KB
最終ジャッジ日時 2024-07-22 07:29:38
合計ジャッジ時間 23,409 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 43
権限があれば一括ダウンロードができます

ソースコード

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)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0