結果

問題 No.1506 Unbalanced Pocky Game
ユーザー s0j1sans0j1san
提出日時 2021-05-14 23:08:33
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 76 ms / 2,000 ms
コード長 8,456 bytes
コンパイル時間 2,009 ms
コンパイル使用メモリ 186,632 KB
実行使用メモリ 15,104 KB
最終ジャッジ日時 2024-10-02 04:01:19
合計ジャッジ時間 5,716 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 4 ms
5,248 KB
testcase_04 AC 30 ms
10,240 KB
testcase_05 AC 34 ms
11,380 KB
testcase_06 AC 22 ms
8,064 KB
testcase_07 AC 17 ms
6,656 KB
testcase_08 AC 23 ms
8,320 KB
testcase_09 AC 37 ms
11,776 KB
testcase_10 AC 37 ms
11,904 KB
testcase_11 AC 17 ms
6,912 KB
testcase_12 AC 15 ms
6,400 KB
testcase_13 AC 9 ms
5,248 KB
testcase_14 AC 17 ms
6,784 KB
testcase_15 AC 14 ms
6,144 KB
testcase_16 AC 37 ms
11,648 KB
testcase_17 AC 18 ms
7,296 KB
testcase_18 AC 12 ms
5,760 KB
testcase_19 AC 11 ms
5,248 KB
testcase_20 AC 36 ms
11,860 KB
testcase_21 AC 15 ms
6,528 KB
testcase_22 AC 24 ms
8,832 KB
testcase_23 AC 2 ms
5,248 KB
testcase_24 AC 2 ms
5,248 KB
testcase_25 AC 49 ms
15,104 KB
testcase_26 AC 73 ms
14,848 KB
testcase_27 AC 75 ms
14,848 KB
testcase_28 AC 71 ms
14,232 KB
testcase_29 AC 73 ms
14,568 KB
testcase_30 AC 76 ms
14,896 KB
testcase_31 AC 76 ms
14,904 KB
testcase_32 AC 74 ms
14,848 KB
testcase_33 AC 74 ms
14,848 KB
testcase_34 AC 72 ms
14,424 KB
testcase_35 AC 73 ms
14,592 KB
testcase_36 AC 2 ms
5,248 KB
testcase_37 AC 2 ms
5,248 KB
testcase_38 AC 2 ms
5,248 KB
testcase_39 AC 2 ms
5,248 KB
testcase_40 AC 2 ms
5,248 KB
testcase_41 AC 2 ms
5,248 KB
testcase_42 AC 2 ms
5,248 KB
testcase_43 AC 2 ms
5,248 KB
testcase_44 AC 2 ms
5,248 KB
testcase_45 AC 2 ms
5,248 KB
testcase_46 AC 27 ms
7,168 KB
testcase_47 AC 11 ms
5,248 KB
testcase_48 AC 14 ms
5,248 KB
testcase_49 AC 32 ms
7,808 KB
testcase_50 AC 28 ms
7,424 KB
testcase_51 AC 30 ms
7,808 KB
testcase_52 AC 24 ms
6,824 KB
testcase_53 AC 36 ms
8,704 KB
testcase_54 AC 16 ms
5,248 KB
testcase_55 AC 11 ms
5,248 KB
testcase_56 AC 11 ms
5,248 KB
testcase_57 AC 27 ms
7,296 KB
testcase_58 AC 10 ms
5,248 KB
testcase_59 AC 6 ms
5,248 KB
testcase_60 AC 17 ms
5,760 KB
testcase_61 AC 27 ms
7,168 KB
testcase_62 AC 22 ms
6,528 KB
testcase_63 AC 16 ms
5,632 KB
testcase_64 AC 30 ms
7,808 KB
testcase_65 AC 17 ms
5,888 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#include <boost/multiprecision/cpp_int.hpp>
//#include <boost/multiprecision/cpp_dec_float.hpp>
using namespace std;
 //namespace mpp = boost::multiprecision;
//#include<atcoder/all>
//#include<atcoder/segtree>
//#include<atcoder/lazysegtree>
//#include<atcoder/scc>
//using namespace atcoder;

using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";

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; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
typedef std::vector<std::vector<int>> VV;
typedef std::vector<std::vector<ll>> VVL;

//ll mod = 998244353ll;
const ll mod = 1000000007ll;
//ll mod;

//const ll mod = 3;

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 modhttps://atcoder.jp/contests/abc166/submit?taskScreenName=abc166_f
  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;}


#define rep(i, n)         for(ll i = 0; i < (ll)(n); i++)
//#define rep(i, n)         for(int i = 0; i < (int)(n); i++)
#define brep(n)           for(int bit=0;bit<(1<<n);bit++)
#define bbrep(n)           for(int bbit=0;bbit<(1<<n);bbit++)
#define erep(i,container) for (auto &i : container)
#define itrep(i,container) for (auto i : container)
#define irep(i, n)        for(ll i = n-1; i >= (ll)0ll; i--)
#define rrep(i,m,n) for(ll i = m; i < (ll)(n); i++)
#define reprep(i,j,h,w) rep(i,h)rep(j,w)
#define repreprep(i,j,k,h,w,n) rep(i,h)rep(j,w)rep(k,n)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define VEC(type,name,n) std::vector<type> name(n);rep(i,n)std::cin >> name[i];
#define pb push_back
//#define pb emplace_back
#define pf push_front
#define query int qq;std::cin >> qq;rep(qqq,qq)
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define itn int
#define mp make_pair
//#define sum(a) accumulate(all(a),0ll)
#define keta fixed<<setprecision
#define kout(d) std::cout << keta(10)<< d<< std::endl;
#define vout(a) erep(qxqxqx,a)std::cout << qxqxqx << ' ';std::cout  << std::endl;
#define vvector(name,typ,m,n,a)vector<vector<typ> > name(m,vector<typ> (n,a))
//#define vvector(name,typ,m,n)vector<vector<typ> > name(m,vector<typ> (n))
#define vvvector(name,t,l,m,n,a) vector<vector<vector<t> > > name(l, vector<vector<t> >(m, vector<t>(n,a)));
#define vvvvector(name,t,k,l,m,n,a) vector<vector<vector<vector<t> > > > name(k,vector<vector<vector<t> > >(l, vector<vector<t> >(m, vector<t>(n,a)) ));
//#define case std::cout <<"Case #" <<qqq+1<<":"
#define RES(a,iq,jq) a.resize(iq);rep(iii,iq)a[iii].resize(jq);

#define RESRES(a,i,j,k) a.resize(i);rep(ii,i)a[ii].resize(j);reprep(ii,jj,i,j){a[ii][jj].resize(k);};
#define res resize
#define as assign
#define ffor for(;;)
#define ppri(a,b) std::cout << a<<" "<<b << std::endl
#define pppri(a,b,c) std::cout << a<<" "<<b <<" "<< c<<std::endl
#define ppppri(a,b,c,d) std::cout << a<<" "<<b <<" "<< c<<' '<<d<<std::endl
#define aall(x,n) (x).begin(),(x).begin()+(n)
#define SUMI(a) accumulate(all(a),0) 
#define SUM(a) accumulate(all(a),0ll) 
#define stirng string
#define gin(a,b) int a,b;std::cin >> a>>b;a--;b--;
#define popcount __builtin_popcountll
#define permu(a) next_permutation(all(a))
#define aru(a,d) a.find(d)!=a.end()
#define nai(a,d) a.find(d)==a.end()
#define ansprint1(a,b,c) std::cout << a<<','<<b <<','<<c << std::endl;
#define ansprint2(a,b,c,d,e) std::cout << a<<','<<b <<','<<c <<','<<d<<','<<e<< std::endl;


//typedef long long T;
ll ceili(ll a,ll b){
    return ((a+b-1)/b);
}
const int INF = 2000000000;
//const ll INF64 =922330720854775807ll;
//const ll INF64 = 4223372036854775807ll;
//const ll INF64 = 9223372036854775807ll;

//const ll INF64 = 243'000'000'000'000'000'0;
const ll INF64 = 2430000000000000000;


const ll MOD = 1000000007ll;
//const ll MOD = 998244353ll;
//const ll MOD = 1000003ll;
//const ll MOD = 3;
const ll OD = 1000000000000007ll;
const dou pi=3.141592653589793;

//mod=MOD;

long long modpow(long long a, long long n) { 
    long long res = 1;
    a%=MOD;
    while (n > 0) {
        if (n & 1) res = res * a % MOD;
        a = a * a % MOD;
        n >>= 1;
    }
    return res;
}
vector< ll > divisor(ll n) {  
  vector< ll > ret;
  for(ll i = 1; i * i <= n; i++) {
    if(n % i == 0) {
      ret.push_back(i);
      if(i * i != n) ret.push_back(n / i);
    }
  }
  sort(begin(ret), end(ret));
  return (ret);
}


map< ll, ll > prime_factor(ll n) {
  map< ll, ll > ret;
  for(ll i = 2; i * i <= n; i++) {
    while(n % i == 0) {
      ret[i]++;
      n /= i;
    }
  }
  if(n != 1) ret[n] = 1;
  return ret;
}

bool IsPrime(ll num)
{
    if (num < 2ll) return false;
    else if (num == 2ll) return true;
    else if (num % 2ll == 0ll) return false; 

    double sqrtNum = sqrt(num);
    for (ll i = 3ll; i <= sqrtNum; i += 2ll)
    {
        if (num % i == 0ll)
        {
            return false;
        }
    }

    return true;
}
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }
 
    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
//メモ


    //unordered_set,mapを使うときは
//unordered_set<type, custom_hash >などとする
//↑https://codeforces.com/blog/entry/62393

//COMinit()周りにfac[max]があるので使うといいかも
//役所に手紙を送る
//電気代を払う

int main(){
    int n;
    std::cin >> n;
    VEC(int,a,n);
//    reverse(all(a));
    vvector(dp,int,n,2,0);
    if(n==1){
        std::cout << "Alice" << std::endl;
        return 0;;
    }
    dp[0][0]=0;
    dp[0][1]=0;
    dp[1][0]=1;
    rrep(i,2,n){
        bool ok=0;
        if(a[i]==1){
            if(a[i-1]==1){
                if(dp[i-1][0])ok=1;
                
            }
            else{
                if(dp[i-1][1])ok=1;
            }
            if(ok)dp[i][0]=0;
            else dp[i][0]=1;
        }
        
        else{
            if(a[i-1]==1){
                if(dp[i-1][0])ok=1;
                
            }
            else{
                if(dp[i-1][1])ok=1;
            }
            if(ok)dp[i][0]=0;
            else dp[i][0]=1;
            ok=0;
            if(a[i-1]==1){
                if(dp[i-1][0])ok=1;
                if(dp[i][0])ok=1;
            }
            else{
                if(dp[i-1][1])ok=1;
                if(dp[i][0])ok=1;
            }
            if(ok||a[i]>=3)dp[i][1]=0;
            else dp[i][1]=1;
            
        }
        
    }
    /*
    rep(i,n){
        std::cout << dp[i][0] << ' ';
    }
    std::cout  << std::endl;
    
    rep(i,n){
        std::cout << dp[i][1] << ' ';
    }
    std::cout  << std::endl;
    */
    
    if(a[n-1]==1){
        if(dp[n-1][0]!=1)std::cout << "Alice" << std::endl;
        else std::cout << "Bob" << std::endl;
    }
    if(a[n-1]!=1){
        if(dp[n-1][1]!=1)std::cout << "Alice" << std::endl;
        else std::cout << "Bob" << std::endl;
    }
}
0