Submission #1341329

---

Source Code Expand

#include<vector>
#include<cmath>
#include<map>
#include<cstdlib>
#include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<set>
#include<stack>
#include<bitset>
#include<functional>
#include<ctime>
#include<queue>
#include<deque>
#include<complex>
#include<cassert>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long lint;
typedef complex<double> P;
#define mp make_pair
#define fi first
#define se second
typedef pair<int,int> pint;
#define All(s) s.begin(),s.end()
#define rAll(s) s.rbegin(),s.rend()
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
bool ch(string s){
	int x=0;
	rep(i,s.size()){
		if(s[i]=='(') x++;else x--;
		if(x<0) return false;
	}
	return (x==0);
}
int main()
{
	int n,x=0;string s;cin>>n;
	cin>>s;
	rep(i,s.size()){
		if(s[i]=='(') x++;else x--;
	}
	if(x<0){
		rep(i,-x){
			s="("+s;
				//cout<<s<<endl;
		}
	}
		else if(x>0){
			rep(i,x) s+=")";
	}
	//cout<<s<<endl;
	while(!ch(s)) s="("+s+")";
	cout<<s<<endl;
}

Submission Info

Judge Result