Submission #905941
Source Code Expand
#include <bits/stdc++.h> #define rep(i, a, n) for(int i = a; i < n; i++) #define repb(i, a, b) for(int i = a; i >= b; i--) #define all(a) a.begin(), a.end() #define int long long using namespace std; typedef pair<int, int> P; signed main(){ string s; cin >> s; int ans = s.size(); while(1){ if(s.find("ST") != string::npos){ int id = s.find("ST"); s = s.substr(0, id) + s.substr(id + 2); ans -= 2; }else break; } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - STring |
User | treeone |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 532 Byte |
Status | TLE |
Exec Time | 1054 ms |
Memory | 1136 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | 0 / 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 | TLE | 1054 ms | 1020 KB |
corner1 | AC | 87 ms | 1136 KB |
corner2 | TLE | 1054 ms | 1020 KB |
example0 | AC | 3 ms | 256 KB |
example1 | AC | 3 ms | 256 KB |
example2 | AC | 3 ms | 256 KB |
handmade0 | AC | 2 ms | 256 KB |
handmade1 | AC | 3 ms | 256 KB |
maxrand0 | TLE | 1054 ms | 1008 KB |
sub_corner0 | AC | 3 ms | 256 KB |
sub_corner1 | AC | 3 ms | 256 KB |
sub_corner2 | AC | 3 ms | 256 KB |
sub_rand0 | AC | 3 ms | 256 KB |