Submission #904466
Source Code Expand
#include <iostream> #include <array> #include <vector> #include <map> #include <utility> #include <cstring> #include <cstdio> #include <cmath> #include <cstdlib> #include <queue> #include <stack> #include <deque> #include <set> #include <string> using namespace std; int main(int argc, const char * argv[]) { stack<char> st; char ch; while ((ch = getchar()) != '\n') { if (st.empty()) { st.push(ch); }else if (ch == 'T' && st.top() == 'S') { st.pop(); }else{ st.push(ch); } } cout<<st.size()<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - STring |
User | kasimatatomoya |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 655 Byte |
Status | AC |
Exec Time | 5 ms |
Memory | 512 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 | 4 ms | 384 KB |
corner1 | AC | 5 ms | 512 KB |
corner2 | AC | 4 ms | 256 KB |
example0 | AC | 2 ms | 256 KB |
example1 | AC | 2 ms | 256 KB |
example2 | AC | 3 ms | 256 KB |
handmade0 | AC | 2 ms | 256 KB |
handmade1 | AC | 2 ms | 256 KB |
maxrand0 | AC | 5 ms | 256 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 |