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
| #include <string>
#include <vector>
#include <algorithm>
using namespace std;
char friends1[8] = { 'A', 'C', 'F', 'J', 'M', 'N', 'R', 'T' };
int getidx(char ch, vector<int>& lined)
{
int idx = 0;
int fnd = 0;
for (int i = 0; i < 8; ++i) {
if (friends1[i] == ch) {
fnd = i;
break;
}
}
for (int i = 0; i < 8; ++i) {
if (lined[i] == fnd) {
idx = i;
break;
}
}
return idx;
}
// 전역 변수를 정의할 경우 함수 내에 초기화 코드를 꼭 작성해주세요.
int solution(int n, vector<string> data) {
int answer = 0;
vector<int> lined(8);
for (int i = 0; i < 8; i++)
lined[i] = i;
do {
bool bLined = true;
for (int i = 0; i < data.size(); ++i) {
int fnd1 = getidx(data[i].at(0), lined);
int fnd2 = getidx(data[i].at(2), lined);
char op = data[i].at(3);
int dist = data[i].at(4) - '0' + 1;
if (op == '=') {
if (abs(fnd1 - fnd2) != dist) {
bLined = false;
break;
}
}
else if (op == '>') {
if (abs(fnd1 - fnd2) <= dist) {
bLined = false;
break;
}
}
else if (op == '<') {
if (abs(fnd1 - fnd2) >= dist) {
bLined = false;
break;
}
}
}// end of string check
if (bLined)
answer++;
} while (next_permutation(lined.begin(), lined.end()));
return answer;
}
|