結果
| 問題 |
No.1677 mæx
|
| コンテスト | |
| ユーザー |
titia
|
| 提出日時 | 2021-09-10 23:19:06 |
| 言語 | Python3 (3.13.1 + numpy 2.2.1 + scipy 1.14.1) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 1,878 bytes |
| コンパイル時間 | 443 ms |
| コンパイル使用メモリ | 13,184 KB |
| 実行使用メモリ | 35,736 KB |
| 最終ジャッジ日時 | 2024-06-12 03:59:37 |
| 合計ジャッジ時間 | 3,848 ms |
|
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 RE * 2 |
| other | TLE * 1 -- * 17 |
ソースコード
import sys
input = sys.stdin.readline
sys.setrecursionlimit(2*10**5)
S=input().strip()
K=int(input())
mod=998244353
if len(S)==1:
x=int(S)
if K==x:
print(1)
else:
print(0)
exit()
def calc(S,x):
if len(S)==1:
y=int(S)
if y==x:
return 1
else:
return 0
now=0
for i in range(4,len(S)):
if S[i]=="(":
now+=1
elif S[i]==")":
now-=1
elif S[i]=="," and now==0:
kom=i
break
T=S[4:kom]
U=S[kom+1:-1]
if S[0:2]=="max":
if x==0:
return calc(T,0)*calc(U,0)%mod
elif x==1:
return (calc(T,0)*calc(U,1)%mod+calc(T,1)*calc(U,0)%mod+calc(T,1)*calc(U,1)%mod)%mod
else:
return (calc(T,0)*calc(U,2)%mod+calc(T,1)*calc(U,2)%mod+calc(T,2)*calc(U,0)%mod+calc(T,2)*calc(U,1)%mod+calc(T,2)*calc(U,2)%mod)%mod
elif S[0:2]=="mex":
if x==0:
return calc(T,1)*calc(U,1)%mod + calc(T,1)*calc(U,2)%mod +calc(T,2)*calc(U,1)%mod + calc(T,2)*calc(U,2)%mod
elif x==1:
return calc(T,0)*calc(U,0)%mod
else:
return (calc(T,0)*calc(U,1)%mod+calc(T,1)*calc(U,0)%mod)%mod
else:
if x==0:
return calc(T,0)*calc(U,0)%mod +calc(T,1)*calc(U,1)%mod + calc(T,1)*calc(U,2)%mod +calc(T,2)*calc(U,1)%mod + calc(T,2)*calc(U,2)%mod
elif x==1:
return (calc(T,0)*calc(U,1)%mod+calc(T,1)*calc(U,0)%mod+calc(T,1)*calc(U,1)%mod)%mod + calc(T,0)*calc(U,0)%mod
else:
return (calc(T,0)*calc(U,2)%mod+calc(T,1)*calc(U,2)%mod+calc(T,2)*calc(U,0)%mod+calc(T,2)*calc(U,1)%mod+calc(T,2)*calc(U,2)%mod)%mod + (calc(T,0)*calc(U,1)%mod+calc(T,1)*calc(U,0)%mod)%mod
print(calc(S,K)%mod)
titia