結果
問題 | No.603 hel__world (2) |
ユーザー | maspy |
提出日時 | 2020-05-05 20:33:27 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,123 bytes |
コンパイル時間 | 86 ms |
コンパイル使用メモリ | 11,184 KB |
実行使用メモリ | 96,592 KB |
最終ジャッジ日時 | 2023-09-09 09:59:07 |
合計ジャッジ時間 | 15,826 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 247 ms
68,536 KB |
testcase_01 | AC | 244 ms
68,668 KB |
testcase_02 | AC | 242 ms
68,588 KB |
testcase_03 | AC | 243 ms
68,532 KB |
testcase_04 | AC | 246 ms
68,664 KB |
testcase_05 | AC | 244 ms
68,688 KB |
testcase_06 | AC | 129 ms
29,592 KB |
testcase_07 | AC | 245 ms
68,604 KB |
testcase_08 | AC | 240 ms
68,584 KB |
testcase_09 | AC | 242 ms
68,472 KB |
testcase_10 | AC | 240 ms
68,840 KB |
testcase_11 | AC | 1,274 ms
86,956 KB |
testcase_12 | AC | 1,289 ms
86,580 KB |
testcase_13 | AC | 1,270 ms
87,220 KB |
testcase_14 | AC | 240 ms
68,484 KB |
testcase_15 | WA | - |
testcase_16 | AC | 242 ms
68,568 KB |
testcase_17 | AC | 242 ms
68,472 KB |
testcase_18 | AC | 244 ms
68,660 KB |
testcase_19 | AC | 242 ms
68,844 KB |
testcase_20 | AC | 552 ms
77,364 KB |
testcase_21 | AC | 559 ms
77,640 KB |
testcase_22 | AC | 128 ms
29,644 KB |
testcase_23 | AC | 258 ms
68,752 KB |
testcase_24 | AC | 262 ms
68,624 KB |
testcase_25 | RE | - |
testcase_26 | RE | - |
testcase_27 | RE | - |
testcase_28 | RE | - |
testcase_29 | AC | 568 ms
77,628 KB |
testcase_30 | AC | 406 ms
73,232 KB |
testcase_31 | AC | 241 ms
68,556 KB |
testcase_32 | AC | 550 ms
77,380 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) r = n - n1.sum() assert r < 100 I = np.where(n1 < n2)[0] n1[I[:r]] += 1 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)