Submission #3780601


Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>

using namespace std;

bool x_dp[4010][16100];
bool y_dp[4010][16100];
int ori = 8050;

int main(){
    string s;
    int x, y;
    cin >> s >> x >> y;
    vector<int> h, v;
    int cnt = 0;
    bool m = true;
    for(int i = 0; i < s.size(); i++){
        if(s[i] == 'F') cnt++;
        else{
            if(m){
                if(cnt != 0) h.push_back(cnt);
                m = false; cnt = 0;
            }else{
                if(cnt != 0) v.push_back(cnt);
                m = true; cnt = 0;
            }
        }
    }
    if(m){
        if(cnt > 0) h.push_back(cnt);
    }else{
        if(cnt > 0) v.push_back(cnt);
    }
    if(h.size() > 0)
        x_dp[1][ori + h[0]] = true;
    else
        x_dp[0][ori] = true;
    y_dp[0][ori] = true;
    for(int i = 1; i < h.size(); i++){
        for(int j = ori - s.size(); j <= ori + s.size(); j++){
            if(x_dp[i][j]){
                x_dp[i + 1][j - h[i]] = true;
                x_dp[i + 1][j + h[i]] = true;
            }
        }
    }
    for(int i = 0; i < v.size(); i++){
        for(int j = ori - s.size(); j <= ori + s.size(); j++){
            if(y_dp[i][j]){
                y_dp[i + 1][j - v[i]] = true;
                y_dp[i + 1][j + v[i]] = true;
            }
        }
    }
    if(x_dp[h.size()][ori + x] && y_dp[v.size()][ori + y]){
        cout << "Yes" << endl;
    }else{
        cout << "No" << endl;
    }
    return 0;
}

Submission Info

Submission Time
Task D - FT Robot
User lucky3977
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1545 Byte
Status WA
Exec Time 72 ms
Memory 66304 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 6
AC × 54
WA × 2
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 2 ms 2304 KB
0_01.txt AC 2 ms 2304 KB
0_02.txt AC 2 ms 2304 KB
0_03.txt AC 2 ms 2304 KB
0_04.txt AC 2 ms 2304 KB
0_05.txt AC 2 ms 2304 KB
1_00.txt AC 2 ms 2304 KB
1_01.txt AC 2 ms 2304 KB
1_02.txt AC 2 ms 2304 KB
1_03.txt AC 2 ms 2304 KB
1_04.txt AC 2 ms 2304 KB
1_05.txt WA 2 ms 2304 KB
1_06.txt AC 72 ms 66304 KB
1_07.txt AC 72 ms 66304 KB
1_08.txt AC 48 ms 45312 KB
1_09.txt AC 49 ms 45312 KB
1_10.txt AC 49 ms 43776 KB
1_11.txt AC 49 ms 43776 KB
1_12.txt AC 48 ms 45952 KB
1_13.txt AC 48 ms 45952 KB
1_14.txt AC 36 ms 35072 KB
1_15.txt AC 36 ms 35072 KB
1_16.txt AC 37 ms 33536 KB
1_17.txt AC 37 ms 33536 KB
1_18.txt AC 35 ms 33536 KB
1_19.txt AC 36 ms 33536 KB
1_20.txt AC 36 ms 33536 KB
1_21.txt AC 36 ms 33536 KB
1_22.txt AC 37 ms 33536 KB
1_23.txt AC 36 ms 33536 KB
1_24.txt AC 36 ms 33536 KB
1_25.txt AC 37 ms 33536 KB
1_26.txt AC 2 ms 2304 KB
1_27.txt AC 2 ms 2304 KB
1_28.txt AC 36 ms 33536 KB
1_29.txt AC 36 ms 33536 KB
1_30.txt WA 29 ms 25472 KB
1_31.txt AC 27 ms 25472 KB
1_32.txt AC 18 ms 17280 KB
1_33.txt AC 18 ms 17280 KB
1_34.txt AC 10 ms 9216 KB
1_35.txt AC 10 ms 9216 KB
1_36.txt AC 6 ms 5248 KB
1_37.txt AC 8 ms 7296 KB
1_38.txt AC 5 ms 4864 KB
1_39.txt AC 5 ms 4864 KB
1_40.txt AC 4 ms 4608 KB
1_41.txt AC 4 ms 4608 KB
1_42.txt AC 25 ms 23296 KB
1_43.txt AC 25 ms 23296 KB
1_44.txt AC 25 ms 23296 KB
1_45.txt AC 25 ms 23296 KB
1_46.txt AC 25 ms 24960 KB
1_47.txt AC 25 ms 24960 KB
1_48.txt AC 26 ms 24960 KB
1_49.txt AC 25 ms 22912 KB