Submission #904296

---

Source Code Expand

#include <string>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <cstring>
#include <numeric>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define F0(i,n) for (int i = 0; i < n; i++)
#define F1(i,n) for (int i = 1; i <= n; i++)
#define CL(a,x) memset(x, a, sizeof(x));
#define SZ(x) ((int)x.size())
const double eps = 1e-10;
const int inf = 1000000009;
int i, j, k, m, n, l;
int ans;

string s;
char st[1000000];
int sn;

int main() {
	//freopen("x.in", "r", stdin);
	cin >> s;
	n = SZ(s);
	sn = 0;
	F0(i, n) {
		if (sn > 0 && st[sn - 1] == 'S' && s[i] == 'T') sn--;
		else st[sn++] = s[i];
	}
	cout << sn << endl;
	return 0;
}

Submission Info

Judge Result