-
Notifications
You must be signed in to change notification settings - Fork 0
/
00551.cpp
81 lines (62 loc) · 1.68 KB
/
00551.cpp
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
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
string temp;
unordered_map<char, bool> op({
{'{', 1},
{'(', 1},
{'[', 1},
{'<', 1},
});
map<char, string> cl({
{'}', "{"},
{')', "("},
{']', "["},
{'>', "<"},
});
string str;
while(getline(cin, str)){
ll res = 0;
string h;
bool found = true;
stack<string> hi;
deque<ll> itr;
ll pos = 1;
for(ll i = 0; str[i]; i++, pos++){ // pisah space
if(str[i] == '(' && str[i+1] && str[i+1] == '*'){
hi.push("(*");
i++;
continue;
}
if(op[str[i]]){
hi.push(string(1, str[i]));
continue;
}
if(str[i] == '*' && str[i+1] && str[i+1] == ')'){
if(hi.empty() || hi.top() != "(*"){
found = false;
break;
}
hi.pop();
i++;
continue;
}
if(cl.find(str[i]) != cl.end()){
if(hi.empty() || hi.top() != cl[str[i]]){
found = false;
break;
}
hi.pop();
continue;
}
}
if(found && hi.empty()) cout << "YES\n";
else cout << "NO " << pos << "\n";
}
return 0;
}