結果
問題 | No.1704 Many Bus Stops (easy) |
ユーザー |
|
提出日時 | 2022-02-03 17:21:52 |
言語 | Crystal (1.14.0) |
結果 |
AC
|
実行時間 | 1,467 ms / 2,000 ms |
コード長 | 10,019 bytes |
コンパイル時間 | 17,142 ms |
コンパイル使用メモリ | 304,900 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-11 09:58:51 |
合計ジャッジ時間 | 53,608 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 41 |
コンパイルメッセージ
In Main.cr:35:19 35 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:36:15 36 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:35:19 35 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:36:15 36 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:35:19 35 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:36:15 36 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:35:19 35 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:36:15 36 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:35:19 35 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:36:15 36 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:35:19 35 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:36:15 36 | { {{ *(1..i).map { |j| "get(k#{j})".id } }} } ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:35:19 35 | def get({{ *(1..i).map { |j| "k#{j}".id } }}) ^ Warning: Deprecated use of splat operator. Use `#splat` instead In Main.cr:36:15 36
ソースコード
def solve(io)m0, m1, m3 = Mint.new(0), Mint.new(1), Mint.new(1)//Mint.new(3)m = Matrix.new([[m3, m0, m0, m1, m0, m0],[m0, m3, m0, m0, m1, m0],[m0, m0, m3, m0, m0, m1],[m0, m3, m3, m0, m0, m0],[m3, m0, m3, m0, m0, m0],[m3, m3, m0, m0, m0, m0]])t = io.gett.times don = io.geta = m ** nio.put a[0][0]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({{ *(1..i).map { |j| "k#{j}".id } }}){ {{ *(1..i).map { |j| "get(k#{j})".id } }} }end{% end %}enddefine_getmacro define_getn{% for i in (2..9) %}def get{{i}}(k : T.class = Int32) forall Tget({{ *(1..i).map { "k".id } }})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_t{% for i in (2..9) %}def get_t(n : Int, {{ *(1..i).map { |j| "k#{j}".id } }})Array.new(n) { get({{ *(1..i).map { |j| "k#{j}".id } }}) }end{% end %}enddefine_get_tmacro define_getn_t{% for i in (2..9) %}def get{{i}}_t(n : Int, k : T.class = Int32) forall Tget_t(n, {{ *(1..i).map { "k".id } }})end{% end %}enddefine_getn_tmacro define_get_c{% for i in (2..9) %}def get_c(n : Int, {{ *(1..i).map { |j| "k#{j}".id } }})a = get_t(n, {{ *(1..i).map { |j| "k#{j}".id } }}){ {{ *(1..i).map { |j| "a.map { |e| e[#{j-1}] }".id } }} }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, {{ *(1..i).map { "k".id } }})end{% end %}enddefine_getn_cdef get_m(r : Int, c : Int, k : T.class = Int32) forall TArray.new(r) { get_a(c, k) }enddef put(*v)@outs.puts(*v)enddef put_e(*v)put(*v)exitenddef put_a(*v)put_d(*v, delimiter: ' ')enddef put_ae(*v)put_a(*v)exitenddef put_c(*v)put_d(*v, delimiter: '\n')enddef put_ce(*v)put_c(*v)exitenddef put_d(*v, delimiter)v.each_with_index do |vi, i|vi.each_with_index do |vij, j|@outs.print vij@outs.print delimiter if j < vi.size - 1end@outs.print delimiter if i < v.size - 1end@outs.putsendprivate def get_v(k : String.class); get_token; endprivate def get_v(k : Int32.class); get_token.to_i32; endprivate def get_v(k : Int64.class); get_token.to_i64; endprivate def get_tokenloop dotoken = @buf.gets(' ', chomp: true)break token unless token.nil?@buf = IO::Memory.new(@ins.read_line)endendendmacro min_u(a, b){{a}} = { {{a}}, {{b}} }.minendmacro max_u(a, b){{a}} = { {{a}}, {{b}} }.maxendmacro records(rec, a){{a}}.map { |v| {{rec}}.new(*v) }endstruct 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 %}endstruct 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.35.0") < 0 %}def digits(base = 10)raise ArgumentError.new("Invalid base #{base}") if base < 2raise ArgumentError.new("Can't request digits of negative number") if self < 0return [0] if self == 0num = selfdigits_count = (Math.log(self.to_f + 1) / Math.log(base)).ceil.to_iary = Array(Int32).new(digits_count)while num != 0ary << num.remainder(base).to_inum = num.tdiv(base)endaryend{% 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 %}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 %}endendmodule Math{% if compare_versions(env("CRYSTAL_VERSION") || "0.0.0", "1.2.0") < 0 %}def isqrt(value : Int::Primitive)raise ArgumentError.new "Input must be non-negative integer" if value < 0return value if value < 2res = value.class.zerobit = res.succ << (res.leading_zeros_count - 2)bit >>= value.leading_zeros_count & ~0x3while (bit != 0)if value >= res + bitvalue -= res + bitres = (res >> 1) + bitelseres >>= 1endbit >>= 2endresend{% end %}endmodule Binary(T)extend selfdef procs{"+": ->(a : T, b : T) { a + b },"*": ->(a : T, b : T) { a * b },min: ->(a : T, b : T) { Math.min(a, b) },max: ->(a : T, b : T) { Math.max(a, b) }}enddef get(op : Symbol)procs[op]endenddef 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, op : Symbol, i : T = T.multiplicative_identity) forall Tpowr(a, n, i, &Binary(T).get(op))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}endendclass Vector(T)include Indexable(T)def initialize(n : Int32)@b = Array.new(n, T.zero)enddef initialize(@b : Array(T))enddef ==(r : self)@b == r.to_aenddef to_a@benddelegate size, to: @bdelegate unsafe_fetch, to: @bdelegate :[]=, to: @bdef +(r : self)raise "Size mismatch" if size != r.sizeVector.new(@b.zip(r.to_a).map { |vi, ri| vi + ri })enddef -(r : self)raise "Size mismatch" if size != r.sizeVector.new(@b.zip(r.to_a).map { |vi, ri| vi - ri })enddef *(r : T)Vector.new(@b.map { |vi| vi * r })enddef *(r : self)raise "Size mismatch" if size != r.size@b.zip(r.to_a).map { |vi, ri| vi * ri }.sumendendclass Matrix(T)include Indexable(T)def initialize(@rows : Int32, @cols : Int32)@b = Array.new(@rows) { Array.new(@cols, T.zero) }enddef initialize(@b : Array(Array(T)))@rows = @b.size@cols = @b[0].sizeenddef self.unit(n : Int32)new(Array.new(n) { |i| Array.new(n) { |j| i == j ? T.multiplicative_identity : T.zero } })enddef ==(r : self)@b == r.to_aenddef to_a@bendgetter rows : Int32getter cols : Int32def sizerowsenddelegate unsafe_fetch, to: @bdef +(r : self)raise "Size mismatch" if rows != r.rows || cols != r.colsMatrix.new(Array.new(rows) { |i| Array.new(cols) { |j| self[i][j] + r[i][j] } })enddef -(r : self)raise "Size mismatch" if rows != r.rows || cols != r.colsMatrix.new(Array.new(rows) { |i| Array.new(cols) { |j| self[i][j] - r[i][j] } })enddef *(r : T)Matrix.new(Array.new(rows) { |i| Array.new(cols) { |j| self[i][j] * r } })enddef *(r : Vector(T))raise "Size mismatch" if cols != r.sizeVector.new(Array.new(rows) { |i| (0...cols).map { |j| self[i][j] * r[j] }.sum })enddef *(r : self)raise "Size mismatch" if cols != r.rowsMatrix.new(Array.new(rows) { |i| Array.new(r.cols) { |j| (0...cols).map { |k| self[i][k] * r[k][j] }.sum } })enddef **(r : Int)raise "Size mismatch" if rows != colspowr(self, r, Matrix(T).unit(rows))endendabstract 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])enddef self.array(v : Array(Int))v.map { |vi| new(vi) }enddef self.array(v : Array(Array(Int)))v.map { |vi| vi.map { |vij| new(vij) } }endprivate def m(v : Int)self.class.new(v)endendModInt.new_type(Mint, 10**9+7)solve(ProconIO.new)