結果
問題 | No.1655 123 Swaps |
ユーザー | Kiri8128 |
提出日時 | 2021-06-25 00:00:16 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,686 ms / 2,000 ms |
コード長 | 2,838 bytes |
コンパイル時間 | 609 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 227,076 KB |
最終ジャッジ日時 | 2024-04-22 03:24:39 |
合計ジャッジ時間 | 6,197 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 58 ms
68,608 KB |
testcase_01 | AC | 60 ms
68,736 KB |
testcase_02 | AC | 82 ms
80,512 KB |
testcase_03 | AC | 59 ms
68,224 KB |
testcase_04 | AC | 59 ms
68,608 KB |
testcase_05 | AC | 58 ms
68,224 KB |
testcase_06 | AC | 59 ms
68,480 KB |
testcase_07 | AC | 58 ms
68,480 KB |
testcase_08 | AC | 59 ms
68,608 KB |
testcase_09 | AC | 61 ms
69,504 KB |
testcase_10 | AC | 77 ms
76,544 KB |
testcase_11 | AC | 62 ms
70,400 KB |
testcase_12 | AC | 79 ms
78,080 KB |
testcase_13 | AC | 58 ms
68,608 KB |
testcase_14 | AC | 58 ms
68,480 KB |
testcase_15 | AC | 1,682 ms
218,760 KB |
testcase_16 | AC | 1,675 ms
218,140 KB |
testcase_17 | AC | 1,657 ms
219,892 KB |
testcase_18 | AC | 1,686 ms
219,972 KB |
testcase_19 | AC | 1,675 ms
219,628 KB |
testcase_20 | AC | 1,654 ms
218,752 KB |
testcase_21 | AC | 1,667 ms
219,024 KB |
testcase_22 | AC | 1,685 ms
220,252 KB |
testcase_23 | AC | 1,669 ms
220,508 KB |
testcase_24 | AC | 1,681 ms
220,248 KB |
testcase_25 | AC | 1,677 ms
220,380 KB |
testcase_26 | AC | 1,613 ms
218,948 KB |
testcase_27 | AC | 835 ms
144,940 KB |
testcase_28 | AC | 846 ms
142,684 KB |
testcase_29 | AC | 1,643 ms
227,076 KB |
testcase_30 | AC | 1,641 ms
225,864 KB |
testcase_31 | AC | 850 ms
142,208 KB |
testcase_32 | AC | 57 ms
68,480 KB |
testcase_33 | AC | 58 ms
68,096 KB |
testcase_34 | AC | 59 ms
68,480 KB |
testcase_35 | AC | 61 ms
68,480 KB |
testcase_36 | AC | 101 ms
94,720 KB |
testcase_37 | AC | 99 ms
95,232 KB |
testcase_38 | AC | 122 ms
101,888 KB |
testcase_39 | AC | 141 ms
102,016 KB |
testcase_40 | AC | 1,625 ms
218,504 KB |
testcase_41 | AC | 58 ms
68,736 KB |
testcase_42 | AC | 60 ms
68,608 KB |
testcase_43 | AC | 57 ms
68,480 KB |
testcase_44 | AC | 57 ms
68,480 KB |
ソースコード
p, g, ig = 924844033, 5, 554906420 W = [pow(g, (p - 1) >> i, p) for i in range(24)] iW = [pow(ig, (p - 1) >> i, p) for i in range(24)] def convolve(a, b): def fft(f): for l in range(k, 0, -1): d = 1 << l - 1 U = [1] for i in range(d): U.append(U[-1] * W[l] % p) for i in range(1 << k - l): for j in range(d): s = i * 2 * d + j t = s + d f[s], f[t] = (f[s] + f[t]) % p, U[j] * (f[s] - f[t]) % p def ifft(f): for l in range(1, k + 1): d = 1 << l - 1 U = [1] for i in range(d): U.append(U[-1] * iW[l] % p) for i in range(1 << k - l): for j in range(d): s = i * 2 * d + j t = s + d f[s], f[t] = (f[s] + f[t] * U[j]) % p, (f[s] - f[t] * U[j]) % p n0 = len(a) + len(b) - 1 if len(a) < 50 or len(b) < 50: ret = [0] * n0 if len(a) > len(b): a, b = b, a for i, aa in enumerate(a): for j, bb in enumerate(b): ret[i+j] = (ret[i+j] + aa * bb) % p return ret k = (n0).bit_length() n = 1 << k a = a + [0] * (n - len(a)) b = b + [0] * (n - len(b)) fft(a), fft(b) for i in range(n): a[i] = a[i] * b[i] % p ifft(a) invn = pow(n, p - 2, p) for i in range(n0): a[i] = a[i] * invn % p del a[n0:] return a P = 924844033 nn = 600600 fa = [1] * (nn+1) fainv = [1] * (nn+1) for i in range(nn): fa[i+1] = fa[i] * (i+1) % P fainv[-1] = pow(fa[-1], P-2, P) for i in range(nn)[::-1]: fainv[i] = fainv[i+1] * (i+1) % P def calc(a, b, c): M = a + b + c if M % 2: return 0 M //= 2 i3 = pow(3, P - 2, P) re = 0 A = [[0] * (a + 1) for _ in range(3)] B = [[0] * (b + 1) for _ in range(3)] for i in range(a + 1): A[(2*i-a)%3][i] = fainv[i] * fainv[a-i] % P for i in range(b + 1): B[(b-2*i)%3][i] = fainv[i] * fainv[b-i] % P AB = [[0] * (a + b + 1) for _ in range(2)] for k1 in range(3): for k2 in range(3): k = (k1 + k2) % 3 if k == 2: continue ab = AB[k] for i, x in enumerate(convolve(A[k1], B[k2])): ab[i] = (ab[i] + x) % P RE = [0] * 2 for k, ab in enumerate(AB): for i, x in enumerate(ab): if i > M: continue j = M - a - b + i if j < 0: continue RE[k] = (RE[k] + x * fainv[M-i] * fainv[j]) % P re = RE[0] - RE[1] re = re * fa[M] ** 2 % P * 2 * i3 % P re = (re + fa[M*2] * fainv[a] * fainv[b] * fainv[c] * i3) % P return re a, b, c = map(int, input().split()) print(calc(a, b, c))