#include <bits/stdc++.h>
using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;
// using i128 = __int128;
// using u128 = unsigned __int128;
const int N = 1e5 + 5, M = 805;
int n, m;
double p[N], p1[M][25], p2[M][25], p3[M][25];
int a[N][25];
std::string name[3] = {"rock", "paper", "scissors"};
int win[3][3] = {
{0, -1, 1},
{1, 0, -1},
{-1, 1, 0}
};
inline int qpow(int a, int b) {
int res = 1;
while (b) {
if (b & 1) (res *= a);
(a *= a);
b >>= 1;
}
return res;
}
inline std::vector<int> rebuild(int S, int mm = -1) {
std::vector<int> nw;
while (S || nw.size() < mm) {
nw.push_back(S % 3);
S /= 3;
}
std::reverse(nw.begin(), nw.end());
return nw;
}
const double eps = 1e-6;
int main() {
std::ios::sync_with_stdio(0);
std::cin.tie(0), std::cout.tie(0);
std::cin >> n >> m;
for (int i = 1; i <= n; i++) {
std::cin >> p[i];
std::string s;
for (int j = 0; j < m; j++) {
std::cin >> s;
if (s == "rock") {
a[i][j] = 0;
} else if (s == "paper") {
a[i][j] = 1;
} else {
a[i][j] = 2;
}
}
}
int m1 = m / 3, m2 = m / 3, m3 = m / 3;
if (m % 3 == 2) {
m2++, m3++;
} else if (m % 3 == 1) {
m3++;
}
int up1 = qpow(3, m1), up2 = qpow(3, m2), up3 = qpow(3, m2);
for (int i = 0; i < up1; i++) {
auto now = rebuild(i, m1);
for (int j = 1; j <= n; j++) {
int c = 0;
for (int k = 0; k < m1; k++) {
c += win[now[k]][a[j][k]];
}
p1[i][c + m1] += p[j];
}
}
for (int i = 0; i < up2; i++) {
auto now = rebuild(i, m2);
for (int j = 1; j <= n; j++) {
int c = 0;
for (int k = 0, kk = m1; k < m2; k++, kk++) {
c += win[now[k]][a[j][kk]];
}
p2[i][c + m2] += p[j];
}
}
for (int i = 0; i < up3; i++) {
auto now = rebuild(i, m3);
for (int j = 1; j <= n; j++) {
int c = 0;
for (int k = 0, kk = m1 + m2; k < m3; k++, kk++) {
c += win[now[k]][a[j][kk]];
}
p3[i][c + m3] += p[j];
}
}
double ans = 0;
int a1 = 0, a2 = 0, a3 = 0, s1 = 0, s2 = 0, s3 = 0;
for (int i = 0; i < up1; i++) {
for (int j = 0; j < up2; j++) {
for (int k = 0; k < up3; k++) {
double pp = 0;
for (int w1 = 0; w1 <= 2 * m1; w1++) {
for (int w2 = 0; w2 <= 2 * m2; w2++) {
for (int w3 = 0; w3 <= 2 * m3; w3++) {
if (w1 + w2 + w3 >= m) {
pp += p1[i][w1] * p2[j][w2] * p3[k][w3];
// if(i == 0 && j == 0 && k == 0) {
// std::cerr << "HI: " << w1 << ' ' << w2 << ' ' << w3 << '\n' << p1[i][w1] << ' '<< p2[j][w2] << ' ' << p3[k][w3] << "\ned\n";
// }
}
}
}
}
if (pp - ans > eps) {
ans = pp;
a1 = i, a2 = j, a3 = k;
// std::cerr << pp << ' ' << ans << ' ' << i << ' ' << j << ' ' << k << '\n';
} else if (abs(pp - ans) <= eps) {
if (a1 > i) {
a1 = i, a2 = j, a3 = k;
} else if (a1 == i && a2 > j) {
a1 = i, a2 = j, a3 = k;
} else if (a1 == i && a2 == j && a3 > k) {
a1 = i, a2 = j, a3 = k;
}
}
}
}
}
std::cout << std::fixed << std::setprecision(6) << ans << "\n";
auto tp = rebuild(a1, m1);
for (auto v : tp) {
std::cout << name[v] << ' ';
}
tp = rebuild(a2, m2);
for (auto v : tp) {
std::cout << name[v] << ' ';
}
tp = rebuild(a3, m3);
for (auto v : tp) {
std::cout << name[v] << ' ';
}
return 0;
}
Copy