結果
問題 | No.3144 Parentheses Modification and Rotation (01 Ver.) |
ユーザー |
|
提出日時 | 2025-05-16 22:54:54 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 134 ms / 2,000 ms |
コード長 | 5,949 bytes |
コンパイル時間 | 272 ms |
コンパイル使用メモリ | 82,688 KB |
実行使用メモリ | 86,720 KB |
最終ジャッジ日時 | 2025-06-28 14:12:11 |
合計ジャッジ時間 | 5,411 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 39 |
ソースコード
# input import sys input = sys.stdin.readline II = lambda : int(input()) MI = lambda : map(int, input().split()) LI = lambda : [int(a) for a in input().split()] SI = lambda : input().rstrip() LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)] LSI = lambda n : [input().rstrip() for _ in range(n)] MI_1 = lambda : map(lambda x:int(x)-1, input().split()) LI_1 = lambda : [int(a)-1 for a in input().split()] def graph(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[int]]: edge = [set() for i in range(n+1+index)] for _ in range(m): a,b = map(int, input().split()) a += index b += index edge[a].add(b) if not dir: edge[b].add(a) return edge def graph_w(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[tuple]]: edge = [set() for i in range(n+1+index)] for _ in range(m): a,b,c = map(int, input().split()) a += index b += index edge[a].add((b,c)) if not dir: edge[b].add((a,c)) return edge mod = 998244353 inf = 1001001001001001001 ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97 ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97 yes = lambda : print("Yes") no = lambda : print("No") yn = lambda flag : print("Yes" if flag else "No") def acc(a:list[int]): sa = [0]*(len(a)+1) for i in range(len(a)): sa[i+1] = a[i] + sa[i] return sa prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1) alplow = "abcdefghijklmnopqrstuvwxyz" alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ" URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)} DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]] DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]] DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]] prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59] sys.set_int_max_str_digits(0) sys.setrecursionlimit(10**6) # import pypyjit # pypyjit.set_param('max_unroll_recursion=-1') from collections import defaultdict,deque from heapq import heappop,heappush from bisect import bisect_left,bisect_right DD = defaultdict BSL = bisect_left BSR = bisect_right class SegTree: __slots__ = ["n", "size", "op", "e", "data"] def __init__(self, op, e, lst): self.n = len(lst) self.size = 1 << (self.n - 1).bit_length() self.op = op self.e = e self.data = [e] * (2 * self.size) for i in range(self.n): self.data[self.size + i] = lst[i] for i in range(self.size - 1, 0, -1): self.data[i] = self.op(self.data[2*i], self.data[2*i+1]) def get(self, i): return self.data[self.size+i] def add(self, i, x): i += self.size self.data[i] = self.op(x, self.data[i]) while i > 1: i >>= 1 self.data[i] = self.op(self.data[2*i], self.data[2*i+1]) def set(self, i, x): i += self.size self.data[i] = x while i > 1: i >>= 1 self.data[i] = self.op(self.data[2*i], self.data[2*i+1]) def prod(self, l, r): if r <= l: return self.e lres = self.e rres = self.e l += self.size r += self.size while l < r: if l & 1: lres = self.op(lres, self.data[l]) l += 1 if r & 1: r -= 1 rres = self.op(self.data[r], rres) l >>= 1 r >>= 1 return self.op(lres, rres) def all_prod(self): return self.data[1] def max_right(self, l, g): assert 0<=l and l<=self.n assert g(self.e) if l == self.n: return self.n l += self.size sm = self.e while 1: while l&1 == 0: l >>= 1 if not(g(self.op(sm, self.data[l]))): while l < self.size: l = 2*l nsm = self.op(sm, self.data[l]) if g(nsm): sm = nsm l += 1 return l-self.size sm = self.op(sm, self.data[l]) l += 1 if (l&-l) == l: break return self.n def min_left(self, r, g): if r == -1: r = self.n assert 0<=r and r<=self.n assert g(self.e) if r == 0: return 0 r += self.size sm = self.e while 1: r -= 1 while (r>1 and r&1): r >>= 1 if not(g(self.op(self.data[r], sm))): while r < self.size: r = 2*r+1 nsm = self.op(self.data[r], sm) if g(nsm): sm = nsm r -= 1 return r + 1 -self.size sm = self.op(self.data[r], sm) if (r&-r) == r: break return 0 def __str__(self): return str(self.data[self.size:self.size+self.n]) # 対応のとれたカッコ列にするための最小コスト # rotateするときは最も右の "(" を先頭に持ってくるのが最善 n = II() s = SI() a = [1 if ("(" == x) else -1 for x in s] r, m = MI() if n & 1: print(-1) exit() def calc(a):# へんこうする最低の数 a += a c = [0] * (2 * n + 1) s = 0 for i in range(2 * n): s += a[i] c[i + 1] = s # print(c) st = SegTree(min, inf, c) res = [0] * n for i in range(n): dif = c[i] - st.prod(i, i+n+1) res[i] = 2 * ((dif+1)//2) * m # print(a, d, res) return res s = sum(a) if s < 0: a = [-x for x in reversed(a)] res = calc(a) for i in range(n): res[i] += r * i else: res = calc(a) for i in range(1, n): res[i] += r * (n - i) # print(res) print(min(res) + (abs(s)//2) * m)