Submission #916174


Source Code Expand

#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
using namespace std;
typedef pair<int, int> P;

signed main(){
    string s;
	cin >> s;
	int t = 0, c = 0;
	rep(i, 0, s.size()){
		if(s[i] == 'T'){
			if(t <= 0) c++;
			else t--;
		}
		if(s[i] == 'S') t++;
	}
	cout << 2 * c << endl;
}

Submission Info

Submission Time
Task A - STring
User treeone
Language C++14 (GCC 5.4.1)
Score 300
Code Size 434 Byte
Status AC
Exec Time 10 ms
Memory 640 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 200 / 200 100 / 100
Status
AC × 3
AC × 9
AC × 13
Set Name Test Cases
Sample example0, example1, example2
Subtask1 example0, example1, example2, sub_corner0, sub_corner1, sub_corner2, sub_rand0, handmade0, handmade1
All corner0, corner1, corner2, example0, example1, example2, handmade0, handmade1, maxrand0, sub_corner0, sub_corner1, sub_corner2, sub_rand0
Case Name Status Exec Time Memory
corner0 AC 9 ms 640 KB
corner1 AC 9 ms 640 KB
corner2 AC 10 ms 640 KB
example0 AC 3 ms 256 KB
example1 AC 2 ms 256 KB
example2 AC 3 ms 256 KB
handmade0 AC 3 ms 256 KB
handmade1 AC 2 ms 256 KB
maxrand0 AC 10 ms 640 KB
sub_corner0 AC 3 ms 256 KB
sub_corner1 AC 2 ms 256 KB
sub_corner2 AC 2 ms 256 KB
sub_rand0 AC 2 ms 256 KB