結果
問題 | No.315 世界のなんとか3.5 |
ユーザー | yagisumi |
提出日時 | 2021-04-01 17:19:34 |
言語 | TypeScript (5.4.3) |
結果 |
TLE
|
実行時間 | - |
コード長 | 4,479 bytes |
コンパイル時間 | 8,742 ms |
コンパイル使用メモリ | 256,880 KB |
実行使用メモリ | 50,516 KB |
最終ジャッジ日時 | 2023-08-22 19:58:42 |
合計ジャッジ時間 | 19,429 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 77 ms
42,392 KB |
testcase_01 | AC | 83 ms
45,308 KB |
testcase_02 | AC | 353 ms
50,516 KB |
testcase_03 | AC | 80 ms
45,140 KB |
testcase_04 | AC | 78 ms
45,396 KB |
testcase_05 | AC | 87 ms
45,148 KB |
testcase_06 | AC | 301 ms
50,356 KB |
testcase_07 | AC | 88 ms
45,276 KB |
testcase_08 | AC | 124 ms
47,364 KB |
testcase_09 | AC | 81 ms
45,428 KB |
testcase_10 | AC | 79 ms
45,136 KB |
testcase_11 | AC | 80 ms
45,360 KB |
testcase_12 | AC | 1,521 ms
46,976 KB |
testcase_13 | AC | 1,522 ms
47,076 KB |
testcase_14 | AC | 1,573 ms
47,188 KB |
testcase_15 | AC | 1,560 ms
47,556 KB |
testcase_16 | TLE | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
ソースコード
import * as fs from 'fs' // import * as readline from 'readline' // const rl = readline.createInterface({ input: process.stdin, output: process.stdout }) // const ask = (query: string) => new Promise<string>((resolve) => rl.question(query, resolve)) // // Don't forget `rl.close()`. const INT = Math.floor declare global { interface Array<T> { last(): T | undefined isEmpty(): boolean } } Array.prototype.last = function () { return this.length === 0 ? undefined : this[this.length - 1] } Array.prototype.isEmpty = function () { return this.length === 0 } const bigIntMax = (...args: bigint[]) => args.reduce((m, e) => (e > m ? e : m)) const bigIntMin = (...args: bigint[]) => args.reduce((m, e) => (e < m ? e : m)) const bigIntAbs = (arg: bigint) => (arg < 0 ? -arg : arg) declare const stdin: number function read_stdin() { return fs.readFileSync(process.env.NODE_ENV === 'debug' ? stdin : process.stdin.fd, 'utf8') } class Input { readonly inputs: string[] private index = 0 constructor(str?: string) { this.inputs = (str ? str : read_stdin()).split(/\s+/) } number() { return Number(this.inputs[this.index++]) } numbers(n: number) { return this.inputs.slice(this.index, (this.index += n)).map(Number) } bigint() { return BigInt(this.inputs[this.index++]) } bigints(n: number) { return this.inputs.slice(this.index, (this.index += n)).map(BigInt) } word() { return this.inputs[this.index++] } words(n: number) { return this.inputs.slice(this.index, (this.index += n)) } } function array<T>(len: number, init: T): T[] { return Array(len).fill(init) } function array2<T>(h: number, w: number, init: T): T[][] { return array(h, 0).map(() => array(w, init)) } function main() { const input = new Input() const A_ = input.word() const B = input.word() const A = A_.padStart(B.length, '0') const P = input.number() const M = 10 ** 9 + 7 const b_max_state = { mod3: 0, has3: false, mod8: 0, } const a_max_state = { mod3: 0, has3: false, mod8: 0, } let b_count = 0 let a_count = 0 let b_dp = Array(3 * 2 * P).fill(0) let b_dp2 = Array(3 * 2 * P) let a_dp = Array(3 * 2 * P).fill(0) let a_dp2 = Array(3 * 2 * P) function IDX(mod3: number, has3: boolean, mod8: number) { return mod3 * 2 * P + (has3 ? 1 : 0) * P + mod8 } for (let i = 0; i < B.length; i++) { b_dp2.fill(0) a_dp2.fill(0) const b_digit = Number(B[i]) const a_digit = Number(A[i]) for (let j = 0; j < b_digit; j++) { const m3 = (b_max_state.mod3 * 10 + j) % 3 const has3 = b_max_state.has3 || j === 3 const m8 = (b_max_state.mod8 * 10 + j) % P b_dp2[IDX(m3, has3, m8)] += 1 if (i === B.length - 1 && (m3 === 0 || has3) && m8 !== 0) { b_count += 1 } } b_max_state.mod3 = (b_max_state.mod3 * 10 + b_digit) % 3 b_max_state.has3 = b_max_state.has3 || b_digit === 3 b_max_state.mod8 = (b_max_state.mod8 * 10 + b_digit) % P for (let j = 0; j < a_digit; j++) { const m3 = (a_max_state.mod3 * 10 + j) % 3 const has3 = a_max_state.has3 || j === 3 const m8 = (a_max_state.mod8 * 10 + j) % P a_dp2[IDX(m3, has3, m8)] += 1 if (i === B.length - 1 && (m3 === 0 || has3) && m8 !== 0) { a_count += 1 } } a_max_state.mod3 = (a_max_state.mod3 * 10 + a_digit) % 3 a_max_state.has3 = a_max_state.has3 || a_digit === 3 a_max_state.mod8 = (a_max_state.mod8 * 10 + a_digit) % P for (let m3 = 0; m3 < 3; m3++) { for (let has3 = 0; has3 < 2; has3++) { for (let m8 = 0; m8 < P; m8++) { for (let j = 0; j < 10; j++) { const t3 = (m3 * 10 + j) % 3 const h3 = has3 === 1 || j === 3 const t8 = (m8 * 10 + j) % P const idx = IDX(t3, h3, t8) const idx0 = IDX(m3, has3 === 1, m8) b_dp2[idx] = (b_dp2[idx] + b_dp[idx0]) % M a_dp2[idx] = (a_dp2[idx] + a_dp[idx0]) % M if (i === B.length - 1 && (t3 === 0 || h3) && t8 !== 0) { b_count = (b_count + b_dp[idx0]) % M a_count = (a_count + a_dp[idx0]) % M } } } } } ;[b_dp, b_dp2, a_dp, a_dp2] = [b_dp2, b_dp, a_dp2, a_dp] } if ((b_max_state.mod3 === 0 || b_max_state.has3) && b_max_state.mod8 !== 0) { b_count += 1 } const r = (b_count - a_count) % M console.log(r < 0 ? r + M : r) } main()