Submission #2661288

Source Code Expand

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

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }
// ll comb(ll n, ll k) { ll v=1; for(ll i=1; i<=k; i++) v = DIV(MUL(v, n-i+1),i); return v; }
//

bool possible(vi& v, int x){
    int L = v.size();
    set<int> s; s.insert(0);
    rep(i,L) {
        set<int> s2;
        for (int si: s) {
            s2.insert(si + v[i]);
            s2.insert(si - v[i]);
        }
        s = s2;
    }
    // cerr << s << x << endl;
    return found(s, x);
}
bool solve(string&s, int x, int y) {
    int L=s.size();

    vvi ls(2, vi(0));

    int from = 0;
    rep(i,L){
        if (s[i] == 'T') break;
        --x; ++from;
    }
    int dir=0, l=0;
    for (int i=from; i<L; ++i) {
        if (s[i] == 'F') {
            ++l;
        } else {//T
            ls[dir].pb(l);
            dir=1-dir;
            l=0;
        }
    }
    if (l>0) ls[dir].pb(l);

    sort(ALL(ls[0]));
    sort(ALL(ls[1]));
    return possible(ls[0],x) && possible(ls[1],y);
}

int main() {
    string s; cin >> s;
    int x,y; cin >> x >> y;
    cout << (solve(s,x,y) ? "Yes":"No") << endl;
    return 0;
}

Submission Info

Submission Time
Task D - FT Robot
User naoya_t
Language C++14 (GCC 5.4.1)
Score 500
Code Size 2662 Byte
Status
Exec Time 439 ms
Memory 640 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 2 ms 256 KB
1_06.txt 439 ms 512 KB
1_07.txt 217 ms 512 KB
1_08.txt 398 ms 512 KB
1_09.txt 405 ms 512 KB
1_10.txt 396 ms 512 KB
1_11.txt 2 ms 256 KB
1_12.txt 188 ms 384 KB
1_13.txt 188 ms 384 KB
1_14.txt 219 ms 512 KB
1_15.txt 218 ms 512 KB
1_16.txt 217 ms 512 KB
1_17.txt 219 ms 512 KB
1_18.txt 133 ms 512 KB
1_19.txt 66 ms 512 KB
1_20.txt 136 ms 512 KB
1_21.txt 70 ms 512 KB
1_22.txt 145 ms 512 KB
1_23.txt 138 ms 512 KB
1_24.txt 137 ms 512 KB
1_25.txt 143 ms 512 KB
1_26.txt 2 ms 256 KB
1_27.txt 2 ms 256 KB
1_28.txt 137 ms 512 KB
1_29.txt 68 ms 512 KB
1_30.txt 140 ms 512 KB
1_31.txt 67 ms 512 KB
1_32.txt 90 ms 640 KB
1_33.txt 88 ms 640 KB
1_34.txt 50 ms 640 KB
1_35.txt 23 ms 640 KB
1_36.txt 29 ms 640 KB
1_37.txt 17 ms 640 KB
1_38.txt 17 ms 640 KB
1_39.txt 10 ms 640 KB
1_40.txt 10 ms 640 KB
1_41.txt 7 ms 640 KB
1_42.txt 2 ms 256 KB
1_43.txt 2 ms 256 KB
1_44.txt 3 ms 512 KB
1_45.txt 94 ms 384 KB
1_46.txt 95 ms 384 KB
1_47.txt 94 ms 384 KB
1_48.txt 108 ms 384 KB
1_49.txt 93 ms 384 KB