結果
問題 | No.592 括弧の対応 (2) |
ユーザー | McGregorsh |
提出日時 | 2022-06-29 22:57:20 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 272 ms / 5,000 ms |
コード長 | 1,662 bytes |
コンパイル時間 | 270 ms |
コンパイル使用メモリ | 87,124 KB |
実行使用メモリ | 111,128 KB |
最終ジャッジ日時 | 2023-08-15 07:41:53 |
合計ジャッジ時間 | 2,340 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 224 ms
92,412 KB |
testcase_01 | AC | 272 ms
103,996 KB |
testcase_02 | AC | 268 ms
111,128 KB |
testcase_03 | AC | 251 ms
96,852 KB |
ソースコード
import sys, re from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): n = int(input()) s = input() ans = [0] * n nums = defaultdict(int) score = 0 for i in range(n): if s[i] == '(': score += 1 nums[score] = i else: point = nums[score] ans[i] = point+1 ans[point] = i+1 nums[score] = 0 score -= 1 for i in ans: print(i) if __name__ == '__main__': main()