Submission #3414136


Source Code Expand

#include <bits/stdc++.h>

#define unless(cond) if (!(cond))

using namespace std;

const int N = (8000 + 5) * 2;
bool dp[N][N];
bool fn(vector<int> v, int x)
{
  const int base = N / 2;
  fill(&dp[0][0], &dp[N - 1][N - 1] + 1, false);
  dp[0][base] = true;
  for (int i = 0; i < v.size(); ++i) {
    for (int j = 0; j < N; ++j) {
      if (dp[i][j]) {
        dp[i + 1][j + v[i]] = true;
        dp[i + 1][j - v[i]] = true;
      }
    }
  }

  return dp[v.size()][x + base];
}

int main(int argc, char *argv[])
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  string s;
  int x, y;
  while (cin >> s >> x >> y) {
    vector<int> v;
    int cnt = 0;
    for (int i = 0; i < s.size(); ++i) {
      char c = s[i];
      if (c == 'T') {
        v.push_back(cnt);
        cnt = 0;
      }
      if (c == 'F') {
        ++cnt;
      }
    }
    v.push_back(cnt);

    vector<int> a;
    vector<int> b;
    for (int i = 1; i < v.size(); ++i) {
      if (i % 2 == 0) a.push_back(v[i]);
      else b.push_back(v[i]);
    }

    bool f = fn(a, x - v.front()) && fn(b, y);
    cout << (f ? "Yes" : "No") << endl;
  }

  return 0;
}

Submission Info

Submission Time
Task D - FT Robot
User Johniel
Language C++ (GCC 5.4.1)
Score 0
Code Size 1184 Byte
Status RE
Exec Time 316 ms
Memory 250752 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 6
AC × 55
RE × 1
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 0_05.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 0_05.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt
Case Name Status Exec Time Memory
0_00.txt AC 235 ms 250624 KB
0_01.txt AC 234 ms 250624 KB
0_02.txt AC 143 ms 250624 KB
0_03.txt AC 143 ms 250624 KB
0_04.txt AC 235 ms 250624 KB
0_05.txt AC 144 ms 250624 KB
1_00.txt AC 235 ms 250624 KB
1_01.txt RE 238 ms 250624 KB
1_02.txt AC 235 ms 250624 KB
1_03.txt AC 235 ms 250624 KB
1_04.txt AC 235 ms 250624 KB
1_05.txt AC 235 ms 250624 KB
1_06.txt AC 280 ms 250624 KB
1_07.txt AC 165 ms 250624 KB
1_08.txt AC 293 ms 250624 KB
1_09.txt AC 173 ms 250624 KB
1_10.txt AC 293 ms 250624 KB
1_11.txt AC 171 ms 250624 KB
1_12.txt AC 268 ms 250624 KB
1_13.txt AC 265 ms 250624 KB
1_14.txt AC 277 ms 250624 KB
1_15.txt AC 277 ms 250624 KB
1_16.txt AC 277 ms 250624 KB
1_17.txt AC 277 ms 250624 KB
1_18.txt AC 278 ms 250624 KB
1_19.txt AC 164 ms 250624 KB
1_20.txt AC 277 ms 250624 KB
1_21.txt AC 164 ms 250624 KB
1_22.txt AC 279 ms 250624 KB
1_23.txt AC 278 ms 250624 KB
1_24.txt AC 278 ms 250624 KB
1_25.txt AC 278 ms 250624 KB
1_26.txt AC 316 ms 250752 KB
1_27.txt AC 184 ms 250624 KB
1_28.txt AC 278 ms 250624 KB
1_29.txt AC 164 ms 250624 KB
1_30.txt AC 257 ms 250624 KB
1_31.txt AC 153 ms 250624 KB
1_32.txt AC 246 ms 250624 KB
1_33.txt AC 246 ms 250624 KB
1_34.txt AC 240 ms 250624 KB
1_35.txt AC 145 ms 250624 KB
1_36.txt AC 237 ms 250624 KB
1_37.txt AC 145 ms 250624 KB
1_38.txt AC 235 ms 250624 KB
1_39.txt AC 142 ms 250624 KB
1_40.txt AC 235 ms 250624 KB
1_41.txt AC 142 ms 250624 KB
1_42.txt AC 160 ms 250624 KB
1_43.txt AC 160 ms 250624 KB
1_44.txt AC 162 ms 250624 KB
1_45.txt AC 270 ms 250624 KB
1_46.txt AC 264 ms 250624 KB
1_47.txt AC 157 ms 250624 KB
1_48.txt AC 156 ms 250624 KB
1_49.txt AC 157 ms 250624 KB