-
Notifications
You must be signed in to change notification settings - Fork 24
/
DoubleRoshambo.cpp
56 lines (50 loc) · 1.68 KB
/
DoubleRoshambo.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
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
class DoubleRoshambo {
public:
int maxScore(vector <string> a, vector <string> b) {
char w[256];
memset(w, 0, sizeof(w));
w['R'] = 'P';
w['S'] = 'R';
w['P'] = 'S';
vector<string> aa;
vector<string> bb;
int ret = 0;
int flag = true;
while (flag) {
flag = false;
for (vector<string>::iterator i = b.begin(); i != b.end(); ++i) {
for (vector<string>::iterator j = a.begin(); j != a.end(); ++j) {
if ((*j)[0] == w[(*i)[0]] && (*j)[1] == w[(*i)[1]]) {
ret += 2;
flag = true;
a.erase(j);
b.erase(i);
break;
}
}
if (flag) break;
}
}
flag = true;
while (flag) {
flag = false;
for (vector<string>::iterator i = b.begin(); i != b.end(); ++i) {
for (vector<string>::iterator j = a.begin(); j != a.end(); ++j) {
if ((*j)[0] == (*i)[0] && (*j)[1] == w[(*i)[1]]) {
ret += 1;
flag = true;
a.erase(j);
b.erase(i);
break;
}
}
if (flag) break;
}
}
return ret;
}
};