結果

問題 No.2278 Time Bomb Game 2
ユーザー akuaakua
提出日時 2023-04-21 22:46:59
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 6,695 bytes
コンパイル時間 5,581 ms
コンパイル使用メモリ 224,000 KB
実行使用メモリ 35,172 KB
最終ジャッジ日時 2024-11-15 04:20:48
合計ジャッジ時間 18,684 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 156 ms
34,584 KB
testcase_01 AC 156 ms
34,564 KB
testcase_02 AC 156 ms
34,468 KB
testcase_03 AC 155 ms
34,472 KB
testcase_04 AC 157 ms
34,540 KB
testcase_05 AC 155 ms
34,564 KB
testcase_06 AC 156 ms
34,708 KB
testcase_07 AC 157 ms
34,976 KB
testcase_08 AC 157 ms
34,740 KB
testcase_09 AC 158 ms
34,956 KB
testcase_10 AC 158 ms
34,992 KB
testcase_11 AC 157 ms
35,000 KB
testcase_12 AC 159 ms
35,004 KB
testcase_13 AC 157 ms
35,092 KB
testcase_14 AC 157 ms
34,960 KB
testcase_15 AC 158 ms
34,996 KB
testcase_16 AC 157 ms
34,960 KB
testcase_17 AC 157 ms
35,060 KB
testcase_18 AC 157 ms
35,024 KB
testcase_19 AC 158 ms
35,152 KB
testcase_20 AC 156 ms
34,992 KB
testcase_21 AC 158 ms
34,980 KB
testcase_22 AC 157 ms
35,112 KB
testcase_23 AC 157 ms
35,056 KB
testcase_24 AC 157 ms
34,984 KB
testcase_25 AC 156 ms
35,012 KB
testcase_26 AC 156 ms
35,000 KB
testcase_27 AC 156 ms
35,004 KB
testcase_28 AC 156 ms
35,048 KB
testcase_29 AC 155 ms
35,112 KB
testcase_30 AC 158 ms
34,992 KB
testcase_31 AC 157 ms
35,004 KB
testcase_32 AC 156 ms
35,052 KB
testcase_33 AC 158 ms
35,016 KB
testcase_34 AC 157 ms
35,136 KB
testcase_35 AC 156 ms
34,960 KB
testcase_36 AC 157 ms
34,988 KB
testcase_37 AC 157 ms
35,016 KB
testcase_38 AC 159 ms
34,928 KB
testcase_39 AC 158 ms
35,092 KB
testcase_40 AC 157 ms
35,016 KB
testcase_41 AC 158 ms
34,928 KB
testcase_42 AC 156 ms
35,108 KB
testcase_43 AC 157 ms
34,924 KB
testcase_44 AC 157 ms
35,052 KB
testcase_45 AC 156 ms
34,992 KB
testcase_46 AC 157 ms
35,068 KB
testcase_47 AC 158 ms
34,996 KB
testcase_48 AC 156 ms
35,080 KB
testcase_49 AC 157 ms
34,956 KB
testcase_50 AC 156 ms
34,992 KB
testcase_51 AC 156 ms
35,096 KB
testcase_52 AC 157 ms
35,172 KB
testcase_53 AC 157 ms
34,996 KB
testcase_54 AC 157 ms
35,104 KB
testcase_55 AC 156 ms
34,928 KB
testcase_56 AC 156 ms
35,012 KB
testcase_57 AC 157 ms
35,020 KB
testcase_58 AC 156 ms
34,984 KB
testcase_59 AC 156 ms
34,968 KB
testcase_60 AC 155 ms
35,000 KB
testcase_61 AC 156 ms
35,112 KB
testcase_62 AC 157 ms
35,108 KB
testcase_63 AC 156 ms
35,064 KB
testcase_64 AC 157 ms
35,052 KB
testcase_65 AC 156 ms
34,992 KB
testcase_66 AC 157 ms
35,004 KB
testcase_67 AC 157 ms
34,956 KB
testcase_68 AC 158 ms
35,096 KB
testcase_69 AC 157 ms
35,060 KB
testcase_70 AC 158 ms
34,988 KB
testcase_71 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <atcoder/all>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque #include <unordered_map> // unordered_map #include <unordered_set> // unordered_set #include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <iomanip>
#include <functional>
using namespace std;  
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
typedef long long ll;
typedef unsigned long long ull;
const ll inf=1e18;  
using graph = vector<vector<int> > ;
using P= pair<ll,ll>;  
using vi=vector<int>;
using vvi=vector<vi>;
using vll=vector<ll>; 
using vvll=vector<vll>;
using vp=vector<P>;
using vvp=vector<vp>;
using vd=vector<double>;
using vvd =vector<vd>;
//string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
//string S="abcdefghijklmnopqrstuvwxyz";
//g++ main.cpp -std=c++17 -I .  
//cout <<setprecision(20);
//cout << fixed << setprecision(10);
//cin.tie(0); ios::sync_with_stdio(false);
const double PI = acos(-1);
int vx[]={0,1,0,-1,-1,1,1,-1},vy[]={1,0,-1,0,1,1,-1,-1};
void putsYes(bool f){cout << (f?"Yes":"No") << endl;}
void putsYES(bool f){cout << (f?"YES":"NO") << endl;}
void putsFirst(bool f){cout << (f?"First":"Second") << endl;}
void debug(int test){cout << "TEST" << " " << test << endl;}
ll pow_pow(ll x,ll n,ll mod){
    if(n==0) return 1; 
    x%=mod;
    ll res=pow_pow(x*x%mod,n/2,mod);
    if(n&1)res=res*x%mod;
    return res;
}
ll gcd(ll x,ll y){
    if(y==0)return x;
    return gcd(y,x%y);
}
 
ll lcm(ll x,ll y){
    return ll(x/gcd(x,y))*y;
}
template<class T> bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    else return false;
}
template<class T> bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    else return false;
}
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
ll mod =998244353;
//ll mod =1e9+7;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
 
  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    //assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    if (n<0) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  } mint p(int n, int k) { return fact[n]*ifact[n-k]; } } c(2000000); 
using vm=vector<mint> ;
using vvm=vector<vm> ;
struct edge{
  int to; ll cost;
  edge(int to,ll cost) : to(to),cost(cost){}
};
using ve=vector<edge>;
using vve=vector<ve>;
struct Compress{
   vll a;
   map<ll,ll> d,d2;
   int cnt;
   Compress() :cnt(0) {}
   void add(ll x){a.push_back(x);}
   void init(){
     set<ll>s(a.begin(),a.end());
     for(auto y:s)d[y]=cnt++;
     for(auto&y:a)y=d[y];
     for(auto u:d)d2[u.second]=u.first;
   }
   ll to(ll x){return d[x];} //変換先
   ll from(ll x){return d2[x];}//逆引き
   int size(){return cnt;}
};
vll anss;
struct UnionFind { vector<int> par, siz; UnionFind(int n) : par(n, -1) , siz(n, 1) { } int root(int x) { if (par[x] == -1) return x;
        else return par[x] = root(par[x]);
    }
    bool issame(int x, int y) {
        return root(x) == root(y);
    }
    bool unite(int x, int y) {
        x = root(x), y = root(y);
        if (x == y) return false; 
        if (siz[x] < siz[y]) swap(x, y);
        par[y] = x;
        siz[x] += siz[y];
        return true;
    }
    int size(int x) {
        return siz[root(x)];
    }
};
void solve(int test){
  int n,k,t; cin >> n >> k >> t;
  string s; cin >> s;
  s='@'+s;
  int is=0;
  if(k<n && s[k]==s[k+1])is=1;
  if(k>=2 && s[k]==s[k-1])is=1;
  auto win=[&](){
    if(s[k]=='A')cout << "Alice" << endl;
    else cout << "Bob" << endl;
  };
  auto lose=[&](){
    if(s[k]=='B')cout << "Alice" << endl;
    else cout << "Bob" << endl;
  };
  if(is){
    ll d=inf;
    for(int i=1; i<=n; i++){
      if(s[i]!=s[k])chmin(d,abs(i-k)+0ll);
    }
    if(d>t)lose();
    else {
      int ok=0;
      for(int i=k-1; i>=1; i--){
        if(s[i]!=s[k]){
           if(abs(i-k)<=t && abs(i-k)%2==t%2)ok=1;
           break;
        }
      }
      for(int i=k+1; i<=n; i++){
        if(s[i]!=s[k]){
           if(abs(i-k)<=t && abs(i-k)%2==t%2)ok=1;
           break;
        }
      }
      if(ok)win();
      else lose();
    }
  }
  else {
    if(t%2==0)lose();
    else {
      int cnt=0;
      for(int i=k+1; i<=n; i++){
        if(s[i]==s[k]){
          if(t%2==abs(i-k)%2 && abs(i-k)<=t)cnt++;
          break;
        }
      }
      for(int i=k-1; i>=1; i--){
        if(s[i]==s[k]){
          if(t%2==abs(i-k)%2 && abs(i-k)<=t)cnt++;
          break;
        }
      }
      if(k>1)cnt--;
      if(k<n)cnt--;
      if(cnt>0)lose();
      else win();
    }
  }
}
//g++ main.cpp -std=c++17 -I .
int main(){cin.tie(0);ios::sync_with_stdio(false);
  int t=1;//cin >> t;
  rep(test,t)solve(test);
  for(auto u:anss)cout << u << endl;
}
0