結果
問題 | No.1239 Multiplication -2 |
ユーザー | shotoyoo |
提出日時 | 2020-09-26 00:02:40 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,439 bytes |
コンパイル時間 | 279 ms |
コンパイル使用メモリ | 87,068 KB |
実行使用メモリ | 106,088 KB |
最終ジャッジ日時 | 2023-09-10 17:16:05 |
合計ジャッジ時間 | 9,507 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 92 ms
71,520 KB |
testcase_01 | AC | 92 ms
71,276 KB |
testcase_02 | AC | 93 ms
71,704 KB |
testcase_03 | AC | 107 ms
77,408 KB |
testcase_04 | AC | 110 ms
77,696 KB |
testcase_05 | AC | 106 ms
77,760 KB |
testcase_06 | AC | 96 ms
72,428 KB |
testcase_07 | AC | 95 ms
72,168 KB |
testcase_08 | WA | - |
testcase_09 | AC | 93 ms
71,736 KB |
testcase_10 | AC | 93 ms
71,408 KB |
testcase_11 | AC | 93 ms
71,696 KB |
testcase_12 | WA | - |
testcase_13 | AC | 93 ms
71,580 KB |
testcase_14 | AC | 92 ms
71,684 KB |
testcase_15 | WA | - |
testcase_16 | AC | 343 ms
92,848 KB |
testcase_17 | AC | 156 ms
105,544 KB |
testcase_18 | AC | 163 ms
105,772 KB |
testcase_19 | AC | 155 ms
105,624 KB |
testcase_20 | AC | 169 ms
105,752 KB |
testcase_21 | AC | 255 ms
105,736 KB |
testcase_22 | AC | 254 ms
105,664 KB |
testcase_23 | AC | 242 ms
97,608 KB |
testcase_24 | AC | 232 ms
97,352 KB |
testcase_25 | AC | 119 ms
92,612 KB |
testcase_26 | AC | 161 ms
95,116 KB |
testcase_27 | AC | 302 ms
85,816 KB |
testcase_28 | AC | 393 ms
102,808 KB |
testcase_29 | AC | 386 ms
102,820 KB |
testcase_30 | AC | 334 ms
88,020 KB |
testcase_31 | AC | 350 ms
95,164 KB |
testcase_32 | AC | 404 ms
106,088 KB |
testcase_33 | AC | 368 ms
97,636 KB |
testcase_34 | AC | 345 ms
95,500 KB |
testcase_35 | AC | 325 ms
87,316 KB |
testcase_36 | WA | - |
ソースコード
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 first = 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)