Submission #904461
Source Code Expand
#include <cstdio> #include <iostream> #include <string> #include <algorithm> #include <vector> #include <cstring> #include <stack> #define INT long long #define oo 99999987654321LL using namespace std; stack<char> st; string s; int n; int main() { cin>>s; n = s.size(); for(int i = 0 ; i < n ; i++ ) { if( s[i] == 'S' ) st.push('S'); else { if( !st.empty() && st.top() == 'S' ) st.pop(); else st.push('T'); } } cout<<st.size()<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - STring |
User | JKJeong |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 563 Byte |
Status | AC |
Exec Time | 10 ms |
Memory | 768 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 | 640 KB |
corner1 | AC | 10 ms | 644 KB |
corner2 | AC | 10 ms | 640 KB |
example0 | AC | 2 ms | 384 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 | 768 KB |
sub_corner0 | AC | 3 ms | 256 KB |
sub_corner1 | AC | 3 ms | 256 KB |
sub_corner2 | AC | 2 ms | 256 KB |
sub_rand0 | AC | 3 ms | 256 KB |