Submission #10074747

---

Source Code Expand

#include <bits/stdc++.h>

#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define uniq(x) x.erase(unique(x.begin(), x.end()), x.end())
#define F first
#define S second
#define mp make_pair
#define eb emplace_back
#define pii pair<int, int>
#define pll pair<ll, ll>

using namespace std;

typedef long long ll;

/* --- INFやMODの値が適切か確認する --- */
// const int INF = 1 << 30;
// const ll INF = 1LL << 60;
// const ll MOD = 1000000007;

int main() {
  int a, b, n;
  cin >> a >> b >> n;
  string x;
  cin >> x;
  rep(i, n) {
    if (x[i] == 'S') {
      if (a > 0) a--;
    }
    if (x[i] == 'C') {
      if (b > 0) b--;
    }
    if (x[i] == 'E') {
      if (a > 0 && a >= b)
        a--;
      else if (b > 0 && a < b)
        b--;
    }
  }

  cout << a << endl;
  cout << b << endl;
}

Submission Info

Judge Result