結果
問題 | No.2278 Time Bomb Game 2 |
ユーザー | akiaa11 |
提出日時 | 2023-08-24 20:25:45 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,968 bytes |
コンパイル時間 | 4,481 ms |
コンパイル使用メモリ | 265,268 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-02 09:54:11 |
合計ジャッジ時間 | 5,898 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 3 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 2 ms
5,376 KB |
testcase_18 | AC | 2 ms
5,376 KB |
testcase_19 | AC | 2 ms
5,376 KB |
testcase_20 | AC | 2 ms
5,376 KB |
testcase_21 | AC | 2 ms
5,376 KB |
testcase_22 | WA | - |
testcase_23 | AC | 2 ms
5,376 KB |
testcase_24 | AC | 2 ms
5,376 KB |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | AC | 2 ms
5,376 KB |
testcase_32 | AC | 2 ms
5,376 KB |
testcase_33 | AC | 2 ms
5,376 KB |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | AC | 2 ms
5,376 KB |
testcase_37 | AC | 2 ms
5,376 KB |
testcase_38 | AC | 2 ms
5,376 KB |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | AC | 2 ms
5,376 KB |
testcase_42 | WA | - |
testcase_43 | AC | 2 ms
5,376 KB |
testcase_44 | AC | 2 ms
5,376 KB |
testcase_45 | AC | 2 ms
5,376 KB |
testcase_46 | WA | - |
testcase_47 | AC | 2 ms
5,376 KB |
testcase_48 | WA | - |
testcase_49 | AC | 3 ms
5,376 KB |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | AC | 2 ms
5,376 KB |
testcase_53 | AC | 2 ms
5,376 KB |
testcase_54 | AC | 3 ms
5,376 KB |
testcase_55 | AC | 2 ms
5,376 KB |
testcase_56 | WA | - |
testcase_57 | AC | 2 ms
5,376 KB |
testcase_58 | WA | - |
testcase_59 | AC | 2 ms
5,376 KB |
testcase_60 | WA | - |
testcase_61 | WA | - |
testcase_62 | AC | 2 ms
5,376 KB |
testcase_63 | WA | - |
testcase_64 | AC | 2 ms
5,376 KB |
testcase_65 | WA | - |
testcase_66 | WA | - |
testcase_67 | AC | 3 ms
5,376 KB |
testcase_68 | WA | - |
testcase_69 | AC | 2 ms
5,376 KB |
testcase_70 | AC | 3 ms
5,376 KB |
testcase_71 | AC | 1 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> #define SELECTER(_1,_2,_3,SELECT,...) SELECT #define rep1(i,n) for(int i=0;i<(int)n;++i) #define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i) #define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__) #define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT #define rrep1(i,n) for(int i=(int)n-1;i>=0;--i) #define rrep2(i,a,n) for(int i=(int)n-1;i>=(int)a;--i) #define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define fi first #define se second #define PrintR LogOutput #ifdef _DEBUG #define Log(...) LogOutput(__VA_ARGS__) #else #define Log(...) #endif using namespace std; using namespace atcoder; using ll=long long; using pii=pair<int,int>; using pll=pair<long long,long long>; using pdd=pair<long double,long double>; using veci=vector<int>; using vecpii=vector<pair<int,int>>; using vecll=vector<long long>; using vecpll=vector<pair<long long,long long>>; using vecpdd=vector<pair<long double,long double>>; using vecs=vector<string>; using vecb=vector<bool>; using vecd=vector<long double>; using tp=tuple<int,int,int>; using tpll=tuple<ll,ll,ll>; using mint=modint998244353; using mint10=modint1000000007; template<typename T, typename S> istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;} template<typename T, typename S> ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;} ostream& operator<<(ostream& out, const mint& a){return out << a.val();} ostream& operator<<(ostream& out, const mint10& a){return out << a.val();} ostream& operator<<(ostream& out, const modint& a){return out << a.val();} template<typename T> ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;} template<typename T, typename S> pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};} template<typename T, typename S> pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};} template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;} template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;} bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;} constexpr ll INF=numeric_limits<ll>::max() / 4; constexpr ll MOD=998244353; const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0}; template<typename... Args> void LogOutput(Args&&... args){ stringstream ss; ((ss << args << ' '), ...); cout << ss.str().substr(0, ss.str().length() - 1) << endl; } template<typename T> void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);} bool check(int l, int r, int k, int t, int n){ if(r - l == 2){ if(t == 1) return true; return false; } if(l >= 0 && k - l <= t && (k - l) % 2 == t % 2) return true; if(r < n && r - k <= t && (r - k) % 2 == t % 2) return true; return false; } int main(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); int n, k, t;cin>>n>>k>>t; string s;cin>>s; auto f = [&](int u) -> pii { int l = u, r = u; while(l >= 0 && s[u] == s[l]) l--; while(r < n && s[u] == s[r]) r++; return make_pair(l, r); }; vecs ans = {"Bob", "Alice"}; k--; auto [l, r] = f(k); if(check(l, r, k, t, n)) cout<<ans[s[k] == 'A']<<endl; else if(t < k - l && t < r - k) cout<<ans[!(s[k] == 'A')]<<endl; else{ int p = 1; if(l >= 0 && t >= k - l){ int u = t - (k - l); auto [l2, r2] = f(l); if(check(l2, r2, l, u, n)){ cout<<ans[s[l] == 'A']<<endl; return 0; } p &= (r - l == 2); } if(r < n && t >= r - k){ int u = t - (r - k); auto [l2, r2] = f(r); if(check(l2, r2, r, u, n)){ cout<<ans[s[r] == 'A']<<endl; return 0; } p &= (r - l == 2); } if(p) cout<<ans[t % 2]<<endl; else cout<<ans[s[k] == 'A']<<endl; } }