結果
問題 | No.1506 Unbalanced Pocky Game |
ユーザー | stoq |
提出日時 | 2021-05-14 22:23:04 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 36 ms / 2,000 ms |
コード長 | 2,949 bytes |
コンパイル時間 | 2,339 ms |
コンパイル使用メモリ | 199,636 KB |
最終ジャッジ日時 | 2025-01-21 11:28:32 |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
6,820 KB |
testcase_01 | AC | 3 ms
6,820 KB |
testcase_02 | AC | 3 ms
6,820 KB |
testcase_03 | AC | 5 ms
6,820 KB |
testcase_04 | AC | 18 ms
10,952 KB |
testcase_05 | AC | 19 ms
11,904 KB |
testcase_06 | AC | 13 ms
9,088 KB |
testcase_07 | AC | 11 ms
8,152 KB |
testcase_08 | AC | 13 ms
9,216 KB |
testcase_09 | AC | 19 ms
12,160 KB |
testcase_10 | AC | 20 ms
12,288 KB |
testcase_11 | AC | 10 ms
8,136 KB |
testcase_12 | AC | 10 ms
7,808 KB |
testcase_13 | AC | 6 ms
6,824 KB |
testcase_14 | AC | 11 ms
8,064 KB |
testcase_15 | AC | 8 ms
7,552 KB |
testcase_16 | AC | 20 ms
12,160 KB |
testcase_17 | AC | 11 ms
8,288 KB |
testcase_18 | AC | 8 ms
7,168 KB |
testcase_19 | AC | 7 ms
7,028 KB |
testcase_20 | AC | 19 ms
12,288 KB |
testcase_21 | AC | 10 ms
7,808 KB |
testcase_22 | AC | 14 ms
9,600 KB |
testcase_23 | AC | 3 ms
6,820 KB |
testcase_24 | AC | 3 ms
6,820 KB |
testcase_25 | AC | 28 ms
14,976 KB |
testcase_26 | AC | 34 ms
14,720 KB |
testcase_27 | AC | 34 ms
14,976 KB |
testcase_28 | AC | 32 ms
14,464 KB |
testcase_29 | AC | 35 ms
14,592 KB |
testcase_30 | AC | 36 ms
14,976 KB |
testcase_31 | AC | 34 ms
14,976 KB |
testcase_32 | AC | 33 ms
14,720 KB |
testcase_33 | AC | 33 ms
14,848 KB |
testcase_34 | AC | 33 ms
14,464 KB |
testcase_35 | AC | 33 ms
14,592 KB |
testcase_36 | AC | 3 ms
6,816 KB |
testcase_37 | AC | 3 ms
6,816 KB |
testcase_38 | AC | 3 ms
6,820 KB |
testcase_39 | AC | 3 ms
6,820 KB |
testcase_40 | AC | 3 ms
6,820 KB |
testcase_41 | AC | 3 ms
6,816 KB |
testcase_42 | AC | 3 ms
6,816 KB |
testcase_43 | AC | 2 ms
6,816 KB |
testcase_44 | AC | 3 ms
6,820 KB |
testcase_45 | AC | 4 ms
6,816 KB |
testcase_46 | AC | 14 ms
8,320 KB |
testcase_47 | AC | 7 ms
6,816 KB |
testcase_48 | AC | 8 ms
6,816 KB |
testcase_49 | AC | 16 ms
9,016 KB |
testcase_50 | AC | 14 ms
8,640 KB |
testcase_51 | AC | 15 ms
8,748 KB |
testcase_52 | AC | 12 ms
8,188 KB |
testcase_53 | AC | 18 ms
9,472 KB |
testcase_54 | AC | 8 ms
6,820 KB |
testcase_55 | AC | 7 ms
6,820 KB |
testcase_56 | AC | 6 ms
6,820 KB |
testcase_57 | AC | 14 ms
8,336 KB |
testcase_58 | AC | 6 ms
6,816 KB |
testcase_59 | AC | 5 ms
6,820 KB |
testcase_60 | AC | 10 ms
7,036 KB |
testcase_61 | AC | 14 ms
8,196 KB |
testcase_62 | AC | 12 ms
7,624 KB |
testcase_63 | AC | 10 ms
7,148 KB |
testcase_64 | AC | 15 ms
8,752 KB |
testcase_65 | AC | 9 ms
7,168 KB |
ソースコード
#define MOD_TYPE 2#pragma region Macros#include <bits/stdc++.h>using namespace std;#if 0#include <boost/multiprecision/cpp_int.hpp>#include <boost/multiprecision/cpp_dec_float.hpp>using Int = boost::multiprecision::cpp_int;using lld = boost::multiprecision::cpp_dec_float_100;#endif#if 1#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#endifusing ll = long long int;using ld = long double;using pii = pair<int, int>;using pll = pair<ll, ll>;using pld = pair<ld, ld>;template <typename Q_type>using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);constexpr int INF = (int)1e9 + 10;constexpr ll LINF = (ll)4e18;constexpr ld PI = acos(-1.0);constexpr ld EPS = 1e-7;constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)#define rep(i, n) REP(i, 0, n)#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)#define repi(i, n) REPI(i, 0, n)#define MP make_pair#define MT make_tuple#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"#define all(v) v.begin(), v.end()#define NP(v) next_permutation(all(v))#define dbg(x) cerr << #x << ":" << x << "\n";struct io_init{io_init(){cin.tie(0);ios::sync_with_stdio(false);cout << setprecision(30) << setiosflags(ios::fixed);};} io_init;template <typename T>inline bool chmin(T &a, T b){if (a > b){a = b;return true;}return false;}template <typename T>inline bool chmax(T &a, T b){if (a < b){a = b;return true;}return false;}inline ll CEIL(ll a, ll b){return (a + b - 1) / b;}template <typename A, size_t N, typename T>inline void Fill(A (&array)[N], const T &val){fill((T *)array, (T *)(array + N), val);}template <typename T, typename U>constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept{is >> p.first >> p.second;return is;}template <typename T, typename U>constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept{os << p.first << " " << p.second;return os;}#pragma endregion// --------------------------------------vector<int> a;int dp[200010][2];bool f(int i, bool turn){if (i < 0)return false;if (dp[i][turn] != -1)return dp[i][turn];bool res = false;res |= !f(i - 1, turn ^ 1);if (a[i])res |= f(i - 1, turn);return dp[i][turn] = res;}void solve(){Fill(dp, -1);int n;cin >> n;a.resize(n);rep(i, n){cin >> a[i];a[i] = (a[i] > 1);}bool ans = f(n - 1, 0);cout << (ans ? "Alice" : "Bob") << "\n";}int main(){solve();}