-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathday10b.cpp
63 lines (62 loc) · 1.6 KB
/
day10b.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
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
vector<long long> pointsList;
while (cin >> s)
{
long long points = 0;
char curr;
stack<char> stk;
bool complete = true;
for (auto x : s)
{
if (x == '(' || x == '[' || x == '{' || x == '<')
stk.push(x);
else if (x == ')' && stk.top() == '(')
stk.pop();
else if (x == ']' && stk.top() == '[')
stk.pop();
else if (x == '}' && stk.top() == '{')
stk.pop();
else if (x == '>' && stk.top() == '<')
stk.pop();
else
{
complete = false;
break;
}
}
if (complete)
{
while (!stk.empty())
{
if (stk.top() == '(')
{
points *= 5;
points += 1;
}
else if (stk.top() == '[')
{
points *= 5;
points += 2;
}
else if (stk.top() == '{')
{
points *= 5;
points += 3;
}
else if (stk.top() == '<')
{
points *= 5;
points += 4;
}
stk.pop();
}
pointsList.push_back(points);
}
}
sort(pointsList.begin(), pointsList.end());
cout << pointsList[pointsList.size() / 2];
}