Submission #1878861


Source Code Expand

Copy
#include <bits/stdc++.h>
 
#define REP(i,n) for(int i=0; i<(int)(n); ++i)
#define FOR(i,k,n) for(int i=(k);i<(int)(n);++i)
typedef long long int ll;
using namespace std;

int dx3[16010];
int dy3[16010];
int *dx = dx3+8005;
int *dy = dy3+8005;

int dx4[16010];
int dy4[16010];
int *dx2 = dx4+8005;
int *dy2 = dy4+8005;

int main(void) {
    string s;
    cin >> s;
    int gx, gy;
    cin >> gx >> gy;

    bool isX = true;
    int t = 0;
    vector<int> X, Y;
    for(int i=0; i<s.size(); ++i) {
        if(s[i] == 'F') t++;
        if(s[i] == 'T' || i==s.size()-1) {
            if(isX) {
                X.push_back(t);
            } else {
                Y.push_back(t);
            }
            t = 0;
            isX = !isX;
        }
    }
    dx[X[0]] = 1;
    for(int i=1; i<X.size(); ++i) {
        int mx = X[i];
        if(i%2==1) {
            for(int j=-8000; j<=8000; ++j) {
                if(dx[j] == 1) {
                    dx2[j+mx] = 1;
                    dx2[j-mx] = 1;
                    dx[j] = 0;
                }
            }
        } else {
            for(int j=-8000; j<=8000; ++j) {
                if(dx2[j] == 1) {
                    dx[j+mx] = 1;
                    dx[j-mx] = 1;
                    dx2[j] = 0;
                }
            }
        }
    }

    if(Y.size() > 0) {
        dy[Y[0]] = 1;
        dy[-Y[0]] = 1;
    } else {
        dy2[0] = 1;
    }
    for(int i=1; i<Y.size(); ++i) {
        if(i%2==1) {
            for(int j=-8000; j<=8000; ++j) {
                if(dy[j] == 1) {
                    dy2[j+Y[i]] = 1;
                    dy2[j-Y[i]] = 1;
                    dy[j] = 0;
                }
            }
        } else {
            for(int j=-8000; j<=8000; ++j) {
                if(dy2[j] == 1) {
                    dy[j+Y[i]] = 1;
                    dy[j-Y[i]] = 1;
                    dy2[j] = 0;
                }
            }
        }
    }

    bool okX = false;
    if(X.size()%2 == 0) {
        if(dx2[gx] == 1) okX = true;
    } else {
        if(dx[gx] == 1) okX = true;
    }
    bool okY = false;
    if(Y.size()%2 == 0) {
        if(dy2[gy] == 1) okY = true;
    } else {
        if(dy[gy] == 1) okY = true;
    }

    if(okX && okY) cout << "Yes" << endl;
    else cout << "No" << endl;
}

Submission Info

Submission Time
Task D - FT Robot
User kivantium
Language C++14 (GCC 5.4.1)
Score 500
Code Size 2386 Byte
Status
Exec Time 84 ms
Memory 384 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 45 ms 384 KB
1_07.txt 45 ms 384 KB
1_08.txt 58 ms 384 KB
1_09.txt 58 ms 384 KB
1_10.txt 60 ms 384 KB
1_11.txt 60 ms 384 KB
1_12.txt 30 ms 384 KB
1_13.txt 30 ms 384 KB
1_14.txt 44 ms 384 KB
1_15.txt 44 ms 384 KB
1_16.txt 44 ms 384 KB
1_17.txt 44 ms 384 KB
1_18.txt 44 ms 384 KB
1_19.txt 44 ms 384 KB
1_20.txt 44 ms 384 KB
1_21.txt 45 ms 384 KB
1_22.txt 45 ms 384 KB
1_23.txt 45 ms 384 KB
1_24.txt 45 ms 384 KB
1_25.txt 44 ms 384 KB
1_26.txt 82 ms 256 KB
1_27.txt 84 ms 256 KB
1_28.txt 44 ms 384 KB
1_29.txt 45 ms 384 KB
1_30.txt 24 ms 384 KB
1_31.txt 23 ms 384 KB
1_32.txt 13 ms 384 KB
1_33.txt 13 ms 384 KB
1_34.txt 7 ms 384 KB
1_35.txt 7 ms 384 KB
1_36.txt 4 ms 384 KB
1_37.txt 5 ms 384 KB
1_38.txt 3 ms 384 KB
1_39.txt 3 ms 384 KB
1_40.txt 2 ms 384 KB
1_41.txt 2 ms 384 KB
1_42.txt 33 ms 384 KB
1_43.txt 33 ms 384 KB
1_44.txt 36 ms 384 KB
1_45.txt 39 ms 384 KB
1_46.txt 30 ms 384 KB
1_47.txt 34 ms 384 KB
1_48.txt 32 ms 384 KB
1_49.txt 38 ms 384 KB