#861483 (C++17) No.2278 Time Bomb Game 2

提出ソース

結果

問題	No.2278 Time Bomb Game 2
ユーザー	mtsd
提出日時	2023-04-21 22:11:33
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	11,588 bytes
コンパイル時間	2,173 ms
コンパイル使用メモリ	206,772 KB
実行使用メモリ	6,824 KB
最終ジャッジ日時	2024-11-06 15:42:05
合計ジャッジ時間	4,538 ms
ジャッジサーバーID （参考情報）	judge4 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	WA	-
testcase_03	AC	2 ms 6,816 KB
testcase_04	WA	-
testcase_05	AC	2 ms 6,820 KB
testcase_06	AC	3 ms 6,820 KB
testcase_07	AC	6 ms 6,816 KB
testcase_08	WA	-
testcase_09	AC	6 ms 6,820 KB
testcase_10	AC	8 ms 6,816 KB
testcase_11	AC	7 ms 6,816 KB
testcase_12	AC	7 ms 6,816 KB
testcase_13	AC	7 ms 6,820 KB
testcase_14	AC	7 ms 6,816 KB
testcase_15	AC	8 ms 6,820 KB
testcase_16	AC	7 ms 6,820 KB
testcase_17	AC	7 ms 6,816 KB
testcase_18	AC	7 ms 6,820 KB
testcase_19	AC	6 ms 6,816 KB
testcase_20	AC	7 ms 6,816 KB
testcase_21	AC	7 ms 6,816 KB
testcase_22	AC	7 ms 6,820 KB
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-
testcase_34	WA	-
testcase_35	WA	-
testcase_36	WA	-
testcase_37	AC	7 ms 6,816 KB
testcase_38	AC	7 ms 6,820 KB
testcase_39	AC	7 ms 6,820 KB
testcase_40	AC	7 ms 6,820 KB
testcase_41	AC	7 ms 6,820 KB
testcase_42	AC	7 ms 6,820 KB
testcase_43	AC	7 ms 6,820 KB
testcase_44	AC	7 ms 6,820 KB
testcase_45	AC	7 ms 6,820 KB
testcase_46	AC	7 ms 6,820 KB
testcase_47	AC	8 ms 6,816 KB
testcase_48	AC	7 ms 6,816 KB
testcase_49	AC	7 ms 6,820 KB
testcase_50	WA	-
testcase_51	AC	6 ms 6,820 KB
testcase_52	AC	7 ms 6,820 KB
testcase_53	AC	7 ms 6,820 KB
testcase_54	WA	-
testcase_55	AC	7 ms 6,820 KB
testcase_56	WA	-
testcase_57	AC	7 ms 6,820 KB
testcase_58	AC	7 ms 6,816 KB
testcase_59	AC	7 ms 6,816 KB
testcase_60	AC	7 ms 6,820 KB
testcase_61	AC	7 ms 6,816 KB
testcase_62	AC	7 ms 6,820 KB
testcase_63	WA	-
testcase_64	AC	7 ms 6,820 KB
testcase_65	AC	7 ms 6,816 KB
testcase_66	AC	7 ms 6,816 KB
testcase_67	AC	7 ms 6,816 KB
testcase_68	AC	7 ms 6,820 KB
testcase_69	AC	7 ms 6,816 KB
testcase_70	AC	7 ms 6,820 KB
testcase_71	AC	2 ms 6,816 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define inf 1000000007
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define rrep(i,n) for(int i = (int)n-1; i >= 0; --i)
#define srep(i,a,b) for(int i = (int)a; i < (int)(b); ++i)
#define all(x) (x).begin(),(x).end()
#define SUM(v) accumulate(all(v), 0LL)
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())
#define SZ(c) (int)(c).size()
template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
    os << "{";
    for (int i = 0; i<(int)vec.size(); i++) {
        os << vec[i] << (i + 1 == (int)vec.size() ? "" : ", ");
    }
    os << "}";
    return os;
}
// pair出力
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U> pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}
// map出力
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
    os << "{";
    for(auto itr = map_var.begin(); itr != map_var.end(); itr++){
        os << "(" << itr->first << ", " << itr->second << ")";
        itr++;
        if(itr != map_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
// set 出力
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
    os << "{";
    for(auto itr = set_var.begin(); itr != set_var.end(); itr++){
        os << (*itr);
        ++itr;
        if(itr != set_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
// tuple 出力
template<int N,class Tuple>
void out(ostream &os,const Tuple &t){}
template<int N,class Tuple,class H,class ...Ts>
void out(ostream &os,const Tuple &t){
    if(N)os<<", ";
    os<<get<N>(t);
    out<N+1,Tuple,Ts...>(os,t);
}
template<class ...Ts>
ostream& operator<<(ostream &os, const tuple<Ts...> &t){
    os<<"(";
    out<0,tuple<Ts...>,Ts...>(os,t);
    os<<")";
    return os;
}
#define overload2(_1, _2, name, ...) name
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size)                                                                                                                                  \
    vector<type> name(size);                                                                                                                                   \
    IN(name)
#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, w)                                                                                                                                   \
    vector<vector<type>> name(h, vector<type>(w));                                                                                                             \
    IN(name)
#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...)                                                                                                                         \
    vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
#define INT(...)                                                                                                                                               \
    int __VA_ARGS__;                                                                                                                                           \
    IN(__VA_ARGS__)
#define LL(...)                                                                                                                                                \
    ll __VA_ARGS__;                                                                                                                                            \
    IN(__VA_ARGS__)
#define STR(...)                                                                                                                                               \
    string __VA_ARGS__;                                                                                                                                        \
    IN(__VA_ARGS__)
#define CHR(...)                                                                                                                                               \
    char __VA_ARGS__;                                                                                                                                          \
    IN(__VA_ARGS__)
#define DBL(...)                                                                                                                                               \
    double __VA_ARGS__;                                                                                                                                        \
    IN(__VA_ARGS__)
int scan() { return getchar(); }
void scan(int &a) { cin >> a; }
void scan(long long &a) { cin >> a; }
void scan(char &a) { cin >> a; }
void scan(double &a) { cin >> a; }
void scan(string &a) { cin >> a; }
template <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }
template <class T> void scan(vector<T> &);
template <class T> void scan(vector<T> &a) {
    for(auto &i : a) scan(i);
}
template <class T> void scan(T &a) { cin >> a; }
void IN() {}
template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {
    scan(head);
    IN(tail...);
}
const string YESNO[2] = {"NO", "YES"};
const string YesNo[2] = {"No", "Yes"};
const string yesno[2] = {"no", "yes"};
void YES(bool t = 1) { cout << YESNO[t] << endl; }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { cout << YesNo[t] << endl; }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { cout << yesno[t] << endl; }
void no(bool t = 1) { yes(!t); }
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#define dbg(...) \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define dbg(...) (void(0))
#define dump(x) (void(0))
#endif
template<typename A, typename T>
std::enable_if_t<std::is_convertible<T, A>::value> fill(A& array, const T& val)
{
    array = val;
}
template<typename A, typename T>
std::enable_if_t<!std::is_convertible<T, A>::value> fill(A& array, const T& val)
{
    for (auto& a : array) {
        fill(a, val);
    }
}
template <typename T, typename S> T ceil(T x, S y) {
    assert(y);
    return (y < 0 ? ceil(-x, -y) : (x > 0 ? (x + y - 1) / y : x / y));
}
template <typename T, typename S> T floor(T x, S y) {
    assert(y);
    return (y < 0 ? floor(-x, -y) : (x > 0 ? x / y : x / y - (x % y == 0 ? 0 : 1)));
}
vector<int> iota(int n) {vector<int> a(n);iota(all(a), 0);return a;}
template <class T> T POW(T x, int n) {T res = 1;for(; n; n >>= 1, x *= x){if(n & 1) res *= x;}return res;}
ll pow2(int i) { return 1LL << i; }
int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }
// int allbit(int n) { return (1 << n) - 1; }
ll allbit(ll n) { return (1LL << n) - 1; }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }


template <class S> void fold_in(vector<S> &v) {}
template <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {
    for(auto e : a) v.emplace_back(e);
    fold_in(v, tail...);
}
template <class S> void renumber(vector<S> &v) {}
template <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {
    for(auto &&e : a) e = lb(v, e);
    renumber(v, tail...);
}
template <class S, class... Args> void zip(vector<S> &head, Args &&...args) {
    vector<S> v;
    fold_in(v, head, args...);
    sort(all(v)), v.erase(unique(all(v)), v.end());
    renumber(v, head, args...);
}
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;
}



int main(){
    INT(n,K,T);
    K--;
    STR(s);
    int c = (K+T)%2;
    vector<int> f(n);
    rep(i,n){
        f[i] = ((i%2)==c);
    }
    {
        int left = K;
        while(left>=0&&s[left]==s[K]){
            left--;
        }
        left++;
        int right = K;
        while(right<n&&s[right]==s[K]){
            right++;
        }
        right--;
        if(right-left!=0){
            if(left-1>=0&&f[left-1]&&K-left+1 <=T){
                if(s[K]=='A'){
                    cout << "Alice\n";
                }else{
                    cout << "Bob\n";
                }
                return 0;
            }
            if(right+1<n&&f[right+1]&&right+1-K <= T){
                if(s[K]=='A'){
                    cout << "Alice\n";
                }else{
                    cout << "Bob\n";
                }
                return 0;
            }
            if(s[K]!='A'){
                cout << "Alice\n";
            }else{
                cout << "Bob\n";
            }
            return 0;
        }
    }
    if(f[K]){
        if(s[K]!='A'){
            cout << "Alice\n";
        }else{
            cout << "Bob\n";
        }
        return 0;
    }
    T--;
    if(K<n){
        K++;
        int left = K;
        while(left>=0&&s[left]==s[K]){
            left--;
        }
        left++;
        int right = K;
        while(right<n&&s[right]==s[K]){
            right++;
        }
        right--;
        if(right-left!=0){
            if(left-1>=0&&f[left-1]&&K-left+1 <=T){
                
            }else{
                if(right+1<n&&f[right+1]&&right+1-K <= T){
                    
                }else{
                    if(s[K]!='A'){
                        cout << "Alice\n";
                    }else{
                        cout << "Bob\n";
                    }
                    return 0;
                }
            }
        }
        K--;
    }
    if(K>0){
        K--;
        int left = K;
        while(left>=0&&s[left]==s[K]){
            left--;
        }
        left++;
        int right = K;
        while(right<n&&s[right]==s[K]){
            right++;
        }
        right--;
        if(right-left!=0){
            if(left-1>=0&&f[left-1]&&K-left+1 <=T){
                
            }else{
                if(right+1<n&&f[right+1]&&right+1-K <= T){
                    
                }else{
                    if(s[K]!='A'){
                        cout << "Alice\n";
                    }else{
                        cout << "Bob\n";
                    }
                        
                    return 0;
                }
            }
        }
        K++;
    }
    if(s[K]=='A'){
        cout << "Bob\n";
    }else{
        cout << "Alice\n";
    }
    return 0;
}

yukicoder

結果

テストケース

ソースコード