結果
問題 | No.603 hel__world (2) |
ユーザー | maspy |
提出日時 | 2020-05-05 20:51:06 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 2,165 bytes |
コンパイル時間 | 101 ms |
コンパイル使用メモリ | 11,164 KB |
実行使用メモリ | 112,748 KB |
最終ジャッジ日時 | 2023-09-09 10:33:01 |
合計ジャッジ時間 | 19,737 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 242 ms
68,452 KB |
testcase_01 | AC | 238 ms
68,800 KB |
testcase_02 | AC | 236 ms
68,628 KB |
testcase_03 | AC | 237 ms
68,624 KB |
testcase_04 | AC | 229 ms
68,584 KB |
testcase_05 | AC | 237 ms
68,748 KB |
testcase_06 | AC | 122 ms
29,644 KB |
testcase_07 | AC | 241 ms
68,652 KB |
testcase_08 | AC | 234 ms
68,820 KB |
testcase_09 | AC | 237 ms
68,684 KB |
testcase_10 | AC | 237 ms
68,684 KB |
testcase_11 | AC | 1,234 ms
87,572 KB |
testcase_12 | AC | 1,222 ms
86,836 KB |
testcase_13 | AC | 1,228 ms
86,944 KB |
testcase_14 | AC | 226 ms
68,472 KB |
testcase_15 | RE | - |
testcase_16 | AC | 240 ms
68,508 KB |
testcase_17 | AC | 240 ms
68,792 KB |
testcase_18 | AC | 240 ms
68,828 KB |
testcase_19 | AC | 240 ms
68,496 KB |
testcase_20 | AC | 553 ms
77,784 KB |
testcase_21 | AC | 545 ms
77,776 KB |
testcase_22 | AC | 124 ms
29,592 KB |
testcase_23 | AC | 256 ms
68,472 KB |
testcase_24 | AC | 256 ms
68,452 KB |
testcase_25 | AC | 1,247 ms
87,692 KB |
testcase_26 | AC | 1,227 ms
86,784 KB |
testcase_27 | AC | 1,200 ms
87,052 KB |
testcase_28 | AC | 1,314 ms
112,748 KB |
testcase_29 | AC | 541 ms
77,552 KB |
testcase_30 | AC | 382 ms
73,100 KB |
testcase_31 | AC | 238 ms
68,684 KB |
testcase_32 | AC | 550 ms
77,688 KB |
ソースコード
import sys import numpy as np read = sys.stdin.buffer.read readline = sys.stdin.buffer.readline readlines = sys.stdin.buffer.readlines MOD = 10**6 + 3 S = tuple(map(int, readline().split())) T = tuple(x - ord('a') for x in read().rstrip()) L = [[] for _ in range(26)] last_ch = -1 last_len = 0 for x in T: if x != last_ch: L[x].append(1) else: L[x][-1] += 1 last_ch = x def check_zero(S, L): for a in range(26): # if S[a] > 0 and (not L[a]): # return True if S[a] < sum(L[a]): return True if check_zero(S, L): print(0) exit() def cumprod(A, MOD=MOD): L = len(A) Lsq = int(L**.5 + 1) A = np.resize(A, Lsq**2).reshape(Lsq, Lsq) for n in range(1, Lsq): A[:, n] *= A[:, n - 1] A[:, n] %= MOD for n in range(1, Lsq): A[n] *= A[n - 1, -1] A[n] %= MOD return A.ravel()[:L] def make_fact(U, MOD=MOD): x = np.arange(U, dtype=np.int64) x[0] = 1 fact = cumprod(x, MOD) x = np.arange(U, 0, -1, dtype=np.int64) x[0] = pow(int(fact[-1]), MOD - 2, MOD) fact_inv = cumprod(x, MOD)[::-1] fact.flags.writeable = False fact_inv.flags.writeable = False return fact, fact_inv fact, fact_inv = make_fact(MOD) def compute(n, nums): if not nums: return 1 nums = np.asarray(nums, np.int64) s = n - nums.sum() low = 0 # low * k 以下は全部とる high = 2 * (10**18) // (nums.sum()) for _ in range(200): x = (low + high) / 2 a = np.floor(x * nums).astype(np.int64) if a.sum() <= s: low = x else: high = x n1 = nums + np.floor(low * nums).astype(np.int64) n2 = nums + np.floor(high * nums).astype(np.int64) rest = n - n1.sum() I = np.where(n1 < n2)[0] r = n - n1.sum() n1[I[:r]] += 1 r = n - n1.sum() assert r == 0 n = n1 k = nums # nCkの積を計算しよう n %= MOD if np.any(n < k): return 0 x = fact[n] * fact_inv[k] * fact_inv[n - k] % MOD return cumprod(x)[-1] x = 1 for n, nums in zip(S, L): x *= compute(n, nums) x %= MOD print(x)