Submission #1997836


Source Code Expand

#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e12;

vector<string> split(const string &s,char c=' '){
    vector<string> ret;
    stringstream ss(s);
    string t;
    while(getline(ss,t,c)){
        ret.push_back(t);
    }
    return ret;
}

bool dp[16020], tmp[16020];

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    string s;
    int x, y;
    cin >> s >> x >> y;
    vector<string> t = split(s, 'T');
    vector<int> a, b;
    rep(i, 0, t.size()){
        if(i % 2 == 0) a.push_back(t[i].size());
        else b.push_back(t[i].size());
    }
    dp[8010 + a[0]] = true;
    rep(i, 1, a.size()){
        rep(j, 0, 16020) tmp[j] = false;
        rep(j, 0, 16020){
            if(dp[j]){
                tmp[j - a[i]] = true;
                tmp[j + a[i]] = true;
            }
        }
        swap(dp, tmp);
    }
    bool ans = dp[8010 + x];
    rep(i, 0, 16020) dp[i] = false;
    dp[8010] = true;
    rep(i, 0, b.size()){
        rep(j, 0, 16020) tmp[j] = false;
        rep(j, 0, 16020){
            if(dp[j]){
                tmp[j - b[i]] = true;
                tmp[j + b[i]] = true;
            }
        }
        swap(dp, tmp);
    }
    ans &= dp[8010 + y];
    if(ans) cout << "Yes" << endl;
    else cout << "No" << endl;
}

Submission Info

Submission Time
Task D - FT Robot
User treeone
Language C++14 (GCC 5.4.1)
Score 500
Code Size 1649 Byte
Status AC
Exec Time 224 ms
Memory 640 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 384 KB
1_03.txt AC 1 ms 384 KB
1_04.txt AC 1 ms 384 KB
1_05.txt AC 1 ms 384 KB
1_06.txt AC 114 ms 640 KB
1_07.txt AC 114 ms 640 KB
1_08.txt AC 151 ms 640 KB
1_09.txt AC 152 ms 640 KB
1_10.txt AC 151 ms 640 KB
1_11.txt AC 152 ms 640 KB
1_12.txt AC 80 ms 512 KB
1_13.txt AC 80 ms 512 KB
1_14.txt AC 122 ms 640 KB
1_15.txt AC 122 ms 640 KB
1_16.txt AC 114 ms 640 KB
1_17.txt AC 113 ms 640 KB
1_18.txt AC 112 ms 640 KB
1_19.txt AC 111 ms 640 KB
1_20.txt AC 112 ms 640 KB
1_21.txt AC 113 ms 640 KB
1_22.txt AC 113 ms 640 KB
1_23.txt AC 112 ms 640 KB
1_24.txt AC 115 ms 640 KB
1_25.txt AC 111 ms 640 KB
1_26.txt AC 219 ms 512 KB
1_27.txt AC 224 ms 512 KB
1_28.txt AC 111 ms 640 KB
1_29.txt AC 114 ms 640 KB
1_30.txt AC 58 ms 384 KB
1_31.txt AC 55 ms 384 KB
1_32.txt AC 31 ms 384 KB
1_33.txt AC 29 ms 384 KB
1_34.txt AC 15 ms 384 KB
1_35.txt AC 14 ms 384 KB
1_36.txt AC 8 ms 384 KB
1_37.txt AC 10 ms 384 KB
1_38.txt AC 5 ms 384 KB
1_39.txt AC 5 ms 384 KB
1_40.txt AC 3 ms 384 KB
1_41.txt AC 3 ms 384 KB
1_42.txt AC 84 ms 512 KB
1_43.txt AC 83 ms 512 KB
1_44.txt AC 84 ms 512 KB
1_45.txt AC 88 ms 512 KB
1_46.txt AC 77 ms 512 KB
1_47.txt AC 85 ms 512 KB
1_48.txt AC 81 ms 512 KB
1_49.txt AC 88 ms 512 KB