Codeforces Round #551 (Div. 2) C. Serval and Parenthesis Sequence（思维）

							C. Serval and Parenthesis Sequence

time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Serval soon said goodbye to Japari kindergarten, and began his life in Japari Primary School.

In his favorite math class, the teacher taught him the following interesting definitions.

A parenthesis sequence is a string, containing only characters “(” and “)”.

A correct parenthesis sequence is a parenthesis sequence that can be transformed into a correct arithmetic expression by inserting characters “1” and “+” between the original characters of the sequence. For example, parenthesis sequences “()()”, “(())” are correct (the resulting expressions are: “(1+1)+(1+1)”, “((1+1)+1)”), while “)(” and “)” are not. Note that the empty string is a correct parenthesis sequence by definition.

We define that |s|as the length of string s. A strict prefix s[1…l] (1≤l<|s|) of a string s=s1s2…s|s| is string s1s2…sl. Note that the empty string and the whole string are not strict prefixes of any string by the definition.

Having learned these definitions, he comes up with a new problem. He writes down a string s
containing only characters “(”, “)” and “?”. And what he is going to do, is to replace each of the “?” in s

independently by one of “(” and “)” to make all strict prefixes of the new sequence not a correct parenthesis sequence, while the new sequence should be a correct parenthesis sequence.

After all, he is just a primary school student so this problem is too hard for him to solve. As his best friend, can you help him to replace the question marks? If there are many solutions, any of them is acceptable.
Input

The first line contains a single integer |s|(1≤|s|≤3⋅105), the length of the string.

The second line contains a string s, containing only “(”, “)” and “?”.
Output

A single line contains a string representing the answer.

If there are many solutions, any of them is acceptable.

If there is no answer, print a single line containing “?”
（“：（”，这是中文符，英文符就表示成表情。） (without the quotes).
Examples
Input

6
(???

Output

(()())

Input

10
(???(???(?

Output

?

Note

It can be proved that there is no solution for the second sample, so print “?”.
（题意：给你一个带有问号的串，你可以用’('或‘)’来填它，要求构造的串的严格前缀都不是正确的括号表达式，如果可以输出任意一个答案，否则输出“：（”）
（思路：首先，这个串的第一个字符肯定是“（”，最后一个字符肯定是“）”，不然肯定构造不出来。既然他要一个严格前缀都不是的串，那我们就按照他的要求，尽可能的构造一个这样的串。先统计一下“（”的个数，对于问号，如果有剩余的“（”，就把问号填成“（”，否则只能填“）”。（因为，如果有剩余的“（”，但我们不填“（”，而去填“）”的话，很有可能这个“）”就和前面的串组成了一个合法的串。所以，这种构造方法是最优的构造方法。）构造完成后检验一下是不是符合要求的串即可。）

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <vector>
#include <stack>
#define ll long long
using namespace std;
const int N=3e5+10;
char s[N]; 
int main(void)
{
	int n;
	cin>>n;
	scanf("%s",s+1);
	if(n&1||s[1]==')'||s[n]=='(')
	{
		printf(":(\n");
		return 0;
	}
	int l=0,r=0;
	for(int i=1;i<=n;i++)
	{
		if(s[i]=='(')
			l++;
		else if(s[i]==')')
			r++;
	}
	if(l>n/2||r>n/2)
	{
		printf(":(\n");
		return 0;
	}
	l=n/2-l;
	int cl=0;
	for(int i=1;i<=n;i++)
	{
		if(s[i]=='?')
		{
			if(l)
			{
				s[i]='(';
				l--;
				cl++;				
			}
			else
			{
				s[i]=')';
				cl--;
			}
		}
		else if(s[i]=='(')
		{
			cl++;
		}
		else
			cl--;
		if(cl<0)
		{
			printf(":(\n");
			return 0;			
		}
		else if(cl==0&&i!=n)
		{
			printf(":(\n");
			return 0;				
		}	
	}
	printf("%s\n",s+1);
	return 0;	
} 
/*
8
(?())?))
*/