Submission #1817366


Source Code Expand

#include<bits/stdc++.h>
//#define int long long
#define loop(i, a, b) for(int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define all(a) (a).begin(),(a).end()
using namespace std;
const int MOD = 1e9 + 7, INF = 1e9;
using vi = vector <int>;
using vvi = vector <vi>;
//g++ -std==c++14
 
signed main(){
    string s;
    cin >> s;
    int ans = s.size();
    while(1){
        bool update = false;

        for(int i = s.size() - 1; i > 0; i--){
            if(s[i] == 'T' && s[i - 1] == 'S'){
                s.erase(i - 1, 2);
                update = true;
            }
        }

        if(!update)break;
    }
    cout << s.size() << endl;
}

Submission Info

Submission Time
Task A - STring
User Masumi
Language C++14 (GCC 5.4.1)
Score 300
Code Size 681 Byte
Status AC
Exec Time 172 ms
Memory 640 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 200 / 200 100 / 100
Status
AC × 3
AC × 9
AC × 13
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 172 ms 640 KB
corner1 AC 9 ms 640 KB
corner2 AC 30 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 12 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