forked from daiwb/Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path54.cpp
More file actions
216 lines (187 loc) · 4.09 KB
/
54.cpp
File metadata and controls
216 lines (187 loc) · 4.09 KB
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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
#include <iostream>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <vector>
#include <deque>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(a);i>=(b);--i)
typedef long long LL;
vector<string> split( const string& s, const string& delim =" " ) {
vector<string> res;
string t;
for ( int i = 0 ; i != s.size() ; i++ ) {
if ( delim.find( s[i] ) != string::npos ) {
if ( !t.empty() ) {
res.push_back( t );
t = "";
}
} else {
t += s[i];
}
}
if (!t.empty() ) {
res.push_back(t);
}
return res;
}
vector<int> splitInt( const string& s, const string& delim =" " ) {
vector<string> tok = split( s, delim );
vector<int> res;
for ( int i = 0 ; i != tok.size(); i++ )
res.push_back( atoi( tok[i].c_str() ) );
return res;
}
LL gcd(LL a,LL b){
return b?gcd(b,a%b):a;
}
inline LL lcm(LL a,LL b){
return a/gcd(a,b)*b;
}
int s2i(string s) {
stringstream ss;
ss << s;
int res;
ss >> res;
return res;
}
string i2s(int n) {
stringstream ss;
ss << n;
string res;
ss >> res;
return res;
}
map<char, int> mp;
void init() {
mp['2'] = 2;
mp['3'] = 3;
mp['4'] = 4;
mp['5'] = 5;
mp['6'] = 6;
mp['7'] = 7;
mp['8'] = 8;
mp['9'] = 9;
mp['T'] = 10;
mp['J'] = 11;
mp['Q'] = 12;
mp['K'] = 13;
mp['A'] = 14;
}
class state {
public:
string val;
state() {};
bool operator<(const state& rhs) const {
int a = mp[val[0]], b = mp[rhs.val[0]];
if (a != b) return a < b;
return val[1] < rhs.val[1];
}
};
vector<string> p1(5);
vector<string> p2(5);
vector<state> tmp(5);
int getVal(vector<string> mm) {
bool flag = true;
REP(i,5) {
if (mp[mm[i][0]] != 10 + i) {
flag = false;
break;
}
}
if (flag) {
FOR(i,1,4) {
if (mm[i][1] != mm[0][1]) {
flag = false;
break;
}
}
}
if (flag) return 100000;
flag = true;
FOR(i,1,4) {
if (mp[mm[i][0]] != mp[mm[i - 1][0]] + 1) {
flag = false;
break;
}
}
if (flag) {
FOR(i,1,4) {
if (mm[i][1] != mm[0][1]) {
flag = false;
break;
}
}
}
if (flag) return 90000 + mp[mm[0][0]];
if (mm[0][0] == mm[3][0] || mm[1][0] == mm[4][0]) return 80000 + mp[mm[1][0]];
if (mm[0][0] == mm[1][0] && mm[3][0] == mm[4][0] && (mm[2][0] == mm[1][0] || mm[2][0] == mm[3][0])) {
if (mm[2][0] == mm[1][0]) return 70000 + mp[mm[1][0]] * 100 + mp[mm[3][0]];
else return 70000 + mp[mm[3][0]] * 100 + mp[mm[1][0]];
}
flag = true;
FOR(i,1,4) {
if (mm[i][1] != mm[0][1]) {
flag = false;
break;
}
}
if (flag) return 60000;
flag = true;
FOR(i,1,4) {
if (mp[mm[i][0]] != mp[mm[i - 1][0]] + 1) {
flag = false;
break;
}
}
if (flag) return 50000 + mp[mm[0][0]];
if (mm[0][0] == mm[2][0]) return 40000 + mp[mm[0][0]];
if (mm[1][0] == mm[3][0]) return 40000 + mp[mm[1][0]];
if (mm[2][0] == mm[4][0]) return 40000 + mp[mm[2][0]];
if (mm[0][0] == mm[1][0] && (mm[2][0] == mm[3][0] || mm[3][0] == mm[4][0])) return 30000 + mp[mm[3][0]] * 100 + mp[mm[0][0]];
if (mm[1][0] == mm[2][0] && mm[3][0] == mm[4][0]) return 30000 + mp[mm[3][0]] * 100 + mp[mm[1][0]];
FOR(i,1,4) {
if (mm[i][0] == mm[i - 1][0]) return 20000 + mp[mm[i][0]];
}
return 10000;
}
bool cmp(vector<string> p1, vector<string> p2) {
//REP(i,5) cout << p1[i] << " ";
//int v1 = getVal(p1), v2 = getVal(p2);
//cout << v1 << " - " << v2 << " ";
//REP(i,5) cout << p2[i] << " ";
//cout << endl;
if (v1 != v2) return v1 < v2;
RFOR(i,4,0) {
v1 = mp[p1[i][0]], v2 = mp[p2[i][0]];
if (v1 != v2) return v1 < v2;
}
return true;
}
void run() {
init();
int win = 0;
REP(i,1000) {
REP(j,5) cin >> tmp[j].val;
sort(tmp.begin(), tmp.end());
REP(j,5) p1[j] = tmp[j].val;
REP(j,5) cin >> tmp[j].val;
sort(tmp.begin(), tmp.end());
REP(j,5) p2[j] = tmp[j].val;
if (!cmp(p1, p2)) {
++win;
cout << "win" << endl;
} else {
cout << "lose" << endl;
}
}
cout << win << endl;
}
int main() {
run();
}