結果

問題 No.1845 Long Substrings
ユーザー yudedakoyudedako
提出日時 2022-02-28 21:43:41
言語 Scala(Beta)
(3.4.0)
結果
AC  
実行時間 1,296 ms / 2,000 ms
コード長 3,893 bytes
コンパイル時間 16,098 ms
コンパイル使用メモリ 282,336 KB
実行使用メモリ 89,176 KB
最終ジャッジ日時 2024-07-07 00:58:14
合計ジャッジ時間 54,178 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,296 ms
87,720 KB
testcase_01 AC 1,274 ms
88,596 KB
testcase_02 AC 1,282 ms
86,076 KB
testcase_03 AC 1,295 ms
87,664 KB
testcase_04 AC 1,282 ms
88,612 KB
testcase_05 AC 1,277 ms
85,948 KB
testcase_06 AC 1,277 ms
84,780 KB
testcase_07 AC 1,278 ms
88,720 KB
testcase_08 AC 1,293 ms
89,176 KB
testcase_09 AC 1,282 ms
86,732 KB
testcase_10 AC 1,269 ms
88,364 KB
testcase_11 AC 1,273 ms
86,424 KB
testcase_12 AC 1,267 ms
85,724 KB
testcase_13 AC 1,284 ms
87,928 KB
testcase_14 AC 1,285 ms
87,740 KB
testcase_15 AC 911 ms
63,832 KB
testcase_16 AC 907 ms
63,704 KB
testcase_17 AC 914 ms
63,512 KB
testcase_18 AC 916 ms
63,720 KB
testcase_19 AC 910 ms
64,080 KB
testcase_20 AC 880 ms
63,548 KB
testcase_21 AC 881 ms
63,164 KB
testcase_22 AC 863 ms
63,208 KB
testcase_23 AC 863 ms
63,544 KB
testcase_24 AC 858 ms
63,224 KB
testcase_25 AC 874 ms
63,168 KB
testcase_26 AC 880 ms
63,416 KB
testcase_27 AC 939 ms
63,540 KB
testcase_28 AC 857 ms
63,472 KB
testcase_29 AC 880 ms
63,412 KB
testcase_30 AC 853 ms
63,636 KB
testcase_31 AC 880 ms
63,544 KB
testcase_32 AC 897 ms
63,412 KB
testcase_33 AC 875 ms
63,516 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import scala.collection.mutable.*
import scala.io.StdIn.*
import scala.util.chaining.*
import scala.math.*
import scala.reflect.ClassTag
import scala.util.*
import scala.annotation.tailrec
import scala.collection.mutable



object ModInt:
  opaque type ModInt = Long
  inline def zero: ModInt = 0
  inline def one: ModInt = 1
  extension (value: Long)
    inline def toModInt(using inline mod: Int): ModInt =  value % mod
    inline def unsafeAsModInt: ModInt = value
  extension (value: Int)
    inline def toModInt(using inline mod: Int): ModInt = value % mod
    inline def unsafeAsModInt: ModInt = value
  trait Converter[T]:
    inline def convert(value: T)(using inline mod: Int): ModInt
  inline given Converter[Int] with
    override inline def convert(value: Int)(using inline mod: Int) = value.toModInt
  inline given Converter[Long] with
    override inline def convert(value: Long)(using inline mod: Int) = value.toModInt
  inline given Converter[ModInt] with
    override inline def convert(value: ModInt)(using inline mod: Int) = value
  extension (modInt: ModInt)
    inline def toLong(using inline mod: Int): Long = (modInt + mod) % mod
    inline def rawValue: Long = modInt
    inline def inverse(using inline mod: Int): ModInt =
      var x = modInt
      var y = mod.toLong
      var a = 1L
      var b = 0L
      var c = 0L
      var d = 1L
      while y != 0 do
        val q = x / y
        val e = a - c * q
        val f = b - d * q
        a = c
        b = d
        c = e
        d = f
        x = y
        y = c * modInt + d * mod
      require(x.abs == 1L)
      if x == 1 then a % mod else -a % mod
    inline def powMod(exp: Long)(using inline mod: Int): ModInt =
      var result = 1L
      var base = modInt
      var e = exp
      while e > 0 do
        if (e & 1) == 1 then
          result = result * base % mod
        base = base * base % mod
        e >>= 1
      result
    inline def powMod(exp: Int)(using inline mod: Int): ModInt = powMod(exp.toLong)
  extension [L: Converter, R: Converter] (left: L)
    inline def +(right: R)(using inline mod: Int): ModInt = (summon[Converter[L]].convert(left) + summon[Converter[R]].convert(right)).toModInt
    inline def -(right: R)(using inline mod: Int): ModInt = (summon[Converter[L]].convert(left) - summon[Converter[R]].convert(right)).toModInt
    inline def *(right: R)(using inline mod: Int): ModInt = (summon[Converter[L]].convert(left) * summon[Converter[R]].convert(right)).toModInt
    inline def /(right: R)(using inline mod: Int): ModInt = (summon[Converter[L]].convert(left) * summon[Converter[R]].convert(right).inverse).toModInt



import ModInt.*
inline given mod: Int = 1000000007

class Bit(size: Int):
  private val vec = Array.fill(size){zero}
  inline def get(position: Int)(using inline mod: Int): ModInt =
    var pos = position
    var result = zero
    while pos >= 0 do
      result += vec(pos)
      pos -= ~pos & (pos + 1)
    result
  inline def add(position: Int, value: ModInt)(using inline mod: Int) =
    var pos = position
    while pos < size do
      vec(pos) += value
      pos += ~pos & (pos + 1)
  inline def getAll(using inline mod: Int): ModInt = get(size - 1)

@main def main =
  val n = readLine.toInt
  val length = readLine.split(' ').map(_.toInt)
  val str = readLine
  val prev = Array.fill(n + 1){-1}
  val lastPosition = Array.fill(26){0}
  for (c, i) <- str.zipWithIndex do
    prev(i + 1) = lastPosition(c - 'a')
    lastPosition(c - 'a') = i + 1
  val useAll = Array.fill(n + 1){zero}.tap(_(0) = one)
  val allPattern = Bit(n + 1).tap(_.add(0, one))
  for i <- 1 to n do
    val len = length(i - 1)
    val p = prev(i)
    val unique = allPattern.get(i) - allPattern.get(p)
    val expand = useAll(p)
    val newPattern = (unique + expand) * len
    useAll(i) = unique + expand
    allPattern.add(i, newPattern)
  println((allPattern.getAll - 1).toLong)
0