Submission #1342125


Source Code Expand

#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import array
from bisect import *
from collections import *
import fractions
import heapq 
from itertools import *
import math
import re
import string

_ = input()
S = input()
stack = 0
made = ''
for ch in S:
    # print("ch, stack = ", ch, stack)
    if ch == '(':
        stack += 1
        made += '('
    elif ch == ')':
        if stack == 0:
            made = '(' + made + ')'
        else:
            made += ')'
            stack -= 1
made += ')' * stack
print(made)

Submission Info

Submission Time
Task D - Insertion
User minus9d
Language Python (3.4.3)
Score 400
Code Size 553 Byte
Status AC
Exec Time 42 ms
Memory 5460 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 12
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All in1.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
in1.txt AC 42 ms 5460 KB
in2.txt AC 37 ms 5332 KB
in3.txt AC 37 ms 5332 KB
in4.txt AC 38 ms 5332 KB
in5.txt AC 37 ms 5332 KB
in6.txt AC 37 ms 5332 KB
in7.txt AC 37 ms 5332 KB
in8.txt AC 37 ms 5332 KB
in9.txt AC 37 ms 5332 KB
s1.txt AC 37 ms 5332 KB
s2.txt AC 37 ms 5332 KB
s3.txt AC 37 ms 5332 KB