Codigos/1153C.cpp at master · tfarnecim/Codigos · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
#include <bits/stdc++.h>
using namespace std;

int main(){

	int n;

	cin >> n;

	string s;

	cin >> s;

	if(n%2!=0){
		cout << ":(\n";
		return 0;
	}

	int a=n/2;
	int f=n/2;

	for(int i=0;i<s.length();i++){
		if(s[i]=='('){
			a--;
		}else if(s[i]==')'){
			f--;
		}
	}

	if(a<0 || f<0){
		cout << ":(\n";
		return 0;
	}

	for(int i=0;i<n;i++){
		if(s[i]=='?'){
			if(a>0){
				a--;
				s[i] = '(';
			}else{
				f--;
				s[i] = ')';
			}
		}
	}

	vector <int> stack;

	for(int i=1;i<n-1;i++){

		stack.push_back(s[i]);

		int t = stack.size();

		if(t > 1 && stack[t-1]==')' && stack[t-2]=='('){
			stack.pop_back();
			stack.pop_back();
		}

		t = stack.size();

		if(t==1 && stack[0]==')'){
			cout << ":(\n";
			return 0;
		}

	}

	if(stack.size()>0){
		cout << ":(\n";
		return 0;
	}

	if(s[0]=='(' && s[n-1]==')'){
		cout << s << endl;
		return 0;
	}

	cout << ":(\n" << endl;

	return 0;
}