結果

問題 No.1506 Unbalanced Pocky Game
ユーザー MiMi
提出日時 2021-05-14 22:30:31
言語 C++17
(gcc 11.2.0 + boost 1.78.0)
結果
AC  
実行時間 52 ms / 2,000 ms
コード長 3,281 bytes
コンパイル時間 3,483 ms
使用メモリ 36,752 KB
最終ジャッジ日時 2022-11-25 19:30:34
合計ジャッジ時間 7,091 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 1 ms
6,948 KB
testcase_01 AC 1 ms
4,900 KB
testcase_02 AC 1 ms
4,900 KB
testcase_03 AC 4 ms
6,952 KB
testcase_04 AC 27 ms
23,180 KB
testcase_05 AC 30 ms
26,588 KB
testcase_06 AC 19 ms
17,116 KB
testcase_07 AC 14 ms
13,056 KB
testcase_08 AC 20 ms
17,804 KB
testcase_09 AC 32 ms
27,612 KB
testcase_10 AC 33 ms
28,080 KB
testcase_11 AC 15 ms
13,328 KB
testcase_12 AC 14 ms
12,264 KB
testcase_13 AC 7 ms
7,892 KB
testcase_14 AC 14 ms
13,176 KB
testcase_15 AC 12 ms
11,564 KB
testcase_16 AC 32 ms
27,092 KB
testcase_17 AC 16 ms
14,432 KB
testcase_18 AC 10 ms
10,160 KB
testcase_19 AC 8 ms
9,212 KB
testcase_20 AC 33 ms
27,772 KB
testcase_21 AC 14 ms
12,272 KB
testcase_22 AC 22 ms
19,132 KB
testcase_23 AC 2 ms
4,900 KB
testcase_24 AC 2 ms
6,948 KB
testcase_25 AC 43 ms
36,752 KB
testcase_26 AC 49 ms
35,888 KB
testcase_27 AC 49 ms
36,444 KB
testcase_28 AC 47 ms
35,256 KB
testcase_29 AC 48 ms
35,520 KB
testcase_30 AC 52 ms
36,592 KB
testcase_31 AC 50 ms
36,484 KB
testcase_32 AC 51 ms
35,956 KB
testcase_33 AC 48 ms
35,960 KB
testcase_34 AC 47 ms
35,248 KB
testcase_35 AC 48 ms
35,184 KB
testcase_36 AC 1 ms
4,904 KB
testcase_37 AC 1 ms
4,904 KB
testcase_38 AC 2 ms
6,952 KB
testcase_39 AC 2 ms
6,952 KB
testcase_40 AC 1 ms
4,900 KB
testcase_41 AC 1 ms
4,900 KB
testcase_42 AC 1 ms
4,900 KB
testcase_43 AC 2 ms
4,904 KB
testcase_44 AC 1 ms
4,900 KB
testcase_45 AC 1 ms
6,952 KB
testcase_46 AC 18 ms
14,420 KB
testcase_47 AC 7 ms
7,072 KB
testcase_48 AC 9 ms
8,124 KB
testcase_49 AC 21 ms
16,560 KB
testcase_50 AC 18 ms
14,680 KB
testcase_51 AC 20 ms
16,036 KB
testcase_52 AC 15 ms
13,152 KB
testcase_53 AC 24 ms
18,604 KB
testcase_54 AC 10 ms
8,844 KB
testcase_55 AC 7 ms
7,100 KB
testcase_56 AC 7 ms
7,056 KB
testcase_57 AC 17 ms
14,740 KB
testcase_58 AC 7 ms
6,948 KB
testcase_59 AC 4 ms
5,340 KB
testcase_60 AC 11 ms
9,992 KB
testcase_61 AC 17 ms
14,228 KB
testcase_62 AC 14 ms
12,080 KB
testcase_63 AC 10 ms
9,472 KB
testcase_64 AC 19 ms
15,964 KB
testcase_65 AC 10 ms
10,176 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;

typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,n) for(ll i=n-1;i>=0;i--)
#define rFOR(i,a,b) for(ll i=a-1;i>=b;i--)
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define endl "\n"

istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); }

template<typename T> inline bool chmax(T &a, T b){if(a<b){a=b;return true;}return false;}
template<typename T> inline bool chmin(T &a, T b){if(a>b){a=b;return true;}return false;}
template<typename T> ostream& operator<<(ostream& s,const complex<T>& d) {return s<<"("<<d.real()<<", "<<d.imag()<< ")";}
template<typename T1, typename T2> ostream& operator<<(ostream& s,const pair<T1,T2>& d) {return s<<"("<<d.first<<", "<<d.second<<")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& d){int len=d.size();rep(i,len){s<<d[i];if(i<len-1) s<<" ";}return s;}
template<typename T> ostream& operator<<(ostream& s,const vector<vector<T>>& d){int len=d.size();rep(i,len){s<<d[i]<<endl;}return s;}
template<typename T> ostream& operator<<(ostream& s,const set<T>& v){s<<"{ ";for(auto itr=v.begin();itr!=v.end();++itr) {if (itr!=v.begin()) {s<< ", ";}s<<(*itr);}s<<" }";return s;}
template<typename T> ostream& operator<<(ostream& s,const multiset<T>& v){s<<"{ ";for(auto itr=v.begin();itr!=v.end();++itr) {if (itr!=v.begin()) {s<< ", ";}s<<(*itr);}s<<" }";return s;}
template<typename T1, typename T2> ostream& operator<<(ostream& s,const map<T1,T2>& m){s<<"{"<<endl;for(auto itr=m.begin();itr!=m.end();++itr){s<<" "<<(*itr).first<<" : "<<(*itr).second<<endl;}s<<"}"<<endl;return s;}
template<class T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }

const ll mod=1'000'000'007;
const ll inf=1'000'000'000'000'000'00;
const int INF=1'000'000'000;
const double EPS=1e-10;
const double PI=acos(-1);

int main(){
    cin.tie(0);ios::sync_with_stdio(false);
    int n;
    cin>>n;
    vector<int> a(n);
    rep(i,n){
        cin>>a[i];
        chmin(a[i],3);
    }
    auto dp=make_vec(n,4,-1);
    auto dfs=[&](auto &&dfs,int i,int j)->int{
        if(dp[i][j]!=-1) return dp[i][j];
        if(i==0 && j==0) return dp[i][j]=0;
        if(j==0){
            return dp[i][j]=dfs(dfs,i-1,a[i-1]);
        }
        int ret=0;
        rep(nj,j){
            ret|=!dfs(dfs,i,nj);
        }
        if(ret) dp[i][j]=1;
        else dp[i][j]=0;
        return dp[i][j];
    };
    int ans=dfs(dfs,n-1,a[n-1]);
    if(ans) cout<<"Alice"<<endl;
    else cout<<"Bob"<<endl;
}
0