Submission #1992606
Source Code Expand
N = int(input()) s=list(input()) n=0 l=0 r=0 L=[] while n < N: if s[n] == '(': l+=1 if r != 0: L.append(-1*r) r=0 n +=1 else: r += 1 if l != 0: L.append(l) l=0 n += 1 if r!=0: L.append(-1*r) elif l != 0: L.append(l) i=0 p=0 while i<len(L): if L[i] < 0: ins=0 while ins < abs(L[i]): s.insert(p,'(') ins+=1 p += 2*abs(L[i]) i += 1 elif (i+1)<len(L): if abs(L[i+1])>abs(L[i]): ins=0 while ins < (abs(L[i+1])-abs(L[i])): s.insert(p,'(') ins += 1 p += 2*abs(L[i+1]) i += 2 elif abs(L[i])>abs(L[i+1]): p += abs(L[i]) ins=0 while ins < (abs(L[i])-abs(L[i+1])): s.insert(p,')') ins+=1 p += abs(L[i]) i += 2 else: p += abs(L[i]) i += 2 else: ins=0 while ins < L[i]: s.insert(-1,')') ins+=1 i+=1 print(''.join(s))
Submission Info
Submission Time | |
---|---|
Task | D - Insertion |
User | yayyayyay |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 1201 Byte |
Status | WA |
Exec Time | 18 ms |
Memory | 3192 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||||
Status |
|
|
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 | WA | 17 ms | 3188 KB |
in2.txt | AC | 17 ms | 3188 KB |
in3.txt | WA | 17 ms | 3188 KB |
in4.txt | WA | 17 ms | 3192 KB |
in5.txt | WA | 18 ms | 3188 KB |
in6.txt | WA | 17 ms | 3188 KB |
in7.txt | WA | 17 ms | 3188 KB |
in8.txt | WA | 17 ms | 3188 KB |
in9.txt | AC | 17 ms | 3064 KB |
s1.txt | AC | 17 ms | 3188 KB |
s2.txt | WA | 17 ms | 3188 KB |
s3.txt | WA | 17 ms | 3188 KB |