Submission #2009661
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define fs first #define sc second #define pb emplace_back #define mp make_pair #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(), v.rend() const int32_t inf = 1001001001; const int64_t infll = 1001001001001001001ll; const int dx[] = {0, -1, 1, 0, -1, 1, -1, 1}, dy[] = {-1, 0, 0, 1, -1, -1, 1, 1}; template <typename T> using vector2d = vector<vector<T>>; // clang-format off template <typename T> void sort(vector<T> &v) { sort(all(v)); } // ostream &operator<<(ostream &os, __int128_t value) { if (ostream::sentry(os)) { __uint128_t tmp = value < 0 ? -value : value; char buffer[64]; char *d = end(buffer); do { --d; *d = "0123456789"[tmp % 10]; tmp /= 10; } while (tmp != 0); if (value < 0) { --d; *d = '-'; } int len = end(buffer) - d; if (os.rdbuf()->sputn(d, len) != len) { os.setstate(ios_base::badbit); }} return os; } // istream &operator>>(istream &is, __int128_t &value) { string in; is >> in; value = 0; for (const char &c : in) { if ('0' <= c && c <= '9') value = 10 * value + (c - '0'); } if (in[0] == '-') value *= -1; return is; } // ostream &operator<<(ostream &os, __uint128_t value) { if (ostream::sentry(os)) { char buffer[64]; char *d = end(buffer); do { --d; *d = "0123456789"[value % 10]; value /= 10; } while (value != 0); int len = end(buffer) - d; if (os.rdbuf()->sputn(d, len) != len) { os.setstate(ios_base::badbit); }} return os; } // istream &operator>>(istream &is, __uint128_t &value) { string in; is >> in; value = 0; for (const char &c : in) { if ('0' <= c && c <= '9') value = 10 * value + (c - '0'); } return is; } template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { os << v[0]; for (int i = 1; i < v.size(); ++i) os << " " << v[i]; return os; } template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; } template <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { os << p.fs << " " << p.sc; return os; } template <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.fs >> p.sc; return is; } struct IoSetup { IoSetup(){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); } } iosetup; inline int64_t in() { int64_t x = 0; cin >> x; return x; } template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); } // clang-format on signed main(int argc, char *argv[]) { string s; cin >> s; int x = in(), y = in(); s += "T"; vector<int> a[2]; int cnt = 0, idx = 0; for (int i = 0; i < s.size(); ++i) { if (s[i] == 'T') { a[idx & 1].pb(cnt); cnt = 0; idx++; } else { cnt++; } } bitset<16010> latte, malta; latte[a[0][0] + 8000] = malta[8000] = true; for (int i = 1; i < a[0].size(); ++i) { latte = (latte << a[0][i]) | (latte >> a[0][i]); } for (int i = 0; i < a[1].size(); ++i) { malta = (malta << a[1][i]) | (malta >> a[1][i]); } if (latte[x + 8000] && malta[y + 8000]) { puts("Yes"); } else { puts("No"); } }
Submission Info
Submission Time | |
---|---|
Task | D - FT Robot |
User | Luzhiled |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 3292 Byte |
Status | AC |
Exec Time | 6 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
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 | 6 ms | 256 KB |
1_07.txt | AC | 6 ms | 256 KB |
1_08.txt | AC | 6 ms | 384 KB |
1_09.txt | AC | 6 ms | 384 KB |
1_10.txt | AC | 6 ms | 384 KB |
1_11.txt | AC | 6 ms | 384 KB |
1_12.txt | AC | 4 ms | 256 KB |
1_13.txt | AC | 4 ms | 256 KB |
1_14.txt | AC | 5 ms | 256 KB |
1_15.txt | AC | 5 ms | 256 KB |
1_16.txt | AC | 5 ms | 256 KB |
1_17.txt | AC | 5 ms | 256 KB |
1_18.txt | AC | 5 ms | 256 KB |
1_19.txt | AC | 5 ms | 256 KB |
1_20.txt | AC | 5 ms | 256 KB |
1_21.txt | AC | 5 ms | 256 KB |
1_22.txt | AC | 5 ms | 256 KB |
1_23.txt | AC | 5 ms | 256 KB |
1_24.txt | AC | 5 ms | 256 KB |
1_25.txt | AC | 5 ms | 256 KB |
1_26.txt | AC | 6 ms | 384 KB |
1_27.txt | AC | 6 ms | 384 KB |
1_28.txt | AC | 5 ms | 256 KB |
1_29.txt | AC | 5 ms | 256 KB |
1_30.txt | AC | 3 ms | 256 KB |
1_31.txt | AC | 3 ms | 256 KB |
1_32.txt | AC | 2 ms | 256 KB |
1_33.txt | AC | 2 ms | 256 KB |
1_34.txt | AC | 2 ms | 256 KB |
1_35.txt | AC | 2 ms | 256 KB |
1_36.txt | AC | 2 ms | 256 KB |
1_37.txt | AC | 2 ms | 256 KB |
1_38.txt | AC | 1 ms | 256 KB |
1_39.txt | AC | 1 ms | 256 KB |
1_40.txt | AC | 1 ms | 256 KB |
1_41.txt | AC | 1 ms | 256 KB |
1_42.txt | AC | 4 ms | 256 KB |
1_43.txt | AC | 4 ms | 256 KB |
1_44.txt | AC | 4 ms | 256 KB |
1_45.txt | AC | 4 ms | 256 KB |
1_46.txt | AC | 4 ms | 256 KB |
1_47.txt | AC | 4 ms | 256 KB |
1_48.txt | AC | 4 ms | 256 KB |
1_49.txt | AC | 4 ms | 256 KB |