-
Notifications
You must be signed in to change notification settings - Fork 0
/
9012.cpp
89 lines (71 loc) · 1.1 KB
/
9012.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
82
83
84
85
86
87
88
89
#include <iostream>
#include <stack>
#include <vector>
using namespace std;
int main()
{
stack<char> data_stack; // 괄호 정보를 입력
int T; // 입력 case 수
char in_data[50];
bool isVPS = true; // VPS 체크
int point = 0;
int open_cnt = 0; // ( 의 수
int close_cnt = 0; // ) 의 수;
cin >> T;
for (int i = 0; i < T; i++)
{
cin >> in_data;
isVPS = true;
point = 0;
open_cnt = 0;
close_cnt = 0;
while (false == data_stack.empty())
{
data_stack.pop();
}
while (true)
{
if (in_data[point] == '(')
{
data_stack.push(in_data[point]);
open_cnt++;
}
else if (in_data[point] == ')')
{
close_cnt++;
if (data_stack.size() == 0)
{
isVPS = false;
break;
}
if (data_stack.size() != 0)
{
if (data_stack.top() == '(')
{
data_stack.pop();
}
else
{
isVPS = false;
}
}
}
else
break;
point++;
}
if (open_cnt != close_cnt)
{
cout << "NO" << endl;
}
else if (isVPS == true)
{
cout << "YES" << endl;
}
else
{
cout << "NO" << endl;
}
}
return 0;
}