Submission #906118


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 = 0;
    int cs = 0, ct = 0;
    bool f = false;
    s += 'S';
    rep(i, 0, s.size()){
        if(!f && s[i] == 'S'){
            ans += min(cs, ct);
            f = true;
            cs = 1;
        }else if(f && s[i] == 'S'){
            cs++;
        }else if(f && s[i] == 'T'){
            f = false;
            ct = 1;
        }else if(!f && s[i] == 'T'){
            ct++;
        }
    }
    ans = (int)s.size() - 2 * ans - 1;
    cout << ans << endl;
}

Submission Info

Submission Time
Task A - STring
User treeone
Language C++14 (GCC 5.4.1)
Score 0
Code Size 776 Byte
Status WA
Exec Time 10 ms
Memory 768 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 0 / 200 0 / 100
Status
AC × 3
AC × 6
WA × 3
AC × 7
WA × 6
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 WA 9 ms 640 KB
corner1 AC 9 ms 640 KB
corner2 WA 10 ms 768 KB
example0 AC 3 ms 256 KB
example1 AC 3 ms 256 KB
example2 AC 3 ms 256 KB
handmade0 AC 3 ms 256 KB
handmade1 AC 3 ms 256 KB
maxrand0 WA 10 ms 640 KB
sub_corner0 WA 3 ms 256 KB
sub_corner1 AC 3 ms 256 KB
sub_corner2 WA 3 ms 256 KB
sub_rand0 WA 3 ms 256 KB