Submission #1690846


Source Code Expand

#include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
typedef long long int ll;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define EREP(i, n) for (int i = (n - 1); i >= 0; --i)
#define D(n, retu)                                                             \
  REP(i, n) { cin >> retu[i]; }
#define mod 1000000007
#define INF 93193111451418101
#define MIN -933111451418101
//#define INF 931931114518101
using namespace std;
typedef pair<ll, ll> P;
template <typename T> void fill_all(T &arr, const T &v) { arr = v; }
template <typename T, typename ARR> void fill_all(ARR &arr, const T &v) {
  for (auto &i : arr) {
    fill_all(i, v);
  }
}
#define yo 100001
//------------------変数-----------------------//
ll n, maxmove = 0, movesize;
string s;
ll imos[114514], dp[114514];
//-------------------関数----------------------//

int main() {
  // cout << "a" << endl;
  cin >> s;
  memset(dp, -1, sizeof(dp));
  REP(i, s.size()) {
    if (s[i] == 'M') {
      maxmove++;
    }
  }
  //  cout << "maxmove " << maxmove << endl;
  ll izryt = 0, nowpoint = s.size() - 1;
  for (ll i = maxmove - 1; i >= 0; i--) {
    while (1) {
      if (s[nowpoint] == 'M') {
        nowpoint--;
        imos[i] = izryt;
        break;
      }
      if (s[nowpoint] == '+') {
        izryt++;
      } else {
        izryt--;
      }
      nowpoint--;
    }
  }
  ll cnt = 0;
  sort(imos, imos + maxmove);
  REP(i, maxmove) {
    if (i >= maxmove / 2) {
      cnt += imos[i];
    } else {
      cnt -= imos[i];
    }
  }
  cout << cnt << endl;

  return 0;
}

Submission Info

Submission Time
Task D - ロボット
User keidaroo
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1809 Byte
Status AC
Exec Time 7 ms
Memory 2176 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 4
AC × 36
AC × 68
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
Subtask1 sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt
Subtask2 sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt, subtask2_30.txt, subtask2_31.txt, subtask2_32.txt
Case Name Status Exec Time Memory
sample_01.txt AC 2 ms 1152 KB
sample_02.txt AC 2 ms 1152 KB
sample_03.txt AC 2 ms 1152 KB
sample_04.txt AC 2 ms 1152 KB
subtask1_01.txt AC 2 ms 1152 KB
subtask1_02.txt AC 2 ms 1152 KB
subtask1_03.txt AC 2 ms 1152 KB
subtask1_04.txt AC 2 ms 1152 KB
subtask1_05.txt AC 2 ms 1152 KB
subtask1_06.txt AC 2 ms 1152 KB
subtask1_07.txt AC 2 ms 1152 KB
subtask1_08.txt AC 2 ms 1152 KB
subtask1_09.txt AC 2 ms 1152 KB
subtask1_10.txt AC 2 ms 1152 KB
subtask1_11.txt AC 2 ms 1152 KB
subtask1_12.txt AC 2 ms 1152 KB
subtask1_13.txt AC 2 ms 1152 KB
subtask1_14.txt AC 2 ms 1152 KB
subtask1_15.txt AC 2 ms 1152 KB
subtask1_16.txt AC 2 ms 1152 KB
subtask1_17.txt AC 2 ms 1152 KB
subtask1_18.txt AC 2 ms 1152 KB
subtask1_19.txt AC 2 ms 1152 KB
subtask1_20.txt AC 2 ms 1152 KB
subtask1_21.txt AC 2 ms 1152 KB
subtask1_22.txt AC 2 ms 1152 KB
subtask1_23.txt AC 2 ms 1152 KB
subtask1_24.txt AC 2 ms 1152 KB
subtask1_25.txt AC 2 ms 1152 KB
subtask1_26.txt AC 2 ms 1152 KB
subtask1_27.txt AC 2 ms 1152 KB
subtask1_28.txt AC 2 ms 1152 KB
subtask1_29.txt AC 2 ms 1152 KB
subtask1_30.txt AC 2 ms 1152 KB
subtask1_31.txt AC 2 ms 1152 KB
subtask1_32.txt AC 2 ms 1152 KB
subtask2_01.txt AC 7 ms 2176 KB
subtask2_02.txt AC 5 ms 1408 KB
subtask2_03.txt AC 5 ms 1408 KB
subtask2_04.txt AC 7 ms 2176 KB
subtask2_05.txt AC 7 ms 2176 KB
subtask2_06.txt AC 5 ms 1408 KB
subtask2_07.txt AC 5 ms 1408 KB
subtask2_08.txt AC 6 ms 1792 KB
subtask2_09.txt AC 6 ms 1792 KB
subtask2_10.txt AC 6 ms 1792 KB
subtask2_11.txt AC 7 ms 2176 KB
subtask2_12.txt AC 7 ms 2176 KB
subtask2_13.txt AC 7 ms 2176 KB
subtask2_14.txt AC 7 ms 2176 KB
subtask2_15.txt AC 6 ms 2048 KB
subtask2_16.txt AC 6 ms 1920 KB
subtask2_17.txt AC 7 ms 1792 KB
subtask2_18.txt AC 7 ms 1792 KB
subtask2_19.txt AC 7 ms 1792 KB
subtask2_20.txt AC 7 ms 1792 KB
subtask2_21.txt AC 7 ms 1792 KB
subtask2_22.txt AC 7 ms 1792 KB
subtask2_23.txt AC 7 ms 1792 KB
subtask2_24.txt AC 7 ms 1792 KB
subtask2_25.txt AC 7 ms 1792 KB
subtask2_26.txt AC 7 ms 1792 KB
subtask2_27.txt AC 7 ms 1792 KB
subtask2_28.txt AC 7 ms 1792 KB
subtask2_29.txt AC 7 ms 1792 KB
subtask2_30.txt AC 7 ms 1792 KB
subtask2_31.txt AC 7 ms 1792 KB
subtask2_32.txt AC 7 ms 1792 KB