結果

問題 No.1702 count good string
ユーザー te-shte-sh
提出日時 2022-02-03 09:49:37
言語 Crystal
(1.11.2)
結果
AC  
実行時間 125 ms / 2,000 ms
コード長 7,987 bytes
コンパイル時間 19,053 ms
コンパイル使用メモリ 259,680 KB
実行使用メモリ 87,600 KB
最終ジャッジ日時 2023-09-02 03:06:31
合計ジャッジ時間 25,051 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,464 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,384 KB
testcase_03 AC 2 ms
4,588 KB
testcase_04 AC 3 ms
4,476 KB
testcase_05 AC 2 ms
4,460 KB
testcase_06 AC 2 ms
4,492 KB
testcase_07 AC 2 ms
4,552 KB
testcase_08 AC 2 ms
4,556 KB
testcase_09 AC 2 ms
4,460 KB
testcase_10 AC 2 ms
4,632 KB
testcase_11 AC 2 ms
4,416 KB
testcase_12 AC 2 ms
4,528 KB
testcase_13 AC 120 ms
87,032 KB
testcase_14 AC 118 ms
87,100 KB
testcase_15 AC 120 ms
86,952 KB
testcase_16 AC 115 ms
87,600 KB
testcase_17 AC 117 ms
87,020 KB
testcase_18 AC 121 ms
87,004 KB
testcase_19 AC 121 ms
87,052 KB
testcase_20 AC 120 ms
87,040 KB
testcase_21 AC 116 ms
87,092 KB
testcase_22 AC 118 ms
87,092 KB
testcase_23 AC 3 ms
5,268 KB
testcase_24 AC 3 ms
5,224 KB
testcase_25 AC 4 ms
5,272 KB
testcase_26 AC 4 ms
5,252 KB
testcase_27 AC 3 ms
5,328 KB
testcase_28 AC 4 ms
5,276 KB
testcase_29 AC 3 ms
5,212 KB
testcase_30 AC 3 ms
5,228 KB
testcase_31 AC 3 ms
5,240 KB
testcase_32 AC 3 ms
5,204 KB
testcase_33 AC 120 ms
86,960 KB
testcase_34 AC 122 ms
86,920 KB
testcase_35 AC 120 ms
86,940 KB
testcase_36 AC 121 ms
86,920 KB
testcase_37 AC 121 ms
87,032 KB
testcase_38 AC 124 ms
87,056 KB
testcase_39 AC 119 ms
86,968 KB
testcase_40 AC 123 ms
86,944 KB
testcase_41 AC 125 ms
86,956 KB
testcase_42 AC 122 ms
87,008 KB
testcase_43 AC 124 ms
87,100 KB
testcase_44 AC 120 ms
86,952 KB
testcase_45 AC 2 ms
4,432 KB
testcase_46 AC 2 ms
4,396 KB
testcase_47 AC 2 ms
4,384 KB
testcase_48 AC 3 ms
4,388 KB
testcase_49 AC 2 ms
4,440 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

def solve(io)
  n = io.get
  s = io.get(String)

  u = "yukicoder"
  m = u.size

  dp = Array.new_md(n+1, m+1, 2, Mint.new(0))
  dp[0][0][0] = Mint.new(1)

  (1..n).each do |i|
    (0..m).each do |j|
      dp[i][j][0] = dp[i-1][j][0]
      dp[i][j][1] = dp[i-1][j][1]

      if j > 0
        if s[i-1] == '?'
          dp[i][j][1] += dp[i-1][j-1][0]
        elsif s[i-1] == u[j-1]
          dp[i][j][0] += dp[i-1][j-1][0]
          dp[i][j][1] += dp[i-1][j-1][1]
        end
      end
    end
  end

  io.put dp[n][m].sum
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({{ *(1..i).map { |j| "k#{j}".id } }})
        { {{ *(1..i).map { |j| "get(k#{j})".id } }} }
      end
    {% end %}
  end
  define_get

  macro define_getn
    {% for i in (2..9) %}
      def get{{i}}(k : T.class = Int32) forall T
        get({{ *(1..i).map { "k".id } }})
      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_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 %}
  end
  define_get_t

  macro define_getn_t
    {% for i in (2..9) %}
      def get{{i}}_t(n : Int, k : T.class = Int32) forall T
        get_t(n, {{ *(1..i).map { "k".id } }})
      end
    {% end %}
  end
  define_getn_t

  macro 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 %}
  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, {{ *(1..i).map { "k".id } }})
      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

  def put(*v)
    @outs.puts(*v)
  end

  def put_e(*v)
    put(*v)
    exit
  end

  def put_a(*v)
    put_d(*v, delimiter: ' ')
  end

  def put_ae(*v)
    put_a(*v)
    exit
  end

  def put_c(*v)
    put_d(*v, delimiter: '\n')
  end

  def put_ce(*v)
    put_c(*v)
    exit
  end

  def 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 - 1
      end
      @outs.print delimiter if i < v.size - 1
    end
    @outs.puts
  end


  private def get_v(k : String.class); get_token; 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_token
    loop do
      token = @buf.gets(' ', chomp: true)
      break token unless token.nil?
      @buf = IO::Memory.new(@ins.read_line)
    end
  end
end
macro min_u(a, b)
  {{a}} = { {{a}}, {{b}} }.min
end

macro max_u(a, b)
  {{a}} = { {{a}}, {{b}} }.max
end

macro records(rec, a)
  {{a}}.map { |v| {{rec}}.new(*v) }
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
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.35.0") < 0 %}
    def digits(base = 10)
      raise ArgumentError.new("Invalid base #{base}") if base < 2
      raise ArgumentError.new("Can't request digits of negative number") if self < 0
      return [0] if self == 0

      num = self
      digits_count = (Math.log(self.to_f + 1) / Math.log(base)).ceil.to_i
      ary = Array(Int32).new(digits_count)
      while num != 0
        ary << num.remainder(base).to_i
        num = num.tdiv(base)
      end
      ary
    end
  {% 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
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
module 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 < 0
      return value if value < 2
      res = value.class.zero
      bit = res.succ << (res.leading_zeros_count - 2)
      bit >>= value.leading_zeros_count & ~0x3
      while (bit != 0)
        if value >= res + bit
          value -= res + bit
          res = (res >> 1) + bit
        else
          res >>= 1
        end
        bit >>= 2
      end
      res
    end
  {% end %}
end

module Binary(T)
  extend self

  def 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) }
    }
  end

  def get(op : Symbol)
    procs[op]
  end
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, op : Symbol, i : T = T.multiplicative_identity) forall T
  powr(a, n, i, &Binary(T).get(op))
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

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

  def self.array(v : Array(Int))
    v.map { |vi| new(vi) }
  end

  def self.array(v : Array(Array(Int)))
    v.map { |vi| vi.map { |vij| new(vij) } }
  end


  private def m(v : Int)
    self.class.new(v)
  end
end
ModInt.new_type(Mint, 10**9+7)

solve(ProconIO.new)
0