Submission #3458257

---

Source Code Expand

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

#define rep(i, n) REP(i, 0, n)
#define REP(i, k, n) for(auto i = k; i != n; i++)
#define rrep(i, n) RREP(i, n, 0)
#define RREP(i, n, k) for(auto i = n; i != k; i--)
#define all(x, r) (x), (x)+(r)
#define ALL(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << " " << x << endl
#define exst(x, data) (data).find(x) != (data).end()
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define np next_permutation
#define b32 bitset<32>

using ll = long long;
using Pii = pair<int,int>;
using Tiii = tuple<int, int, int>;
template<class T>using V = vector<T>;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    string X; cin >> X;
    int ans = 0;
    int len = X.size();

    int r = 0;
    rep(i,len) {
        if(X[i] == 'T') {
            if(r == 0) ans++;
            r = max(0, r-1);
        } else r++;
    }

    ans += r;
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result