#651004 (Kotlin) No.1489 Repeat Cumulative Sum

• 問題: No.1489 Repeat Cumulative Sum
• ユーザー: yakamoto
• 提出日時: 2021-04-23 22:59:53
• 言語: Kotlin (2.1.0)
• 結果: AC
• 実行時間: 530 ms / 2,000 ms
• コード長: 4,853 bytes
• コンパイル時間: 19,610 ms
• コンパイル使用メモリ: 461,556 KB
• 実行使用メモリ: 71,064 KB
• 最終ジャッジ日時: 2024-07-04 08:38:12
• 合計ジャッジ時間: 35,515 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 27

コンパイルメッセージ

Main.kt:193:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun debug(a: LongArray) {
          ^
Main.kt:197:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun debug(a: IntArray) {
          ^
Main.kt:201:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun debug(a: BooleanArray) {
          ^
Main.kt:205:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun toString(a: BooleanArray) = run{a.map { if (it) 1 else 0 }.joinToString("")}
          ^
Main.kt:207:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun debugDim(A: Array<LongArray>) {
          ^
Main.kt:214:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun debugDim(A: Array<IntArray>) {
          ^
Main.kt:221:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun debugDim(A: Array<BooleanArray>) {
          ^
Main.kt:238:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types
  private inline fun assert(b: Boolean) = run{if (!b) throw AssertionError()}
          ^

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
import java.io.BufferedReader
import java.io.InputStream
import java.io.InputStreamReader
import java.lang.AssertionError
import java.util.*
import kotlin.math.*
val MOD = 1_000_000_007
/**
 * @param mod 逆数計算するため素数でないといけない
 */
class Comb(n: Int, val mod: Int) {
  val F = LongArray(n + 1)
  val I = LongArray(n + 1)
  // n>=modでも処理できるように、*modを別扱いにする
  val cntF = IntArray(n + 1) // Fの*modの数
  val x = IntArray(n + 1) // 数値から*modを取り除いた値
  val cntX = IntArray(n + 1) // xの*modの数
  init {
    F[0] = 1
    I[0] = 1
    for (i in 1..n) {
      x[i] = i
      if(x[i] % mod == 0) {
        val j = i/mod
        cntX[i] = cntX[j] + 1
        x[i] = x[j]
      }
      F[i] = F[i - 1] * x[i] % mod
      cntF[i] += cntF[i - 1] + cntX[i]
    }
    I[n] = powMod(F[n], (mod - 2).toLong(), mod)
    for (i in n - 1 downTo 0) {
      I[i] = I[i + 1] * x[i + 1] % mod
    }
  }
  private fun powMod(a: Long, n: Long, mod: Int): Long {
    if (n == 0L) return 1
    val res = powMod(a * a % mod, n / 2, mod)
    return if (n % 2 == 1L) res * a % mod else res
  }
  fun comb(n: Int, k: Int): Long {
    if (n < k) return 0L
    val c = cntF[n] - cntF[k] - cntF[n - k]
    return if (c > 0) 0 else F[n] * I[k] % mod * I[n - k] % mod
  }
  fun perm(n: Int, k: Int): Long {
    val c = cntF[n] - cntF[n - k]
    return if (c > 0) 0 else F[n] * I[n - k] % mod
  }
  fun inv(x: Int): Long {
    val c = cntF[x] - cntF[x - 1]
    return if (c > 0) 0 else I[x] * F[x - 1] % mod
  }
  /**
   * nのグループからk回重複ありで選ぶ組み合わせ数
   * n - 1のしきりとkの○で考える
   */
  fun H(n: Int, k: Int) = comb(n + k - 1, k)
}
class Solver(stream: InputStream, private val out: java.io.PrintWriter) {
  private val reader = BufferedReader(InputStreamReader(stream), 32768)
  fun solve() {
    val N = ni()
    val M = nl()
    val A = intArrayOf(0) + na(N - 1)
    debug(A)
    val C = LongArray(N - 1)
    for (i in 0 until N - 1) {
      C[i] = (MOD + A[i + 1] - A[i]).toLong() % MOD
    }
    debug(C)
    val comb = Comb(N, MOD)
    var ans = 0L
    var cur = 1L
    for (i in 0 until N - 1) {
      val n = i + 1
      val mul = (M+n) %MOD
      val div = comb.inv(n)
      cur = cur *mul%MOD *div%MOD
      val cont = (MOD + cur - 1) % MOD
      ans += C[N - 2 - i] *cont%MOD
    }
    out.println(ans % MOD)
  }
  private val isDebug = try {
    // なんか本番でエラーでる
    System.getenv("MY_DEBUG") != null
  } catch (t: Throwable) {
    false
  }
  private var tokenizer: StringTokenizer? = null
  private fun next(): String {
    while (tokenizer == null || !tokenizer!!.hasMoreTokens()) {
      tokenizer = StringTokenizer(reader.readLine())
    }
    return tokenizer!!.nextToken()
  }
  private fun ni() = next().toInt()
  private fun nl() = next().toLong()
  private fun ns() = next()
  private fun na(n: Int, offset: Int = 0): IntArray {
    return IntArray(n) { ni() + offset }
  }
  private fun nal(n: Int, offset: Int = 0): LongArray {
    val res = LongArray(n)
    for (i in 0 until n) {
      res[i] = nl() + offset
    }
    return res
  }
  private fun na2(n: Int, offset: Int = 0): Array<IntArray> {
    val a  = Array(2){IntArray(n)}
    for (i in 0 until n) {
      for (e in a) {
        e[i] = ni() + offset
      }
    }
    return a
  }
  private inline fun debug(msg: () -> String) {
    if (isDebug) System.err.println(msg())
  }
  /**
   * コーナーケースでエラー出たりするので、debug(dp[1])のように添え字付きの場合はdebug{}をつかうこと
   */
  private inline fun debug(a: LongArray) {
    debug { a.joinToString(" ") }
  }
  private inline fun debug(a: IntArray) {
    debug { a.joinToString(" ") }
  }
  private inline fun debug(a: BooleanArray) {
    debug { toString(a) }
  }
  private inline fun toString(a: BooleanArray) = run{a.map { if (it) 1 else 0 }.joinToString("")}
  private inline fun debugDim(A: Array<LongArray>) {
    if (isDebug) {
      for (a in A) {
        debug(a)
      }
    }
  }
  private inline fun debugDim(A: Array<IntArray>) {
    if (isDebug) {
      for (a in A) {
        debug(a)
      }
    }
  }
  private inline fun debugDim(A: Array<BooleanArray>) {
    if (isDebug) {
      for (a in A) {
        debug(a)
      }
    }
  }
  /**
   * 勝手にimport消されるのを防ぎたい
   */
  private fun hoge() {
    min(1, 2)
    max(1, 2)
    abs(-10)
  }
  private inline fun assert(b: Boolean) = run{if (!b) throw AssertionError()}
  private inline fun assert(b: Boolean, f: () -> String) = run{if (!b) throw AssertionError(f())}
}
fun main() {
  val out = java.io.PrintWriter(System.out)
  Solver(System.`in`, out).solve()
  out.flush()
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX