Submission #1340463


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%d",&x)
#define slld(x) scanf("%lld",&x)
#define ss(x) scanf("%s",x)
#define mod 1000000007
#define bitcount __builtin_popcountll
#define ll long long
#define pb push_back
#define pi pair<int,int>
#define pii pair<pi,int>
#define mp make_pair
int main()
{
	int i,j,k;
	int n;
	string s;
	cin>>n>>s;
	stack<char>st;
	int temp=0;
	for(i=0;i<s.size();i++)
	{
		if(s[i]=='(')
			st.push(s[i]);
		else
		{
			if(st.size()>0)
				st.pop();
			else
			{
				temp++;
			}
		}
	}
	while(!st.empty())
	{
		st.pop();
		s+=')';
	}
	while(temp--)
	{
		s='('+s;
	}
	cout<<s<<endl;
	return 0;
}

Submission Info

Submission Time
Task D - Insertion
User bharatkhanna1995
Language C++14 (GCC 5.4.1)
Score 400
Code Size 690 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