Submission #1481022


Source Code Expand

#include <bits/stdc++.h>

#define FI(i,a,b) for(int i=(a);i<=(b);i++)
#define FD(i,a,b) for(int i=(a);i>=(b);i--)

#define LL long long
#define Ldouble long double
#define PI 3.14159265358979323846264338327950288419

#define PII pair<int,int>
#define PLL pair<LL,LL>
#define mp make_pair
#define fi first
#define se second

using namespace std;

char s[200005], stk[200005];
int len, p;

int main(){
	cin.getline(s, 200005);
	len = strlen(s);
	FI(i, 0, len - 1){
		if(s[i] == 'S') stk[++p] = 'S';
		else if(p > 0 && stk[p] == 'S') p--;
		else stk[++p] = 'T';
	}
	printf("%d\n", p);
	return 0;
}

Submission Info

Submission Time
Task A - STring
User alex20030190
Language C++14 (GCC 5.4.1)
Score 300
Code Size 626 Byte
Status AC
Exec Time 8 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 7 ms 512 KB
corner1 AC 7 ms 640 KB
corner2 AC 7 ms 512 KB
example0 AC 1 ms 256 KB
example1 AC 1 ms 256 KB
example2 AC 1 ms 256 KB
handmade0 AC 1 ms 256 KB
handmade1 AC 1 ms 256 KB
maxrand0 AC 8 ms 384 KB
sub_corner0 AC 1 ms 256 KB
sub_corner1 AC 1 ms 256 KB
sub_corner2 AC 1 ms 256 KB
sub_rand0 AC 1 ms 256 KB