結果
問題 | No.2814 Block Game |
ユーザー |
|
提出日時 | 2024-07-19 22:56:42 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,937 bytes |
コンパイル時間 | 2,355 ms |
コンパイル使用メモリ | 200,964 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-07-19 22:56:54 |
合計ジャッジ時間 | 11,027 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | WA * 20 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define SZ(x) (int) (x).size()#define REP(i, n) for(int i = 0; i < (n); i++)#define FOR(i, a, b) for(auto i = (a); i < (b); i++)#define For(i, a, b, c) \for(auto i = (a); i != (b); i += (c))#define REPR(i, n) for(auto i = (n) - 1; i >= 0; i--)#define ALL(s) (s).begin(), (s).end()#define so(V) sort(ALL(V))#define rev(V) reverse(ALL(V))#define uni(v) v.erase(unique(ALL(v)), (v).end())#define eb emplace_backtypedef unsigned long long ull;typedef long long ll;typedef vector<int> vi;typedef vector<ll> vll;typedef vector<bool> vb;typedef vector<vi> vvi;typedef vector<vll> vvll;typedef pair<int, int> PI;typedef pair<ll, ll> PL;const double EPS = 1e-6;const int MOD = 1e9 + 7;const int INF = (1 << 30);const ll LINF = 1e18;const double math_PI = acos(-1);template<typename T>vector<T> make_v(size_t a) {return vector<T>(a);}template<typename T, typename... Ts>auto make_v(size_t a, Ts... ts) {return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));}template<typename T, typename V>typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {t = v;}template<typename T, typename V>typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {for(auto &e: t) fill_v(e, v);}template<class T>bool chmax(T &a, const T &b) {if(a < b) {a = b;return true;}return false;}template<class T>bool chmin(T &a, const T &b) {if(a > b) {a = b;return true;}return false;}template<typename S, typename T>istream &operator>>(istream &is, pair<S, T> &p) {cin >> p.first >> p.second;return is;}template<typename T>istream &operator>>(istream &is, vector<T> &vec) {for(T &x: vec) is >> x;return is;}template<typename T>string join(vector<T> &vec, string splitter) {stringstream ss;REP(i, SZ(vec)) {if(i != 0) ss << splitter;ss << vec[i];}return ss.str();}template<typename T>ostream &operator<<(ostream &os, vector<T> &vec) {os << join(vec, " ");return os;}#ifdef LOCAL#include "./cpp-dump/dump.hpp"#include "./cpp-dump/mytypes.hpp"#define dump(...) cpp_dump(__VA_ARGS__)namespace cp = cpp_dump;#else#define dump(...)#define preprocess(...)#define CPP_DUMP_SET_OPTION(...)#define CPP_DUMP_DEFINE_EXPORT_OBJECT(...)#define CPP_DUMP_DEFINE_EXPORT_ENUM(...)#define CPP_DUMP_DEFINE_DANGEROUS_EXPORT_OBJECT(...)#endifvoid solve() {ll N;cin >> N;string S;cin >> S;if(N == 1) {if(S == "Odd")cout << "Alice" << endl;elsecout << "Bob" << endl;return;}REP(i, 62) {if(N == 1ll << i) {if(S == "Odd") {cout << "Bob" << endl;} else {cout << "Alice" << endl;}return;}}if(N % 2 == 0) {cout << "Bob" << endl;} else {cout << "Alice" << endl;}}int main() {cin.tie(nullptr);ios::sync_with_stdio(false);int T;cin >> T;while(T--) {solve();}return 0;}