Submission #2243587

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <limits>
#include <map>
#include <stack>
#include <unordered_map>
#define REP(i,n) for(long (i)=0;(i)<(n);(i)++)
#define REPI(i,a,b) for(long (i)=(a);(i)<(b);(i)++)
#define INF numeric_limits<double>::infinity()
constexpr long MOD = 1e9 + 7;
using namespace std;
using P = pair<long, long>;
using VI = vector<long>;

int main() {
    string s;
    cin >> s;
    stack<char> st;
    
    REP(i,s.size()) {
        if (s[i] == 'T') {
            if (!st.empty() && st.top() == 'S') {
                st.pop();
            } else {
                st.push('T');
            }
        } else {
            st.push('S');
        }
    }
    cout << st.size() << endl;
}

Submission Info

Judge Result