Submission #3772580


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define ALL(obj) (obj).begin(),(obj).end()
#define sortall(obj) sort(ALL(obj))
#define revall(obj) reverse(ALL(obj))
#define SortRevAll(obj) revall(sortall(obj))
typedef string str;
typedef long long ll;
const int mod=1e9+7;
const int INF=1e9;
const ll LINF=1e18;
#define V vector
#define P pair
#define F first()
#define S second()
#define PB(a) push_back(a)
#define IN(a) insert(a)
#define ins(a) int a;cin >> a
#define lls(a) ll a;cin >> a
#define in(a) cin >> a
#define sts(a) string (a);cin >> a
#define For(i,m,n) for(int i=m;i<n;i++)
#define rep(i,n) For(i,0,n)
#define Forr(i,m,n) for(int i=n-1;i>=m;i--)
#define repr(i,n) Forr(i,0,n)
#define print(a) cout << a << endl
#define Endl cout << endl
#define YES(n) cout << ((n)? "YES" : "NO") << endl
#define Yes(n) cout << ((n)? "Yes" : "No") << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE" ) << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible"  ) << endl

int main()
{
    sts(s);
    ins(x);ins(y);
    V<int>cntx,cnty;
    int sumx=0,sumy=0;
    bool ansx=false,ansy=false;
    
    int oldf=0,cnt=0;
    s.PB('T');
    rep(i,s.size()){
        if(s.at(i)=='T'){
            int plus=i-oldf-1;
            if(cnt==0){
                cntx.PB(i);
            }else if(cnt%2){
                cnty.PB(plus);
            }else{
                cntx.PB(plus);
            }
            oldf=i;
            cnt++;
        }
        
    }
    V<V<int> > rx(cntx.size()),ry(cnty.size());
    rep(i,cntx.size())rx.at(i).PB(-1);
    rep(i,cnty.size())ry.at(i).PB(-1);
    rep(i,cntx.size()){
        rx[i][0]=cntx.at(i);
        sumx+=cntx.at(i);
        For(j,1,i+1){
            rx[i][j]=rx[i][0]+rx[i-1][j-1];
        }
    }
    rep(i,cnty.size()){
        ry[i][0]=cnty.at(i);
        sumy+=cnty.at(i);
        For(j,1,i+1){
            ry[i][j]=ry[i][0]+ry[i-1][j-1];
        }
    }
    if(sumx==x)ansx=true;
    if(sumy==y)ansy=true;
    rep(i,cntx.size()){
        rep(j,i+1){
            if(x==sumx-rx[i][j]*2)ansx=true;
        }
    }
    rep(i,cnty.size()){
        rep(j,i+1){
            if(y==sumy-ry[i][j]*2)ansy=true;
        }
    }
    Yes(ansx & ansy);
    return 0;
}

Submission Info

Submission Time
Task D - FT Robot
User GochiusaLover
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2311 Byte
Status RE
Exec Time 127 ms
Memory 768 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 6
AC × 11
WA × 1
RE × 44
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 4 ms 380 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 2 ms 256 KB
1_01.txt WA 2 ms 256 KB
1_02.txt AC 2 ms 256 KB
1_03.txt AC 2 ms 256 KB
1_04.txt AC 2 ms 256 KB
1_05.txt AC 2 ms 256 KB
1_06.txt RE 109 ms 512 KB
1_07.txt RE 110 ms 512 KB
1_08.txt RE 114 ms 640 KB
1_09.txt RE 113 ms 640 KB
1_10.txt RE 113 ms 640 KB
1_11.txt RE 113 ms 640 KB
1_12.txt RE 105 ms 384 KB
1_13.txt RE 105 ms 384 KB
1_14.txt RE 107 ms 512 KB
1_15.txt RE 106 ms 512 KB
1_16.txt RE 107 ms 512 KB
1_17.txt RE 106 ms 512 KB
1_18.txt RE 107 ms 512 KB
1_19.txt RE 107 ms 512 KB
1_20.txt RE 107 ms 512 KB
1_21.txt RE 109 ms 512 KB
1_22.txt RE 108 ms 512 KB
1_23.txt RE 107 ms 512 KB
1_24.txt RE 106 ms 512 KB
1_25.txt RE 107 ms 512 KB
1_26.txt RE 126 ms 768 KB
1_27.txt RE 127 ms 768 KB
1_28.txt RE 106 ms 512 KB
1_29.txt RE 108 ms 512 KB
1_30.txt RE 101 ms 384 KB
1_31.txt RE 102 ms 384 KB
1_32.txt RE 103 ms 256 KB
1_33.txt RE 103 ms 256 KB
1_34.txt RE 104 ms 256 KB
1_35.txt RE 104 ms 256 KB
1_36.txt RE 100 ms 256 KB
1_37.txt RE 100 ms 256 KB
1_38.txt RE 102 ms 256 KB
1_39.txt RE 100 ms 256 KB
1_40.txt RE 100 ms 256 KB
1_41.txt RE 100 ms 256 KB
1_42.txt RE 104 ms 384 KB
1_43.txt RE 103 ms 384 KB
1_44.txt RE 104 ms 384 KB
1_45.txt RE 103 ms 384 KB
1_46.txt RE 104 ms 384 KB
1_47.txt RE 105 ms 384 KB
1_48.txt RE 103 ms 384 KB
1_49.txt RE 103 ms 384 KB