2520 vector<problem> problems(m);
2521 map<pair<int, char>,
int> noe;
2523 for(
int i = 0; i < m; i++) {
2527 p.
ca = unordered_set<char>();
2528 for(
int j = 0; j < p.
noca; j++) {
2536 for(
int i = 0; i < n; i++) {
2538 for(
int j = 0; j < m; j++) {
2539 unordered_set<char> as;
2544 for(
int k = 0; k < noa; k++) {
2548 if(!problems[j].ca.contains(a)) {
2549 noe[make_pair(problems[j].
id, a)]++;
2550 max_cnt = max(max_cnt, noe[make_pair(problems[j].
id, a)]);
2555 for(
auto a: problems[j].ca) {
2556 if(!as.contains(a)) {
2557 noe[make_pair(problems[j].
id, a)]++;
2558 max_cnt = max(max_cnt, noe[make_pair(problems[j].
id, a)]);
2564 if(noa == problems[j].noca) {
2565 score += problems[j].score;
2567 score +=
static_cast<double>(problems[j].score) / 2;
2570 cout << fixed << setprecision(1) << score << endl;
2573 cout <<
"Too simple";
2575 for(
const auto &[k, cnt]: noe) {
2576 if(cnt == max_cnt) {
2577 const auto &[id, a] = k;
2578 cout << cnt <<
' ' <<
id <<
'-' << a << endl;
unordered_set< char > ca
正确选项