Submission #2660476

Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))


int solve(string& x) {
    int L=x.size();

    int s=0;
    int cnt = 0;

    rep(i,L){
        if (x[i] == 'S') {
            ++s;
        }
        else if (x[i] == 'T') {
            --s;
            if (s < 0) {++cnt; s=0; }
        }
    }

    return cnt*2;
}

int main() {
    string x; cin >> x;
    cout << solve(x) << endl;
    // cout << (solve(N,a) ? "Yes":"No") << endl;
    return 0;
}

Submission Info

Submission Time
Task A - STring
User naoya_t
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1503 Byte
Status
Exec Time 8 ms
Memory 640 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 example0, example1, example2
Subtask1 200 / 200 example0, example1, example2, sub_corner0, sub_corner1, sub_corner2, sub_rand0, handmade0, handmade1
All 100 / 100 corner0, corner1, corner2, example0, example1, example2, handmade0, handmade1, maxrand0, sub_corner0, sub_corner1, sub_corner2, sub_rand0
Case Name Status Exec Time Memory
corner0 8 ms 640 KB
corner1 8 ms 640 KB
corner2 8 ms 640 KB
example0 1 ms 256 KB
example1 1 ms 256 KB
example2 1 ms 256 KB
handmade0 1 ms 256 KB
handmade1 1 ms 256 KB
maxrand0 8 ms 640 KB
sub_corner0 1 ms 256 KB
sub_corner1 1 ms 256 KB
sub_corner2 1 ms 256 KB
sub_rand0 1 ms 256 KB