結果

問題 No.813 ユキちゃんの冒険
ユーザー yuruhiyayuruhiya
提出日時 2021-07-22 17:40:20
言語 Crystal
(1.14.0)
結果
WA  
実行時間 -
コード長 4,791 bytes
コンパイル時間 16,545 ms
コンパイル使用メモリ 296,088 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-17 14:59:57
合計ジャッジ時間 17,685 ms
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 25 WA * 1
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

# require "/scanner"
# ### Specifications
#
# ```plain
# Inside input macro | Expanded code
# ----------------------------------------------+---------------------------------------
# Uppercase string: Int32, Int64, Float64, etc. | {}.new(Scanner.s)
# s | Scanner.s
# c | Scanner.c
# Other lowercase string: i, i64, f, etc. | Scanner.s.to_{}
# operator[]: type[size] | Array.new(input(size)) { input(type) }
# Tuple literal: {t1, t2, t3} | {input(t1), input(t2), input(t3)}
# Array literal: [t1, t2, t3] | [input(t1), input(t2), input(t3)]
# Range literal: t1..t2 | input(t1)..input(t2)
# If: cond ? t1 : t2 | cond ? input(t1) : input(t2)
# Assign: target = value | target = input(value)
# ```
#
# ### Examples
#
# Input:
# ```plain
# 5 3
# foo bar
# 1 2 3 4 5
# ```
# ```
# n, m = input(Int32, Int64) # => {5, 10i64}
# input(String, Char[m]) # => {"foo", ['b', 'a', 'r']}
# input(Int32[n]) # => [1, 2, 3, 4, 5]
# ```
# ```
# n, m = input(i, i64) # => {5, 10i64}
# input(s, c[m]) # => {"foo", ['b', 'a', 'r']}
# input(i[n]) # => [1, 2, 3, 4, 5]
# ```
#
# Input:
# ```plain
# 2 3
# 1 2 3
# 4 5 6
# ```
#
# ```
# h, w = input(i, i) # => {2, 3}
# input(i[h, w]) # => [[1, 2, 3], [4, 5, 6]]
# ```
# ```
# input(i[i][i]) # => [[1, 2, 3], [4, 5, 6]]
# ```
#
# Input:
# ```plain
# 5 3
# 3 1 4 2 5
# 1 2
# 2 3
# 3 1
# ```
# ```
# n, m = input(i, i) # => {5, 3}
# input(i.pred[n]) # => [2, 0, 3, 1, 4]
# input({i - 1, i - 1}[m]) # => [{0, 1}, {1, 2}, {2, 0}]
# ```
#
# Input:
# ```plain
# 3
# 1 2
# 2 2
# 3 2
# ```
# ```
# input({tmp = i, tmp == 1 ? i : i.pred}[i]) # => [{1, 2}, {2, 1}, {3, 1}]
# ```
class Scanner
private def self.skip_to_not_space
peek = STDIN.peek
not_space = peek.index { |x| x != 32 && x != 10 } || peek.size
STDIN.skip(not_space)
end
def self.c
skip_to_not_space
STDIN.read_char.not_nil!
end
def self.s
skip_to_not_space
peek = STDIN.peek
if index = peek.index { |x| x == 32 || x == 10 }
STDIN.skip(index + 1)
return String.new(peek[0, index])
end
String.build do |buffer|
loop do
buffer.write peek
STDIN.skip(peek.size)
peek = STDIN.peek
break if peek.empty?
if index = peek.index { |x| x == 32 || x == 10 }
buffer.write peek[0, index]
STDIN.skip(index)
break
end
end
end
end
end
macro internal_input(s, else_ast)
{% if Scanner.class.has_method?(s.id) %}
Scanner.{{s.id}}
{% elsif s.stringify == "String" %}
Scanner.s
{% elsif s.stringify == "Char" %}
Scanner.c
{% elsif s.stringify =~ /[A-Z][a-z0-9_]*/ %}
{{s.id}}.new(Scanner.s)
{% elsif String.has_method?("to_#{s}".id) %}
Scanner.s.to_{{s.id}}
{% else %}
{{else_ast}}
{% end %}
end
macro internal_input_array(s, args)
{% for i in 0...args.size %}
%size{i} = input({{args[i]}})
{% end %}
{% begin %}
{% for i in 0...args.size %} Array.new(%size{i}) { {% end %}
input({{s.id}})
{% for i in 0...args.size %} } {% end %}
{% end %}
end
macro input(s)
{% if s.is_a?(Call) %}
{% if s.receiver.is_a?(Nop) %}
internal_input(
{{s.name}}, {{s.name}}(
{% for argument in s.args %} input({{argument}}), {% end %}
)
)
{% elsif s.name.stringify == "[]" %}
internal_input_array({{s.receiver}}, {{s.args}})
{% else %}
input({{s.receiver}}).{{s.name.id}}(
{% for argument in s.args %} input({{argument}}), {% end %}
) {{s.block}}
{% end %}
{% elsif s.is_a?(TupleLiteral) %}
{ {% for i in 0...s.size %} input({{s[i]}}), {% end %} }
{% elsif s.is_a?(ArrayLiteral) %}
[ {% for i in 0...s.size %} input({{s[i]}}), {% end %} ]
{% elsif s.is_a?(RangeLiteral) %}
Range.new(input({{s.begin}}), input({{s.end}}), {{s.excludes_end?}})
{% elsif s.is_a?(If) %}
{{s.cond}} ? input({{s.then}}) : input({{s.else}})
{% elsif s.is_a?(Assign) %}
{{s.target}} = input({{s.value}})
{% else %}
internal_input({{s.id}}, {{s.id}})
{% end %}
end
macro input(*s)
{ {% for s in s %} input({{s}}), {% end %} }
end
n, p, q = input(i, f, f)
if n == 1
puts p
exit
end
up = Array.new(n, 0.0)
down = Array.new(n, 0.0)
up[1] = 1.0
puts 10000.times.sum {
up2 = Array.new(n, 0.0)
down2 = Array.new(n, 0.0)
(1...n).each do |i|
up[i] += up[i - 1] * q if i >= 2
up[i] += down[i - 1] * p if i >= 2
down2[i - 1] += up[i] * p
down2[i - 1] += down[i] * q
end
up = up2
down = down2
down[0]
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0