Submission #905114
Source Code Expand
//----->|try=0; while(!success) try++;|<------
//----->|Belief Yourself,Respect Yourself|<----
//----->|Be Proud Of Yourself,You're Doing Your best|<-----
#include<bits/stdc++.h>
using namespace std;
#define uniq(x) x.erase(unique(x.begin(),x.end()), x.end()) //Unique value find from vector
#define upper(arr,n,fixed) upper_bound(arr,arr+n,fixed)-arr //Upper value search;
#define lower(arr,n,fixed) upper_bound(arr,arr+n,fixed)-arr //Lower value search;
#define max3(a,b,c) max(max(a,b),c)//maximum value find three value;
#define min3(a,b,c) min(min(a,b),c)//minimum value find three value;
#define rep(i, n) for(int i = 0; i < n; ++i)
#define REP(i, n) for(int i = 1; i <= n; ++i)
#define rep1(i,start,n) for(int i=start;i<n;++i)
#define PI acos(-1.0)//PI Calculation
#define LL long long
#define AND(a,b) ((a) & (b))
#define OR(a,b) ((a)|(b))
#define XOR(a,b) ((a) ^ (b))
#define MP make_pair
#define sqr(x) ((x)*(x))
#define sqrt(x) sqrt(1.0*(x))
#define INF_MAX 2147483647
#define INF_MIN -2147483647
#define MX 1000005
#define MOD 1000000007
template<typename T> T POW(T b,T p) //Pow calculation
{
T r=1;
while(p) {
if(p&1)r=(r*b);
b=(b*b);
p>>=1;
}
return r;
}
template<typename T> T BigMod(T b,T p,T m) //BigMod Calculation
{
T r=1;
while(p) {
if(p&1)r=(r*b)%m;
b=(b*b)%m;
p>>=1;
}
return r;
}
//||--------------------------->||Main_Code_Start_From_Here||<---------------------------------||
int main()
{
//freopen("a.in", "r", stdin);
//freopen("a.out", "w", stdout);
string s;
while(cin>>s)
{
stack<int>mystack;
for(int i=0;i<s.size();i++)
{
if(!mystack.empty() && s[i]=='T' && mystack.top()=='S')
{
mystack.pop();
}
else
{
mystack.push(s[i]);
// cout<<s[i]<<endl;
}
}
cout<<mystack.size()<<endl;
}
}
Submission Info
Submission Time |
|
Task |
A - STring |
User |
aseem_cu |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
2071 Byte |
Status |
AC |
Exec Time |
10 ms |
Memory |
1284 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
All |
Score / Max Score |
0 / 0 |
200 / 200 |
100 / 100 |
Status |
|
|
|
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 |
10 ms |
900 KB |
corner1 |
AC |
10 ms |
1284 KB |
corner2 |
AC |
9 ms |
640 KB |
example0 |
AC |
2 ms |
256 KB |
example1 |
AC |
2 ms |
384 KB |
example2 |
AC |
2 ms |
256 KB |
handmade0 |
AC |
2 ms |
256 KB |
handmade1 |
AC |
2 ms |
256 KB |
maxrand0 |
AC |
10 ms |
640 KB |
sub_corner0 |
AC |
2 ms |
256 KB |
sub_corner1 |
AC |
2 ms |
256 KB |
sub_corner2 |
AC |
2 ms |
256 KB |
sub_rand0 |
AC |
2 ms |
256 KB |