Submission #2176361


Source Code Expand

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int INF = 1LL << 30;
int MOD = 1e9+7;
main(){
    int N;
    string S;
    cin >> N >> S;
    int depth = 0;//( := +1 ) := -1
    for(int i = 0;i < S.length();i++){
        if(S[i] == ')')depth--;
        else depth++;
        if(depth < 0){
            S = string(depth*-1,'(') + S;
            i -= depth;
            depth = 0;
        }
    }
    S += string(depth,')');
    cout << S << endl;
}

Submission Info

Submission Time
Task D - Insertion
User Bantako
Language C++14 (GCC 5.4.1)
Score 400
Code Size 487 Byte
Status AC
Exec Time 1 ms
Memory 256 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 1 ms 256 KB
in2.txt AC 1 ms 256 KB
in3.txt AC 1 ms 256 KB
in4.txt AC 1 ms 256 KB
in5.txt AC 1 ms 256 KB
in6.txt AC 1 ms 256 KB
in7.txt AC 1 ms 256 KB
in8.txt AC 1 ms 256 KB
in9.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB
s3.txt AC 1 ms 256 KB