結果
問題 | No.767 配られたジャパリまん |
ユーザー | te-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 | - |
ソースコード
def solve(io)h, w, k = io.get3a, 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.popcountsa = sb = 0k.times do |j|if i.bit?(j)ea, eb = f[j].a, f[j].bif ea >= sa && eb >= sbc *= fc.combi((ea - sa) + (eb - sb), ea - sa)elsec = Mint.zerobreakendsa, sb = ea, ebendendc * fc.combi((h - sa) + (w - sb), h - sa)endh = bit_zeta_trans_subset(k, g) { |a, b| a + b }r = Array.new(1 << k, Mint.zero)(1 << k).times do |i1|i2 = 0k.times do |j|i2 = i2.set_bit(f[j].i) if i1.bit?(j)endr[i2] = h[i1]endr.each do |ri|io.put riendendrecord Friend, a : Int32, b : Int32, i : Int32struct Intdef cdiv(b : Int)(self + b - 1) // benddef bit?(i : Int)bit(i) == 1enddef set_bit(i : Int)self | (self.class.new(1) << i)enddef 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 : Int32x = self < 0 ? ~self : selfif x.is_a?(Int::Primitive)Int32.new(sizeof(self) * 8 - x.leading_zeros_count)elseto_s(2).sizeendend{% end %}endstruct Int32SQRT_MAX = 46_340_i32def isqrtm = SQRT_MAXr = (1_i32..SQRT_MAX).bsearch { |i| i**2 > self }r.nil? ? SQRT_MAX : r - 1endendstruct Int64SQRT_MAX = 3_037_000_499_i64def isqrtr = (1_i64..SQRT_MAX).bsearch { |i| i**2 > self }r.nil? ? SQRT_MAX : r - 1endendstruct Float64def near_zero?self.abs < EPSILONendendstruct Number{% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "1.1.0") < 0 %}def zero?self == 0enddef positive?self > 0enddef negative?self < 0end{% end %}{% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "0.36.0") < 0 %}def self.additive_identityzeroenddef self.multiplicative_identitynew(1)end{% end %}endclass Arraymacro 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 %}endendclass ProconIOdef initialize(@ins : IO = STDIN, @outs : IO = STDOUT)@buf = IO::Memory.new("")enddef get(k : T.class = Int32) forall Tget_v(k)endmacro 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 %}enddefine_getmacro define_getn{% for i in (2..9) %}def get{{i}}(k : T.class = Int32) forall Tget({% for j in (1..i) %}k{% if j < i %}, {% end %}{% end %})end{% end %}enddefine_getndef get_a(n : Int, k : T.class = Int32) forall TArray.new(n) { get_v(k) }enddef get_c(n : Int, k : T.class = Int32) forall Tget_a(n, k)endmacro 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) doget({% 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 %}enddefine_get_cmacro define_getn_c{% for i in (2..9) %}def get{{i}}_c(n : Int, k : T.class = Int32) forall Tget_c(n,{% for j in (1..i) %}k{% if j < i %},{% end %}{% end %})end{% end %}enddefine_getn_cdef get_m(r : Int, c : Int, k : T.class = Int32) forall TArray.new(r) { get_a(c, k) }endmacro 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 %}enddefine_putdef put_e(*vs)put(*vs)exitenddef put_f(*vs)put(*vs)@outs.flushendprivate def get_v(k : Int32.class); get_token.to_i32; endprivate def get_v(k : Int64.class); get_token.to_i64; endprivate def get_v(k : UInt32.class); get_token.to_u32; endprivate def get_v(k : UInt64.class); get_token.to_u64; endprivate def get_v(k : Float64.class); get_token.to_f64; endprivate def get_v(k : String.class); get_token; endprivate def get_tokenloop dotoken = @buf.gets(' ', chomp: true)break token unless token.nil?@buf = IO::Memory.new(@ins.read_line)endendprivate def put_v(v)@outs << vendprivate def put_v(v : Enumerable)v.each_with_index do |e, i|@outs << e@outs << " " if i < v.size - 1endendendmacro min_u(a, b){{a}} = Math.min({{a}}, {{b}})endmacro max_u(a, b){{a}} = Math.max({{a}}, {{b}})endmacro zip(a, *b, &block){{a}}.zip({{*b}}) {{block}}enddef powr(a : T, n : Int, i : T = T.multiplicative_identity) forall Tpowr(a, n, i) { |a, b| a * b }enddef powr(a : T, n : Int, i : T = T.multiplicative_identity, &block) forall Treturn i if n == 0r, b = i, awhile n > 0r = yield r, b if n.bit(0) == 1b = yield b, bn >>= 1endrenddef ext_gcd(a : T, b : T) forall Tif a == 0{b, T.new(0), T.new(1)}elseg, x, y = ext_gcd(b % a, a){g, y - (b // a) * x, x}endenddef bit_subsets(a : Int, includes_zero = false)n = i = aif includes_zerowhile i >= 0yield i & ni = (i & n) - 1endelsewhile i > 0yield ii = (i - 1) & nendendenddef bit_zeta_trans_subset(n : Int, f : Array(T), &compose : (T, T) -> T) forall Tg = Array.new(1 << n) { |i| f[i] }n.times do |i|(1 << n).times do |j|if j >> i & 1 != 0g[j] = compose.call(g[j], g[j ^ (1 << i)])endendendgenddef bit_zeta_trans_superset(n : Int, f : Array(T), &compose : (T, T) -> T) forall Tg = Array.new(1 << n) { |i| f[i] }n.times do |i|(1 << n).times do |j|if j >> i & 1 == 0g[j] = compose.call(g[j], g[j ^ (1 << i)])endendendgendclass Fact(T)def initialize(@n : Int32)@table = Array.new(@n+1, T.multiplicative_identity)(1..@n).each do |i|@table[i] = @table[i-1] * iend@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] * iendendgetter table : Array(T)getter inv_table : Array(T)def fact(n : Int)@table[n]enddef perm(n : Int, r : Int)@table[n] * @inv_table[n-r]enddef combi(n : Int, r : Int)@table[n] * @inv_table[r] * @inv_table[n-r]enddef homo(n : Int, r : Int)combi(n + r - 1, r)end@table : Array(T)@inv_table : Array(T)endabstract struct ModInt < Numbermacro new_type(name, mod)struct {{name}} < ModInt@@mod : Int32 = {{mod}}endenddef initialize(v : Int)@v = (v % @@mod).to_i64enddef_hash @@mod, @vdef to_s@v.to_senddef to_s(io : IO) : Nil@v.to_s(io)endgetter v : Int64delegate to_i, to: @vdef ==(r : self)@v == r.venddef ==(r : Int)@v == (r % @@mod)enddef - : selfm(-@v)enddef +(r : self)m(@v + r.v)enddef +(r : Int)self + m(r)enddef -(r : self)m(@v - r.v)enddef -(r : Int)self - m(r)enddef *(r : self)m(@v * r.v)enddef *(r : Int)self * m(r)enddef //(r : self)self * r.invenddef //(r : Int)self // m(r)enddef **(n : Int)powr(self, n)enddef invm(ext_gcd(@v.to_i32, @@mod)[1])endprivate def m(v : Int)self.class.new(v)endendModInt.new_type(Mint, 10**8+7)solve(ProconIO.new)