Submission #1477706
Source Code Expand
#include<functional> #include<algorithm> #include<iostream> #include<utility> #include<string> #include<vector> #include<cmath> #include<stack> #include<queue> #include<deque> #include<map> #define rep(i,n) for(int i=0;i<n;i++) #define loop(i,x,n) for(int i=x;i<n;i++) #define pf push_front #define pb push_back #define mp make_pair #define int long long using namespace std; const int INF=1000000007; int dx[4]={1,0,-1,0}; int dy[4]={0,1,0,-1}; signed main(){ string s; cin>>s; stack<char> sta; rep(i,s.size()){ if(s[i]=='S'){ sta.push('S'); }else{ if(sta.size()==0||sta.top()=='T'){ sta.push('T'); }else{ sta.pop(); } } } cout<<sta.size()<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - STring |
User | fuu32 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 775 Byte |
Status | AC |
Exec Time | 9 ms |
Memory | 644 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 | 8 ms | 640 KB |
corner1 | AC | 9 ms | 644 KB |
corner2 | AC | 8 ms | 640 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 | 9 ms | 640 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 |