Submission #6015588


Source Code Expand

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

#define TRACE(x) x
#define WATCH(x) TRACE(cout << #x" = " << x << endl)
#define WATCHR(a, b) TRACE(for (auto it=a; it!=b;) cout << *(it++) << " "; cout << endl)
#define WATCHC(V) TRACE({cout << #V" = "; WATCHR(V.begin(), V.end());})

#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    string s;
    int x, y;
    cin >> s >> x >> y;

    int i = 0;
    while (i < sz(s) && s[i] == 'F')
        i++;

    x -= i;

    bool dir = false;
    vi vert, horiz;
    while (i < sz(s)) {
        int j = i + 1;
        while (j < sz(s) && s[j] != 'T')
            j++;
        if (j-i-1) (dir ? horiz : vert).push_back(j-i-1);
        i = j;
        dir = !dir;
    }

    const int MAXV = 8008;
    bitset<2 * MAXV> v, h;
    v[MAXV] = true;
    h[MAXV] = true;

    for (int d : vert) v = (v << d) | (v >> d);
    for (int d : horiz) h = (h << d) | (h >> d);

    if (x + MAXV < 0) cout << "No\n";
    else cout << (v[y + MAXV] && h[x + MAXV] ? "Yes\n" : "No\n");

    return 0;
}

Submission Info

Submission Time
Task D - FT Robot
User socketnaut
Language C++14 (GCC 5.4.1)
Score 500
Code Size 1431 Byte
Status
Exec Time 6 ms
Memory 256 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 0_05.txt
All 500 / 500 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 1 ms 256 KB
0_01.txt 1 ms 256 KB
0_02.txt 1 ms 256 KB
0_03.txt 1 ms 256 KB
0_04.txt 1 ms 256 KB
0_05.txt 1 ms 256 KB
1_00.txt 1 ms 256 KB
1_01.txt 1 ms 256 KB
1_02.txt 1 ms 256 KB
1_03.txt 1 ms 256 KB
1_04.txt 1 ms 256 KB
1_05.txt 1 ms 256 KB
1_06.txt 6 ms 256 KB
1_07.txt 6 ms 256 KB
1_08.txt 4 ms 256 KB
1_09.txt 4 ms 256 KB
1_10.txt 4 ms 256 KB
1_11.txt 5 ms 256 KB
1_12.txt 4 ms 256 KB
1_13.txt 4 ms 256 KB
1_14.txt 4 ms 256 KB
1_15.txt 4 ms 256 KB
1_16.txt 4 ms 256 KB
1_17.txt 4 ms 256 KB
1_18.txt 4 ms 256 KB
1_19.txt 4 ms 256 KB
1_20.txt 4 ms 256 KB
1_21.txt 4 ms 256 KB
1_22.txt 4 ms 256 KB
1_23.txt 4 ms 256 KB
1_24.txt 4 ms 256 KB
1_25.txt 4 ms 256 KB
1_26.txt 1 ms 256 KB
1_27.txt 1 ms 256 KB
1_28.txt 4 ms 256 KB
1_29.txt 4 ms 256 KB
1_30.txt 3 ms 256 KB
1_31.txt 3 ms 256 KB
1_32.txt 2 ms 256 KB
1_33.txt 2 ms 256 KB
1_34.txt 2 ms 256 KB
1_35.txt 2 ms 256 KB
1_36.txt 2 ms 256 KB
1_37.txt 2 ms 256 KB
1_38.txt 1 ms 256 KB
1_39.txt 1 ms 256 KB
1_40.txt 1 ms 256 KB
1_41.txt 1 ms 256 KB
1_42.txt 3 ms 256 KB
1_43.txt 3 ms 256 KB
1_44.txt 3 ms 256 KB
1_45.txt 3 ms 256 KB
1_46.txt 3 ms 256 KB
1_47.txt 3 ms 256 KB
1_48.txt 3 ms 256 KB
1_49.txt 3 ms 256 KB