Submission #904974


Source Code Expand

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)

using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PI;
const ll mod = 1e9 + 7;



int main(void){
  string X;
  cin >> X;
  ll length = X.size();
  ll p_s = 0,p_t = 0;
  ll minus = 0;
  while (p_s < length && p_t < length) 
    {
      if (X[p_s] == 'S') 
	{
	  p_t = p_s + 1;
	  while (p_t < length) 
	    {
	      if (X[p_t] == 'T') 
		{
		  minus += 2;
		  X[p_s] = 'o';
		  X[p_t] = 'o';
		  break;
		}
	      p_t++;
	    }
	}
      p_s++;
    }
  cout << length - minus << endl;
}

Submission Info

Submission Time
Task A - STring
User censored__
Language C++14 (GCC 5.4.1)
Score 200
Code Size 1087 Byte
Status TLE
Exec Time 1054 ms
Memory 640 KB

Judge Result

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