Submission #1455604

---

Source Code Expand

#include <ctime>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
using namespace std;

typedef long long ll;
typedef double lf;
typedef long double Lf;
typedef pair <int,int> pii;
typedef pair <ll, ll> pll;

#define TRACE(x) cerr << #x << "  " << x << endl
#define FOR(i, a, b) for (int i = (a); i < int(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define _ << " " <<

#define fi first
#define sec second
#define mp make_pair

const int MAXN = 200100;

stack <int> s;

string p;

int main() {
	cin >> p;
	REP(i, (int)p.size()) {
		if (s.empty() || s.top() == 'T' || p[i] == 'S') s.push(p[i]);
		else {
			if (s.top() == 'S') {s.pop(); continue;}
			else s.push(p[i]);
		}
	}

	printf("%d\n",(int)s.size());
	return 0;
}

Submission Info

Judge Result