結果

問題 No.1506 Unbalanced Pocky Game
ユーザー MiMi
提出日時 2021-05-14 22:30:31
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 58 ms / 2,000 ms
コード長 3,281 bytes
コンパイル時間 4,476 ms
コンパイル使用メモリ 257,348 KB
実行使用メモリ 39,972 KB
最終ジャッジ日時 2024-04-10 01:02:02
合計ジャッジ時間 7,492 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 2 ms
6,812 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 4 ms
6,940 KB
testcase_04 AC 29 ms
25,216 KB
testcase_05 AC 33 ms
28,800 KB
testcase_06 AC 22 ms
18,560 KB
testcase_07 AC 15 ms
14,080 KB
testcase_08 AC 22 ms
19,456 KB
testcase_09 AC 35 ms
29,944 KB
testcase_10 AC 37 ms
30,592 KB
testcase_11 AC 16 ms
14,592 KB
testcase_12 AC 13 ms
13,312 KB
testcase_13 AC 8 ms
8,320 KB
testcase_14 AC 14 ms
14,336 KB
testcase_15 AC 13 ms
12,416 KB
testcase_16 AC 34 ms
29,672 KB
testcase_17 AC 18 ms
15,616 KB
testcase_18 AC 11 ms
11,136 KB
testcase_19 AC 10 ms
9,728 KB
testcase_20 AC 35 ms
30,300 KB
testcase_21 AC 15 ms
13,312 KB
testcase_22 AC 22 ms
20,828 KB
testcase_23 AC 2 ms
6,940 KB
testcase_24 AC 2 ms
6,940 KB
testcase_25 AC 47 ms
39,932 KB
testcase_26 AC 55 ms
39,292 KB
testcase_27 AC 55 ms
39,792 KB
testcase_28 AC 54 ms
38,328 KB
testcase_29 AC 55 ms
38,808 KB
testcase_30 AC 58 ms
39,972 KB
testcase_31 AC 55 ms
39,880 KB
testcase_32 AC 54 ms
39,388 KB
testcase_33 AC 55 ms
39,104 KB
testcase_34 AC 54 ms
38,396 KB
testcase_35 AC 54 ms
38,384 KB
testcase_36 AC 2 ms
6,940 KB
testcase_37 AC 2 ms
6,944 KB
testcase_38 AC 2 ms
6,940 KB
testcase_39 AC 2 ms
6,940 KB
testcase_40 AC 1 ms
6,940 KB
testcase_41 AC 1 ms
6,940 KB
testcase_42 AC 1 ms
6,944 KB
testcase_43 AC 2 ms
6,940 KB
testcase_44 AC 2 ms
6,944 KB
testcase_45 AC 2 ms
6,944 KB
testcase_46 AC 21 ms
15,744 KB
testcase_47 AC 8 ms
7,424 KB
testcase_48 AC 10 ms
8,832 KB
testcase_49 AC 24 ms
18,176 KB
testcase_50 AC 21 ms
16,000 KB
testcase_51 AC 23 ms
17,536 KB
testcase_52 AC 18 ms
14,464 KB
testcase_53 AC 27 ms
20,352 KB
testcase_54 AC 12 ms
9,600 KB
testcase_55 AC 8 ms
7,680 KB
testcase_56 AC 9 ms
7,424 KB
testcase_57 AC 20 ms
15,872 KB
testcase_58 AC 8 ms
7,424 KB
testcase_59 AC 5 ms
6,944 KB
testcase_60 AC 13 ms
10,752 KB
testcase_61 AC 21 ms
15,360 KB
testcase_62 AC 14 ms
13,184 KB
testcase_63 AC 11 ms
10,368 KB
testcase_64 AC 22 ms
17,536 KB
testcase_65 AC 14 ms
11,264 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