結果

問題 No.2623 Room Allocation
ユーザー miscalcmiscalc
提出日時 2024-02-10 00:59:57
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 130 ms / 2,000 ms
コード長 3,085 bytes
コンパイル時間 5,497 ms
コンパイル使用メモリ 315,660 KB
実行使用メモリ 14,432 KB
最終ジャッジ日時 2024-09-28 16:49:01
合計ジャッジ時間 7,759 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;}
ll divfloor(ll A, ll B) {if (B < 0) A = -A, B = -B; return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) A = -A, B = -B; return divfloor(A + B - 1, B);}
ll pow_ll(ll A, ll B) {if (A == 0 || A == 1) {return A;} if (A == -1) {return B & 1 ? -1 : 1;} ll res = 1; for (int i = 0; i < B; i++) {res *= A;} return res;}
ll mul_limited(ll A, ll B, ll M = INF) { return B == 0 ? 0 : A > M / B ? M : A * B; }
ll pow_limited(ll A, ll B, ll M = INF) { if (A == 0 || A == 1) {return A;} ll res = 1; for (int i = 0; i < B; i++) {if (res > M / A) return M; res *= A;} return res;}
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
//*
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
template <class T, internal::is_static_modint_t<T> * = nullptr>
istream &operator>>(istream &is, T &a) { ll v; is >> v; a = v; return is; }
template <class T, internal::is_dynamic_modint_t<T> * = nullptr>
istream &operator>>(istream &is, T &a) { ll v; is >> v; a = v; return is; }
template <class T, internal::is_static_modint_t<T> * = nullptr>
ostream &operator<<(ostream &os, const T &a) { os << a.val(); return os; }
template <class T, internal::is_dynamic_modint_t<T> * = nullptr>
ostream &operator<<(ostream &os, const T &a) { os << a.val(); return os; }
//*/
template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " "); cout << '\n';}
template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}

int main()
{
  ll N, X, Y;
  cin >> N >> X >> Y;
  vector<ll> P(N);
  vector<char> C(N);
  for (ll i = 0; i < N; i++)
  {
    cin >> P.at(i) >> C.at(i);
  }

  vector<ll> A(X + Y, 0), B(X + Y, 0);
  for (ll i = 0; i < N; i++)
  {
    if (C.at(i) == 'A') A.at(i % (X + Y)) += P.at(i);
    else B.at(i % (X + Y)) += P.at(i);
  }
  vector<ll> ord(X + Y);
  for (ll i = 0; i < X + Y; i++)
  {
    ord.at(i) = i;
  }
  sort(ord.begin(), ord.end(), [&](ll i, ll j){return A.at(i) - B.at(i) > A.at(j) - B.at(j);});
  ll ans = 0;
  for (ll i = 0; i < X; i++)
  {
    ll j = ord.at(i);
    ans += A.at(j);
  }
  for (ll i = X; i < X + Y; i++)
  {
    ll j = ord.at(i);
    ans += B.at(j);
  }
  cout << ans << endl;
}
0