-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathResistance.cpp
203 lines (177 loc) · 4.98 KB
/
Resistance.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
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
// BEGIN CUT HERE
/*
TCO18 R1A Medium (500)
問題
-P人のプレーヤーがいる
-そのうちS人はスパイである
-P人のうち何人かが参加してミッションを行う
-スパイが参加するミッションは失敗する可能性がある
-N個のミッションについて、各人が参加したかどうかと、成功したかどうかの記録が与えられる
-ミッションの記録が正しい場合、各人がスパイである確率を求めよ
*/
// END CUT HERE
#include <algorithm>
#include <string>
#include <vector>
#include <iostream>
#include <sstream>
#include <cstring>
using namespace std;
static inline int popcount(unsigned int b)
{
#ifdef __GNUC__
return __builtin_popcount(b);
#elif _MSC_VER >= 1400
return __popcnt(b);
#else
b = (b & 0x55555555) + (b >> 1 & 0x55555555);
b = (b & 0x33333333) + (b >> 2 & 0x33333333);
b = (b & 0x0F0F0F0F) + (b >> 4 & 0x0F0F0F0F);
b += b >> 8;
b += b >> 16;
return b & 0x3F;
#endif
}
class Resistance {
public:
vector <double> spyProbability(int P, int S, vector <string> missions) {
int m = (int)missions.size();
int bm = 1 << P;
int vc = 0;
int scnt[10] = {};
for (int b = 0; b < bm; ++b) {
if (popcount(b) == S) {
bool valid = true;
for (int i = 0; i < m; ++i) {
if (missions[i][0] == 'F') {
bool ok = false;
for (int j = 0; j < P; ++j) {
if (missions[i][j+1] == '1' && (((1 << j) & b) != 0)) {
ok = true;
break;
}
}
if (!ok) {
valid = false;
break;
}
}
}
if (valid) {
++vc;
for (int j = 0; j < P; ++j) {
for (int i = 0; i < m; ++i) {
if ((((1 << j) & b) != 0)) {
scnt[j]++;
break;
}
}
}
}
}
}
vector <double> ans;
if (vc) {
for (int j = 0; j < P; ++j) {
ans.push_back((1.0 * scnt[j]) / vc);
}
}
return ans;
}
// BEGIN CUT HERE
private:
template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); }
void verify_case(int Case, const vector <double> &Expected, const vector <double> &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: " << print_array(Expected) << endl; cerr << "\tReceived: " << print_array(Received) << endl; } }
public:
void run_test(int Case) {
int n = 0;
// test_case_0
if ((Case == -1) || (Case == n)){
int Arg0 = 4;
int Arg1 = 1;
string Arr2[] = {"S0110",
"F1100",
"S0011"};
double Arr3[] = {0.5, 0.5, 0.0, 0.0 };
vector <string> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0])));
vector <double> Arg3(Arr3, Arr3 + (sizeof(Arr3) / sizeof(Arr3[0])));
verify_case(n, Arg3, spyProbability(Arg0, Arg1, Arg2));
}
n++;
// test_case_1
if ((Case == -1) || (Case == n)){
int Arg0 = 4;
int Arg1 = 2;
string Arr2[] = {"F0100",
"S0101",
"F1010",
"S1011"};
double Arr3[] = {0.5, 1.0, 0.5, 0.0 };
vector <string> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0])));
vector <double> Arg3(Arr3, Arr3 + (sizeof(Arr3) / sizeof(Arr3[0])));
verify_case(n, Arg3, spyProbability(Arg0, Arg1, Arg2));
}
n++;
// test_case_2
if ((Case == -1) || (Case == n)){
int Arg0 = 3;
int Arg1 = 1;
string Arr2[] = {"F110",
"F101",
"F011"};
// double Arr3[] = { };
vector <string> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0])));
vector <double> Arg3;
verify_case(n, Arg3, spyProbability(Arg0, Arg1, Arg2));
}
n++;
// test_case_3
if ((Case == -1) || (Case == n)){
int Arg0 = 5;
int Arg1 = 2;
string Arr2[] = {"F11000",
"S00011",
"F10100",
"S01111"};
double Arr3[] = {0.8, 0.4, 0.4, 0.2, 0.2 };
vector <string> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0])));
vector <double> Arg3(Arr3, Arr3 + (sizeof(Arr3) / sizeof(Arr3[0])));
verify_case(n, Arg3, spyProbability(Arg0, Arg1, Arg2));
}
n++;
// test_case_4
if ((Case == -1) || (Case == n)){
int Arg0 = 9;
int Arg1 = 3;
string Arr2[] = {"S100001100",
"F011110000",
"F001000010",
"F100010101",
"S010010001",
"F100001010",
"F000100100"};
double Arr3[] = {0.3, 0.1, 0.4, 0.5, 0.2, 0.1, 0.6, 0.7, 0.1 };
vector <string> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0])));
vector <double> Arg3(Arr3, Arr3 + (sizeof(Arr3) / sizeof(Arr3[0])));
verify_case(n, Arg3, spyProbability(Arg0, Arg1, Arg2));
}
n++;
if ((Case == -1) || (Case == n)) {
int Arg0 = 5;
int Arg1 = 2;
string Arr2[] = { "S100001100" };
double Arr3[] = { 0.4, 0.4, 0.4, 0.4, 0.4 };
vector <string> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0])));
vector <double> Arg3(Arr3, Arr3 + (sizeof(Arr3) / sizeof(Arr3[0])));
verify_case(n, Arg3, spyProbability(Arg0, Arg1, Arg2));
}
n++;
}
// END CUT HERE
};
// BEGIN CUT HERE
int main() {
Resistance ___test;
___test.run_test(-1);
}
// END CUT HERE