题解归档 - cf104077F

本文由 cf-code 本地题解库自动归档；公开内容以本地 AC/验证版本为准。

• 本地编号：cf104077F
• 本地来源：problems/cf104077F/idea.md
• 题目链接：https://codeforces.com/gym/104077/problem/F
• 原始标题：F - Hotel

思路

F - Hotel

Teams are independent. A double room can contain at most two contestants; if it contains two,
they must be from the same team and have the same gender. A double room may also be used by just
one contestant.

For one team:

• putting everyone alone costs 3*min(c1,c2);
• if any two letters are equal, one valid pair in a double room plus one solo room costs
  c2 + min(c1,c2).

Take the cheaper valid option for every team and sum.

代码

来源：problems/cf104077F/solution.cpp

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    ll c1, c2;
    cin >> n >> c1 >> c2;
    ll ans = 0;
    ll solo = min(c1, c2);
    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;
        bool pairable = s[0] == s[1] || s[0] == s[2] || s[1] == s[2];
        ll cur = 3 * solo;
        if (pairable) cur = min(cur, c2 + solo);
        ans += cur;
    }
    cout << ans << '\n';
    return 0;
}