結果
問題 | No.1677 mæx |
ユーザー | ansain |
提出日時 | 2021-09-10 22:53:50 |
言語 | PyPy3 (7.3.13) |
結果 |
AC
|
実行時間 | 408 ms / 2,000 ms |
コード長 | 2,290 bytes |
コンパイル時間 | 834 ms |
コンパイル使用メモリ | 87,160 KB |
実行使用メモリ | 149,200 KB |
最終ジャッジ日時 | 2023-09-02 20:18:51 |
合計ジャッジ時間 | 8,545 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 98 ms
71,824 KB |
testcase_01 | AC | 98 ms
71,920 KB |
testcase_02 | AC | 97 ms
71,700 KB |
testcase_03 | AC | 98 ms
71,740 KB |
testcase_04 | AC | 392 ms
127,196 KB |
testcase_05 | AC | 369 ms
128,100 KB |
testcase_06 | AC | 374 ms
128,716 KB |
testcase_07 | AC | 371 ms
128,068 KB |
testcase_08 | AC | 371 ms
127,604 KB |
testcase_09 | AC | 376 ms
129,384 KB |
testcase_10 | AC | 375 ms
128,380 KB |
testcase_11 | AC | 408 ms
127,660 KB |
testcase_12 | AC | 369 ms
128,124 KB |
testcase_13 | AC | 372 ms
127,260 KB |
testcase_14 | AC | 358 ms
126,028 KB |
testcase_15 | AC | 358 ms
124,552 KB |
testcase_16 | AC | 361 ms
125,604 KB |
testcase_17 | AC | 367 ms
125,256 KB |
testcase_18 | AC | 361 ms
126,768 KB |
testcase_19 | AC | 99 ms
71,652 KB |
testcase_20 | AC | 99 ms
71,932 KB |
testcase_21 | AC | 379 ms
149,200 KB |
ソースコード
import sys from collections import defaultdict, Counter, deque from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate import operator from math import sqrt, gcd, factorial #from math import isqrt, prod, comb #python3.8用(notpypy) from bisect import bisect_left, bisect_right #from functools import lru_cache, reduce #from heapq import heappush, heappop, heapify, heappushpop, heapreplace #import numpy as np #import networkx as nx #from networkx.utils import UnionFind #from numba import njit, b1, i1, i4, i8, f8 #numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1 #from scipy.sparse import csr_matrix #from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError, maximum_bipartite_matching, maximum_flow, minimum_spanning_tree def input(): return sys.stdin.readline().rstrip() def divceil(n, k): return 1+(n-1)//k # n/kの切り上げを返す def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no) sys.setrecursionlimit(6*10**4) def mex(a,b): if 0 not in [a,b]: return 0 elif 1 not in [a,b]: return 1 else: return 2 def main(): mod = 10**9+7 mod2 = 998244353 s=input() acc=list(accumulate([1 if ss=='(' else -1 if ss==')' else 0 for ss in s])) check=defaultdict(list) for i in range(len(s)): if s[i]==',': check[acc[i]].append(i) #print(check) def solve(l,r): if s[l]!='m': if s[l]=='?': return [1,1,1] else: ans=[0,0,0] ans[int(s[l])]=1 return ans else: #print(bisect_right(check[acc[l]], l)) mid=check[acc[l+4]][bisect_right(check[acc[l+4]], l)] a1=solve(l+4,mid) a2=solve(mid+1,r) ans=[0,0,0] op={'a':[max],'e':[mex],'?':[max,mex]} for o in op[s[l+1]]: for i in range(3): for j in range(3): ans[o(i,j)]+=a1[i]*a2[j] for i in range(3): ans[i]%=mod2 return ans print(solve(0,len(s))[int(input())]) if __name__ == '__main__': main()