結果
問題 | No.315 世界のなんとか3.5 |
ユーザー | maspy |
提出日時 | 2020-05-05 19:22:04 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 331 ms / 2,000 ms |
コード長 | 1,644 bytes |
コンパイル時間 | 161 ms |
コンパイル使用メモリ | 10,856 KB |
実行使用メモリ | 13,144 KB |
最終ジャッジ日時 | 2023-09-09 08:06:36 |
合計ジャッジ時間 | 7,704 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 58 ms
8,072 KB |
testcase_01 | AC | 61 ms
8,120 KB |
testcase_02 | AC | 82 ms
8,040 KB |
testcase_03 | AC | 89 ms
8,072 KB |
testcase_04 | AC | 96 ms
8,068 KB |
testcase_05 | AC | 85 ms
8,032 KB |
testcase_06 | AC | 97 ms
8,040 KB |
testcase_07 | AC | 85 ms
8,032 KB |
testcase_08 | AC | 88 ms
8,120 KB |
testcase_09 | AC | 77 ms
8,172 KB |
testcase_10 | AC | 67 ms
8,108 KB |
testcase_11 | AC | 85 ms
8,168 KB |
testcase_12 | AC | 134 ms
10,024 KB |
testcase_13 | AC | 116 ms
10,068 KB |
testcase_14 | AC | 178 ms
10,724 KB |
testcase_15 | AC | 177 ms
10,728 KB |
testcase_16 | AC | 175 ms
10,720 KB |
testcase_17 | AC | 172 ms
10,716 KB |
testcase_18 | AC | 141 ms
10,164 KB |
testcase_19 | AC | 153 ms
10,176 KB |
testcase_20 | AC | 136 ms
10,092 KB |
testcase_21 | AC | 148 ms
10,044 KB |
testcase_22 | AC | 199 ms
10,792 KB |
testcase_23 | AC | 188 ms
10,708 KB |
testcase_24 | AC | 192 ms
10,704 KB |
testcase_25 | AC | 180 ms
10,764 KB |
testcase_26 | AC | 188 ms
10,720 KB |
testcase_27 | AC | 177 ms
10,672 KB |
testcase_28 | AC | 190 ms
10,704 KB |
testcase_29 | AC | 283 ms
13,084 KB |
testcase_30 | AC | 286 ms
13,108 KB |
testcase_31 | AC | 269 ms
13,128 KB |
testcase_32 | AC | 281 ms
13,144 KB |
testcase_33 | AC | 186 ms
11,936 KB |
testcase_34 | AC | 276 ms
13,132 KB |
testcase_35 | AC | 331 ms
13,112 KB |
ソースコード
import sys read = sys.stdin.buffer.read readline = sys.stdin.buffer.readline readlines = sys.stdin.buffer.readlines MOD = 10**9 + 7 A, B, P = readline().split() P = int(P) A = [0, 0, 0, 0, 0] + [int(x) - ord('0') for x in A] B = [0, 0, 0, 0, 0] + [int(x) - ord('0') for x in B] def solve(A, P, include=True): total = 0 no_3 = 0 cnt = (0, 1, 2, 3, 3, 4, 5, 6, 7, 8) full_use_3 = False MOD3 = 3 * MOD for x in A[:-6]: total = (10 * total + x) % MOD3 no_3 = (9 * no_3) % MOD if not full_use_3: no_3 += cnt[x] full_use_3 |= x == 3 n = no_3 * 3 no_3 = [n, n, n] x = A[-6] full_use_3 |= 3 in A[:-6] for d in range(x): if full_use_3 or d == 3: continue no_3[(total + d) % 3] += 1 total = (total * 10 + x) % MOD3 use_3 = (total - sum(no_3)) % MOD full_mod_3 = total % 3 U = 0 for x in A[-5:]: U = 10 * U + x ret = 0 for x in range(10**5): if x % P == 0: continue if '3' in str(x): ret += total else: ret += use_3 + no_3[(-x) % 3] for x in range(U + include): if x % P == 0: continue if '3' in str(x) or full_use_3: ret += 1 else: ret += (full_mod_3 + x) % 3 == 0 return ret def solve_naive(A, P, include): N = 0 for x in A: N = 10 * N + x ret = 0 for x in range(N + include): if x % P == 0: continue ret += '3' in str(x) or x % 3 == 0 return ret x = solve(B, P, True) - solve(A, P, False) print(x % MOD)