Submission #1344933

---

Source Code Expand

#include <iostream> 
#include <string> 
#include <vector> 
#include <cmath> 
#include <algorithm> 
#include <cstdlib> 
#include <ctime> 
#include <cstdio> 
#include <functional> 
#include <set> 
#include <sstream> 
#include <cctype>
#include <stack>
#include <queue>
#include <cstring>
#include <map>
#include <deque>
 
using namespace std; 

int gcd(int x,int y){
	return y==0?x:gcd(y,x%y);
}

pair<bool,int> is_valid(deque<char> &d){
    int cnt=0;
    for(int i=0;i<d.size();i++){
        if(d[i]=='(') cnt++;
        else if(cnt<1) return make_pair(false,0);
        else cnt--;
    }
    return make_pair(cnt==0,d.size());
}

int main(){

    int n;
    string s;
    cin>>n>>s;

    deque<char> d;
    for(int i=0;i<n;i++) d.push_back(s[i]);

/*
    auto pos=is_valid(d);
    if(pos.second!=d.size())d.insert(d.begin()+pos.second,'(');
    else d.push_back(')');
    for(int i=0;i<d.size();i++) cout<<d[i];
    cout<<endl;

    return 0;
*/

    int res=0;
    while(true){
        auto p=is_valid(d);
        if(p.first) break;

        res++;
        if(p.second!=d.size())d.insert(d.begin()+p.second,'(');
        else d.push_back(')');
    }

    for(int i=0;i<d.size();i++) cout<<d[i];
    cout<<endl;

	return 0;
}

Submission Info

Judge Result