結果
| 問題 | No.3682 きあいのハチマキ |
| コンテスト | |
| ユーザー |
 Nanashi.
|
| 提出日時 | 2026-09-05 16:28:11 |
| 言語 | Ruby (4.0.6) |
| 結果 |
AC
|
| 実行時間 | 179 ms / 2,000 ms |
| + 817µs | |
| コード長 | 6,059 bytes |
| 記録 | |
| コンパイル時間 | 397 ms |
| コンパイル使用メモリ | 8,704 KB |
| 実行使用メモリ | 14,720 KB |
| 最終ジャッジ日時 | 2026-09-05 16:28:14 |
| 合計ジャッジ時間 | 2,267 ms |
|
ジャッジサーバーID （参考情報） |
judge5_0 / judge3_0 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 2 |
コンパイルメッセージ
Main.rb:5: warning: 'frozen_string_literal' is ignored after any tokens Syntax OK
ソースコード
# frozen_string_literal: true
# This file is expanded by nanacl.
main = -> do # =================================================================
# frozen_string_literal: true
# require "ac-library-rb/modint" # (expanded: L98)
AcLibraryRb::ModInt.set_mod 998_244_353
in_t = gets.chomp.to_i
RES = (9 / 10.to_m) * (100 / 99.to_m)
def solve(in_h_f, in_a_f, in_h_s, in_a_s)
# p [in_h_f, in_a_f, in_h_s, in_a_s]
case ([in_h_s <= in_a_f, in_h_f <= in_a_s])
in [true, false]
num_attacks = (in_h_f - 1) / in_a_s
continue = (1 / 10.to_m)**num_attacks
(1 - continue) + continue * RES
in [false, true]
num_attacks = (in_h_s - 1) / in_a_f
(1 / 10.to_m)**num_attacks * RES
in [true, true]
RES
end
# p base
# res = 9/10 + 1/10 * 1/10 * res
# res = 9/10 + 1/100 * res
# 99/100 * res = 9/10
# res = 9/10 * 100/99
# base + ((9 / 10.to_m) - (99 / 100.to_m)) * (1 - base)
end
RES2 = 1 / 2.to_m
# ((1 / 2.to_m * 9 / 10.to_m) + (1 / 2.to_m * 1 / 10.to_m * 9 / 10.to_m)) /
# (
# 1 - 1 / 2.to_m * 1 / 10.to_m * 1 / 10.to_m +
# 1 / 2.to_m * 1 / 10.to_m * 1 / 10.to_m
# )
def solve_even(in_h_1, in_a_1, in_h_2, in_a_2)
case ([in_h_2 <= in_a_1, in_h_1 <= in_a_2])
in [true, false]
num_attacks = (in_h_1 - 1) / in_a_2
continue = (1 / 10.to_m)**num_attacks
(1 - continue) + continue * RES2
in [false, true]
num_attacks = (in_h_2 - 1) / in_a_1
(1 / 10.to_m)**num_attacks * RES2
in [true, true]
RES2
end
# p base
# res = 1/2 * (9/10 + 1/10 * 1/10 * res) + 1/2 * (1/10 * (9/10 + 1/10 * res))
# res = (1/2 * 9/10) + (1/2 * 1/10 * 1/10) * res + (1/2 * 1/10 * 9/10) + (1/2 * 1/10 * 1/10) * res
# res = (1/2 * 9/10) + (1/2 * 1/10 * 9/10) + (1/2 * 1/10 * 1/10 + 1/2 * 1/10 * 1/10) * res
# (1 - 1/2 * 1/10 * 1/10 + 1/2 * 1/10 * 1/10) * res = (1/2 * 9/10) + (1/2 * 1/10 * 9/10)
# res = ((1/2 * 9/10) + (1/2 * 1/10 * 9/10)) / (1 - 1/2 * 1/10 * 1/10 + 1/2 * 1/10 * 1/10)
end
in_t.times do
in_h1, in_a1, in_s1, in_h2, in_a2, in_s2 = gets.chomp.split.map(&:to_i)
normals = [(in_h2 - 1) / in_a1, (in_h1 - 1) / in_a2].min
in_h2 -= in_a1 * normals
in_h1 -= in_a2 * normals
#p [in_h1, in_a1, in_s1, in_h2, in_a2, in_s2]
if in_s1 < in_s2
puts 1 - solve(in_h2, in_a2, in_h1, in_a1)
elsif in_s1 == in_s2
puts solve_even(in_h1, in_a1, in_h2, in_a2)
else
puts solve(in_h1, in_a1, in_h2, in_a2)
end
end
end # --------------------------------------------------------------------------
# === dependencies -------------------------------------------------------------
# == relative: ./core_ext/modint.rb from ac-library-rb/modint ------------------
def ModInt(val)
AcLibraryRb::ModInt.new(val)
end
# Integer
class Integer
def to_modint
AcLibraryRb::ModInt.new(self)
end
alias to_m to_modint
end
# String
class String
def to_modint
AcLibraryRb::ModInt.new(to_i)
end
alias to_m to_modint
end
# == ac-library-rb/modint from main --------------------------------------------
module AcLibraryRb
# require_relative './core_ext/modint.rb' # (expanded: L77)
# ModInt
class ModInt < Numeric
class << self
def set_mod(mod)
raise ArgumentError unless mod.is_a?(Integer) && (1 <= mod)
$_mod = mod
$_mod_is_prime = ModInt.prime?(mod)
end
def mod=(mod)
set_mod mod
end
def mod
$_mod
end
def raw(val)
x = allocate
x.val = val.to_i
x
end
def prime?(n)
return false if n <= 1
return true if (n == 2) || (n == 7) || (n == 61)
return false if (n & 1) == 0
d = n - 1
d >>= 1 while (d & 1) == 0
[2, 7, 61].each do |a|
t = d
y = a.pow(t, n)
while (t != n - 1) && (y != 1) && (y != n - 1)
y = y * y % n
t <<= 1
end
return false if (y != n - 1) && ((t & 1) == 0)
end
true
end
def inv_gcd(a, b)
a %= b
return [b, 0] if a == 0
s, t = b, a
m0, m1 = 0, 1
while t != 0
u = s / t
s -= t * u
m0 -= m1 * u
s, t = t, s
m0, m1 = m1, m0
end
m0 += b / s if m0 < 0
[s, m0]
end
end
attr_accessor :val
alias to_i val
def initialize(val = 0)
@val = val.to_i % $_mod
end
def inc!
@val += 1
@val = 0 if @val == $_mod
self
end
def dec!
@val = $_mod if @val == 0
@val -= 1
self
end
def add!(other)
@val = (@val + other.to_i) % $_mod
self
end
def sub!(other)
@val = (@val - other.to_i) % $_mod
self
end
def mul!(other)
@val = @val * other.to_i % $_mod
self
end
def div!(other)
mul! inv_internal(other.to_i)
end
def +@
self
end
def -@
ModInt.raw($_mod - @val)
end
def **(other)
$_mod == 1 ? 0 : ModInt.raw(@val.pow(other, $_mod))
end
alias pow **
def inv
ModInt.raw(inv_internal(@val) % $_mod)
end
def coerce(other)
[ModInt(other), self]
end
def +(other)
dup.add! other
end
def -(other)
dup.sub! other
end
def *(other)
dup.mul! other
end
def /(other)
dup.div! other
end
def ==(other)
@val == other.to_i
end
def pred
dup.add!(-1)
end
def succ
dup.add! 1
end
def zero?
@val == 0
end
def dup
ModInt.raw(@val)
end
def to_int
@val
end
def to_s
@val.to_s
end
def inspect
"#{@val} mod #{$_mod}"
end
private
def inv_internal(a)
if $_mod_is_prime
raise(RangeError, 'no inverse') if a == 0
a.pow($_mod - 2, $_mod)
else
g, x = ModInt.inv_gcd(a, $_mod)
g == 1 ? x : raise(RangeError, 'no inverse')
end
end
end
end
# ==============================================================================
main.call