#949090 (C++23) No.2623 Room Allocation

• 問題: No.2623 Room Allocation
• ユーザー: Kude
• 提出日時: 2024-02-09 21:41:13
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 50 ms / 2,000 ms
• コード長: 1,445 bytes
• コンパイル時間: 3,361 ms
• コンパイル使用メモリ: 282,208 KB
• 実行使用メモリ: 7,036 KB
• 最終ジャッジ日時: 2024-02-09 21:41:19
• 合計ジャッジ時間: 5,307 ms
• ジャッジサーバーID （参考情報）: judge13 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,676 KB
testcase_01	AC	1 ms; 6,676 KB
testcase_02	AC	2 ms; 6,676 KB
testcase_03	AC	1 ms; 6,676 KB
testcase_04	AC	2 ms; 6,676 KB
testcase_05	AC	2 ms; 6,676 KB
testcase_06	AC	20 ms; 6,676 KB
testcase_07	AC	19 ms; 6,676 KB
testcase_08	AC	19 ms; 6,676 KB
testcase_09	AC	19 ms; 6,676 KB
testcase_10	AC	1 ms; 6,676 KB
testcase_11	AC	2 ms; 6,676 KB
testcase_12	AC	2 ms; 6,676 KB
testcase_13	AC	5 ms; 6,676 KB
testcase_14	AC	39 ms; 7,036 KB
testcase_15	AC	29 ms; 6,676 KB
testcase_16	AC	9 ms; 6,676 KB
testcase_17	AC	2 ms; 6,676 KB
testcase_18	AC	30 ms; 6,676 KB
testcase_19	AC	29 ms; 6,676 KB
testcase_20	AC	30 ms; 6,676 KB
testcase_21	AC	30 ms; 6,676 KB
testcase_22	AC	23 ms; 6,676 KB
testcase_23	AC	14 ms; 6,676 KB
testcase_24	AC	29 ms; 6,676 KB
testcase_25	AC	24 ms; 6,676 KB
testcase_26	AC	4 ms; 6,676 KB
testcase_27	AC	49 ms; 7,036 KB
testcase_28	AC	18 ms; 6,676 KB
testcase_29	AC	9 ms; 6,676 KB
testcase_30	AC	50 ms; 7,036 KB
testcase_31	AC	4 ms; 6,676 KB
testcase_32	AC	4 ms; 6,676 KB

ソースコード

#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, x, y;
  cin >> n >> x >> y;
  vector<P> d(n);
  rep(i, n) {
    int p;
    char c;
    cin >> p >> c;
    d[i] = P(p, c == 'A');
  }
  int period = x + y;
  VL diff;
  ll ans = 0;
  rep(s, period) {
    if (s >= n) break;
    ll ca = 0, cb = 0;
    for (int i = s; i < n; i += period) {
      (d[i].second ? ca : cb) += d[i].first;
    }
    ans += ca;
    diff.emplace_back(cb - ca);
  }
  sort(rall(diff));
  int must = max<int>(0, ssize(diff) - x);
  int can = y;
  for (ll x : diff) {
    if (must) {
      ans += x;
      must--;
      can--;
    } else if (can && x > 0) {
      ans += x;
      can--;
    }
  }
  cout << ans << '\n';
}