結果
問題 | No.1239 Multiplication -2 |
ユーザー | shotoyoo |
提出日時 | 2020-09-26 00:10:52 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,417 bytes |
コンパイル時間 | 270 ms |
コンパイル使用メモリ | 87,064 KB |
実行使用メモリ | 105,812 KB |
最終ジャッジ日時 | 2023-09-10 17:17:37 |
合計ジャッジ時間 | 9,350 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 92 ms
71,580 KB |
testcase_01 | AC | 91 ms
71,568 KB |
testcase_02 | AC | 93 ms
71,588 KB |
testcase_03 | AC | 106 ms
77,544 KB |
testcase_04 | AC | 108 ms
77,660 KB |
testcase_05 | AC | 105 ms
77,328 KB |
testcase_06 | AC | 94 ms
72,172 KB |
testcase_07 | AC | 95 ms
71,924 KB |
testcase_08 | AC | 92 ms
71,476 KB |
testcase_09 | AC | 91 ms
71,520 KB |
testcase_10 | AC | 90 ms
71,456 KB |
testcase_11 | AC | 91 ms
71,528 KB |
testcase_12 | AC | 92 ms
71,820 KB |
testcase_13 | AC | 91 ms
71,324 KB |
testcase_14 | AC | 91 ms
71,516 KB |
testcase_15 | WA | - |
testcase_16 | AC | 339 ms
93,016 KB |
testcase_17 | AC | 156 ms
105,732 KB |
testcase_18 | AC | 164 ms
105,588 KB |
testcase_19 | AC | 153 ms
105,720 KB |
testcase_20 | AC | 168 ms
105,644 KB |
testcase_21 | AC | 256 ms
105,764 KB |
testcase_22 | AC | 250 ms
105,772 KB |
testcase_23 | AC | 239 ms
97,536 KB |
testcase_24 | AC | 232 ms
97,656 KB |
testcase_25 | AC | 117 ms
92,164 KB |
testcase_26 | AC | 166 ms
94,868 KB |
testcase_27 | AC | 304 ms
85,764 KB |
testcase_28 | AC | 398 ms
102,932 KB |
testcase_29 | AC | 391 ms
102,780 KB |
testcase_30 | AC | 338 ms
88,012 KB |
testcase_31 | AC | 359 ms
95,072 KB |
testcase_32 | AC | 429 ms
105,812 KB |
testcase_33 | AC | 371 ms
97,516 KB |
testcase_34 | AC | 346 ms
95,228 KB |
testcase_35 | WA | - |
testcase_36 | AC | 322 ms
85,828 KB |
ソースコード
import sys input = lambda : sys.stdin.readline().rstrip() sys.setrecursionlimit(max(1000, 10**9)) write = lambda x: sys.stdout.write(x+"\n") n = int(input()) a = list(map(int, input().split())) ls = [] from collections import deque l = deque() flg = False left = True first = True right = False seen0 = False for num in a: if num==0: seen0 = True if l: if flg: if first: left = False first = False ls.append(list(l)) l = deque() flg = False elif (num==2 or num==-2) and flg: ls.append(list(l)) if seen0 and first: left = False first = False while abs(l[0])!=2: l.popleft() l.popleft() l.append(num) flg = True elif (num==2 or num==-2): l.append(num) flg = True else: if seen0 and first: left = False l.append(num) if l and flg: if seen0 and first: left = False ls.append(list(l)) right = True M = 998244353 inv2 = pow(2, M-2, M) invs = [None]*(n+10) invs[0] = 1 for i in range(1, n+10): invs[i] = invs[i-1]*inv2 invs[i] %= M def sub(l, left=False, right=False): if 2 in l: ind = l.index(2) flg2 = True else: ind = l.index(-2) flg2 = False e0 = inv2 if (ind>0 or not left) else 1 o0 = 0 e1 = inv2 if (ind<len(l)-1 or not right) else 1 o1 = 0 even = True for i in range(ind): if l[ind-i-1]==-1: even = not even tmp = invs[i+2] if (i<ind-1 or (not left)) else invs[i+1] if even: e0 += tmp else: o0 += tmp even = True for i in range(len(l)-ind-1): if l[ind+i+1]==-1: even = not even tmp = invs[i+2] if (i<len(l)-ind-2 or (not right)) else invs[i+1] if even: e1 += tmp else: o1 += tmp if not flg2: ans = e0*e1 + o0*o1 else: ans = e0*o1 + e1*o0 # print(left, right, e0, e1, o0, o1, ans%M) return ans%M if len(ls)==0: ans = 0 elif len(ls)==1: ans = sub(ls[0], left=left, right=right) else: ans = 0 ans += sub(ls[0], left=left) ans %= M for i in range(1, len(ls)-1): ans += sub(ls[i]) ans %= M ans += sub(ls[-1], right=right) ans %= M print(ans%M)