Submission #1875445


Source Code Expand

Copy
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
//---------------------------------------------------------------------------------------------------






string S; int N;
int xy[2];
//---------------------------------------------------------------------------------------------------
int check(int x, vector<int> _v) {
    vector<int> v;
    fore(i, _v) if (i) v.push_back(i);

    int n = v.size();
    int cent = 8080;
    
    set<int> dp;
    dp.insert(0);
    fore(i, _v) {
        set<int> pd;
        fore(j, dp) {
            pd.insert(j + i);
            pd.insert(j - i);
        }
        swap(dp, pd);
    }

    fore(i, dp) if (i == x) return 1;
    return 0;
}
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> S >> xy[0] >> xy[1];
    N = S.length();

    int pre = -1, state = 0;
    vector<int> v[2];
    rep(i, 0, N) {
        if (S[i] == 'T') {
            v[state].push_back(i - pre - 1);
            state = 1 - state;
            pre = i;
        }
    }
    v[state].push_back(N - pre - 1);

    xy[0] -= v[0].front();
    v[0].erase(v[0].begin(), v[0].begin() + 1);

    rep(d, 0, 2) {
        if (!check(xy[d], v[d])) {
            printf("No\n");
            return;
        }
    }

    printf("Yes\n");
}

Submission Info

Submission Time
Task D - FT Robot
User hamayanhamayan
Language C++14 (GCC 5.4.1)
Score 500
Code Size 1596 Byte
Status AC
Exec Time 415 ms
Memory 656 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 6
AC × 56
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 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
0_04.txt AC 1 ms 256 KB
0_05.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt AC 387 ms 512 KB
1_07.txt AC 194 ms 512 KB
1_08.txt AC 349 ms 512 KB
1_09.txt AC 351 ms 512 KB
1_10.txt AC 354 ms 512 KB
1_11.txt AC 1 ms 384 KB
1_12.txt AC 166 ms 384 KB
1_13.txt AC 166 ms 384 KB
1_14.txt AC 195 ms 512 KB
1_15.txt AC 194 ms 512 KB
1_16.txt AC 194 ms 512 KB
1_17.txt AC 194 ms 512 KB
1_18.txt AC 374 ms 512 KB
1_19.txt AC 187 ms 512 KB
1_20.txt AC 379 ms 512 KB
1_21.txt AC 196 ms 512 KB
1_22.txt AC 396 ms 512 KB
1_23.txt AC 381 ms 512 KB
1_24.txt AC 393 ms 512 KB
1_25.txt AC 394 ms 512 KB
1_26.txt AC 2 ms 384 KB
1_27.txt AC 1 ms 384 KB
1_28.txt AC 393 ms 512 KB
1_29.txt AC 196 ms 512 KB
1_30.txt AC 300 ms 640 KB
1_31.txt AC 147 ms 640 KB
1_32.txt AC 180 ms 640 KB
1_33.txt AC 181 ms 640 KB
1_34.txt AC 94 ms 656 KB
1_35.txt AC 45 ms 640 KB
1_36.txt AC 49 ms 640 KB
1_37.txt AC 32 ms 640 KB
1_38.txt AC 27 ms 640 KB
1_39.txt AC 16 ms 640 KB
1_40.txt AC 12 ms 640 KB
1_41.txt AC 9 ms 640 KB
1_42.txt AC 51 ms 384 KB
1_43.txt AC 23 ms 256 KB
1_44.txt AC 415 ms 640 KB
1_45.txt AC 190 ms 384 KB
1_46.txt AC 86 ms 384 KB
1_47.txt AC 83 ms 384 KB
1_48.txt AC 84 ms 384 KB
1_49.txt AC 83 ms 384 KB