結果

問題 No.767 配られたジャパリまん
ユーザー te-shte-sh
提出日時 2021-07-15 12:42:32
言語 Crystal
(1.11.2)
結果
TLE  
実行時間 -
コード長 8,911 bytes
コンパイル時間 17,415 ms
コンパイル使用メモリ 305,996 KB
実行使用メモリ 31,156 KB
最終ジャッジ日時 2024-07-04 13:00:07
合計ジャッジ時間 21,995 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 1 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 5 ms
6,940 KB
testcase_05 AC 185 ms
6,940 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 2 ms
6,944 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 6 ms
6,940 KB
testcase_10 AC 94 ms
6,940 KB
testcase_11 AC 12 ms
6,940 KB
testcase_12 AC 9 ms
6,940 KB
testcase_13 AC 96 ms
6,940 KB
testcase_14 AC 9 ms
6,940 KB
testcase_15 AC 8 ms
6,944 KB
testcase_16 AC 11 ms
6,940 KB
testcase_17 AC 3 ms
6,940 KB
testcase_18 AC 4 ms
6,944 KB
testcase_19 AC 18 ms
6,944 KB
testcase_20 TLE -
権限があれば一括ダウンロードができます

ソースコード

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

def solve(io)
h, w, k = io.get3
a, b = io.get2_c(k)
f = Array.new(k) { |i| Friend.new(a[i], b[i], i) }
f.sort_by! { |fi| [fi.a, fi.b] }
fc = Fact(Mint).new(h + w)
g = Array.new(1 << k) do |i|
c = Mint.new(-1) ** i.popcount
sa = sb = 0
k.times do |j|
if i.bit?(j)
ea, eb = f[j].a, f[j].b
if ea >= sa && eb >= sb
c *= fc.combi((ea - sa) + (eb - sb), ea - sa)
else
c = Mint.zero
break
end
sa, sb = ea, eb
end
end
c * fc.combi((h - sa) + (w - sb), h - sa)
end
h = bit_zeta_trans_subset(k, g) { |a, b| a + b }
r = Array.new(1 << k, Mint.zero)
(1 << k).times do |i1|
i2 = 0
k.times do |j|
i2 = i2.set_bit(f[j].i) if i1.bit?(j)
end
r[i2] = h[i1]
end
r.each do |ri|
io.put ri
end
end
record Friend, a : Int32, b : Int32, i : Int32
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}}{% if j < i %},{% end %}
{% end %}
)
{% for j in (1..i) %}
put_v(v{{j}})
{% if j < i %}@outs << " "{% end %}
{% end %}
@outs << "\n"
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 put_v(v)
@outs << v
end
private def put_v(v : Enumerable)
v.each_with_index do |e, i|
@outs << e
@outs << " " 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
def powr(a : T, n : Int, i : T = T.multiplicative_identity) forall T
powr(a, n, i) { |a, b| a * b }
end
def powr(a : T, n : Int, i : T = T.multiplicative_identity, &block) forall T
return i if n == 0
r, b = i, a
while n > 0
r = yield r, b if n.bit(0) == 1
b = yield b, b
n >>= 1
end
r
end
def ext_gcd(a : T, b : T) forall T
if a == 0
{b, T.new(0), T.new(1)}
else
g, x, y = ext_gcd(b % a, a)
{g, y - (b // a) * x, x}
end
end
def bit_subsets(a : Int, includes_zero = false)
n = i = a
if includes_zero
while i >= 0
yield i & n
i = (i & n) - 1
end
else
while i > 0
yield i
i = (i - 1) & n
end
end
end
def bit_zeta_trans_subset(n : Int, f : Array(T), &compose : (T, T) -> T) forall T
g = Array.new(1 << n) { |i| f[i] }
n.times do |i|
(1 << n).times do |j|
if j >> i & 1 != 0
g[j] = compose.call(g[j], g[j ^ (1 << i)])
end
end
end
g
end
def bit_zeta_trans_superset(n : Int, f : Array(T), &compose : (T, T) -> T) forall T
g = Array.new(1 << n) { |i| f[i] }
n.times do |i|
(1 << n).times do |j|
if j >> i & 1 == 0
g[j] = compose.call(g[j], g[j ^ (1 << i)])
end
end
end
g
end
class Fact(T)
def initialize(@n : Int32)
@table = Array.new(@n+1, T.multiplicative_identity)
(1..@n).each do |i|
@table[i] = @table[i-1] * i
end
@inv_table = Array.new(@n+1, T.multiplicative_identity)
@inv_table[@n] //= @table[@n]
(1..@n).reverse_each do |i|
@inv_table[i-1] = @inv_table[i] * i
end
end
getter table : Array(T)
getter inv_table : Array(T)
def fact(n : Int)
@table[n]
end
def perm(n : Int, r : Int)
@table[n] * @inv_table[n-r]
end
def combi(n : Int, r : Int)
@table[n] * @inv_table[r] * @inv_table[n-r]
end
def homo(n : Int, r : Int)
combi(n + r - 1, r)
end
@table : Array(T)
@inv_table : Array(T)
end
abstract struct ModInt < Number
macro new_type(name, mod)
struct {{name}} < ModInt
@@mod : Int32 = {{mod}}
end
end
def initialize(v : Int)
@v = (v % @@mod).to_i64
end
def_hash @@mod, @v
def to_s
@v.to_s
end
def to_s(io : IO) : Nil
@v.to_s(io)
end
getter v : Int64
delegate to_i, to: @v
def ==(r : self)
@v == r.v
end
def ==(r : Int)
@v == (r % @@mod)
end
def - : self
m(-@v)
end
def +(r : self)
m(@v + r.v)
end
def +(r : Int)
self + m(r)
end
def -(r : self)
m(@v - r.v)
end
def -(r : Int)
self - m(r)
end
def *(r : self)
m(@v * r.v)
end
def *(r : Int)
self * m(r)
end
def //(r : self)
self * r.inv
end
def //(r : Int)
self // m(r)
end
def **(n : Int)
powr(self, n)
end
def inv
m(ext_gcd(@v.to_i32, @@mod)[1])
end
private def m(v : Int)
self.class.new(v)
end
end
ModInt.new_type(Mint, 10**8+7)
solve(ProconIO.new)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0