Submission #466993

Source Code Expand

#include<iostream>
#include<vector>
using namespace std;
void visit(string& s, int start, int x, int step, int sum, int& max) {
  if (start == s.size()) {
	return;
  }
  if (s[start] == 'M')  {
	if ((x > 0 && step > x)|| x <= 0)
	    visit(s, start + 1, x + 1, step - 1, sum, max);
	if ((x < 0 && step > -x) || x >= 0)
	    visit(s, start + 1, x - 1, step - 1, sum, max);
  } else if (s[start] == '+') {
	sum += x;
	if (max < sum)
	    max = sum;
	visit(s, start + 1, x, step, sum, max);
  } else {
	sum -= x;
	if (max < sum)
	    max = sum;
	visit(s, start + 1, x, step, sum, max);
  }
}
int main() {
  string s;
  cin >> s;
  int step = 0;
  for (int i = 0; i < s.size(); ++i)
     if (s[i] == 'M') step++;
  if (step == 0) {
	cout << 0 << endl;
	return 0;
  }	
  int max = 0;
  int sum = 0;
  int x = 0;
  visit(s, 0, x, step, sum, max);
  cout << max << endl;
  return 0;
}

Submission Info

Submission Time
Task D - ロボット
User seanchen1002
Language C++ (GCC 4.9.2)
Score 0
Code Size 919 Byte
Status TLE
Exec Time 2041 ms
Memory 5200 KiB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
AC × 4
AC × 10
TLE × 26
AC × 14
TLE × 54
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 37 ms 916 KiB
sample_02.txt AC 29 ms 1012 KiB
sample_03.txt AC 27 ms 984 KiB
sample_04.txt AC 30 ms 952 KiB
subtask1_01.txt AC 30 ms 892 KiB
subtask1_02.txt AC 30 ms 952 KiB
subtask1_03.txt TLE 2039 ms 1044 KiB
subtask1_04.txt AC 29 ms 1016 KiB
subtask1_05.txt AC 38 ms 924 KiB
subtask1_06.txt TLE 2038 ms 1080 KiB
subtask1_07.txt TLE 2038 ms 1052 KiB
subtask1_08.txt AC 31 ms 944 KiB
subtask1_09.txt AC 30 ms 952 KiB
subtask1_10.txt TLE 2037 ms 1104 KiB
subtask1_11.txt TLE 2038 ms 1080 KiB
subtask1_12.txt TLE 2037 ms 1112 KiB
subtask1_13.txt TLE 2039 ms 1008 KiB
subtask1_14.txt TLE 2037 ms 1104 KiB
subtask1_15.txt TLE 2040 ms 1040 KiB
subtask1_16.txt TLE 2039 ms 1036 KiB
subtask1_17.txt TLE 2040 ms 1044 KiB
subtask1_18.txt TLE 2037 ms 1108 KiB
subtask1_19.txt TLE 2037 ms 1084 KiB
subtask1_20.txt TLE 2038 ms 1084 KiB
subtask1_21.txt TLE 2038 ms 1044 KiB
subtask1_22.txt TLE 2038 ms 996 KiB
subtask1_23.txt TLE 2037 ms 1084 KiB
subtask1_24.txt TLE 2037 ms 1084 KiB
subtask1_25.txt TLE 2037 ms 1040 KiB
subtask1_26.txt TLE 2039 ms 1108 KiB
subtask1_27.txt TLE 2040 ms 1040 KiB
subtask1_28.txt TLE 2041 ms 1096 KiB
subtask1_29.txt TLE 2036 ms 1044 KiB
subtask1_30.txt TLE 2037 ms 1084 KiB
subtask1_31.txt TLE 2037 ms 1084 KiB
subtask1_32.txt TLE 2038 ms 1084 KiB
subtask2_01.txt TLE 2038 ms 5180 KiB
subtask2_02.txt AC 33 ms 1232 KiB
subtask2_03.txt AC 33 ms 1176 KiB
subtask2_04.txt TLE 2038 ms 5180 KiB
subtask2_05.txt TLE 2036 ms 5196 KiB
subtask2_06.txt AC 34 ms 1104 KiB
subtask2_07.txt AC 35 ms 1116 KiB
subtask2_08.txt TLE 2040 ms 3268 KiB
subtask2_09.txt TLE 2038 ms 3180 KiB
subtask2_10.txt TLE 2038 ms 3260 KiB
subtask2_11.txt TLE 2038 ms 5180 KiB
subtask2_12.txt TLE 2039 ms 5200 KiB
subtask2_13.txt TLE 2038 ms 5136 KiB
subtask2_14.txt TLE 2038 ms 5012 KiB
subtask2_15.txt TLE 2038 ms 4440 KiB
subtask2_16.txt TLE 2037 ms 3900 KiB
subtask2_17.txt TLE 2038 ms 3152 KiB
subtask2_18.txt TLE 2037 ms 3148 KiB
subtask2_19.txt TLE 2038 ms 3224 KiB
subtask2_20.txt TLE 2037 ms 3260 KiB
subtask2_21.txt TLE 2039 ms 3220 KiB
subtask2_22.txt TLE 2038 ms 3216 KiB
subtask2_23.txt TLE 2040 ms 3136 KiB
subtask2_24.txt TLE 2038 ms 3176 KiB
subtask2_25.txt TLE 2037 ms 3220 KiB
subtask2_26.txt TLE 2037 ms 3260 KiB
subtask2_27.txt TLE 2037 ms 3220 KiB
subtask2_28.txt TLE 2037 ms 3152 KiB
subtask2_29.txt TLE 2037 ms 3256 KiB
subtask2_30.txt TLE 2040 ms 3216 KiB
subtask2_31.txt TLE 2039 ms 3132 KiB
subtask2_32.txt TLE 2038 ms 3212 KiB