結果
問題 | No.2666 Decreasing Modulo Nim |
ユーザー | ebi_fly |
提出日時 | 2024-03-08 23:25:56 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 33 ms / 2,000 ms |
コード長 | 5,424 bytes |
コンパイル時間 | 3,111 ms |
コンパイル使用メモリ | 250,156 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-09-29 20:43:57 |
合計ジャッジ時間 | 5,687 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 55 |
ソースコード
#line 1 "template/template.hpp"#include <bits/stdc++.h>#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)#define rrep(i, a, n) for (int i = ((int)(n)-1); i >= (int)(a); i--)#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)#define RRep(i, a, n) for (i64 i = ((i64)(n)-i64(1)); i >= (i64)(a); i--)#define all(v) (v).begin(), (v).end()#define rall(v) (v).rbegin(), (v).rend()#line 2 "template/debug_template.hpp"#line 4 "template/debug_template.hpp"namespace ebi {#ifdef LOCAL#define debug(...) \std::cerr << "LINE: " << __LINE__ << " [" << #__VA_ARGS__ << "]:", \debug_out(__VA_ARGS__)#else#define debug(...)#endifvoid debug_out() {std::cerr << std::endl;}template <typename Head, typename... Tail> void debug_out(Head h, Tail... t) {std::cerr << " " << h;if (sizeof...(t) > 0) std::cerr << " :";debug_out(t...);}} // namespace ebi#line 2 "template/int_alias.hpp"#line 4 "template/int_alias.hpp"namespace ebi {using ld = long double;using std::size_t;using i8 = std::int8_t;using u8 = std::uint8_t;using i16 = std::int16_t;using u16 = std::uint16_t;using i32 = std::int32_t;using u32 = std::uint32_t;using i64 = std::int64_t;using u64 = std::uint64_t;using i128 = __int128_t;using u128 = __uint128_t;} // namespace ebi#line 2 "template/io.hpp"#line 5 "template/io.hpp"#include <optional>#line 7 "template/io.hpp"namespace ebi {template <typename T1, typename T2>std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {return os << pa.first << " " << pa.second;}template <typename T1, typename T2>std::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {return os >> pa.first >> pa.second;}template <typename T>std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {for (std::size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");return os;}template <typename T>std::istream &operator>>(std::istream &os, std::vector<T> &vec) {for (T &e : vec) std::cin >> e;return os;}template <typename T>std::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {if (opt) {os << opt.value();} else {os << "invalid value";}return os;}void fast_io() {std::cout << std::fixed << std::setprecision(15);std::cin.tie(nullptr);std::ios::sync_with_stdio(false);}} // namespace ebi#line 2 "template/utility.hpp"#line 5 "template/utility.hpp"#line 2 "graph/template.hpp"#line 5 "graph/template.hpp"namespace ebi {template <class T> struct Edge {int to;T cost;Edge(int _to, T _cost = 1) : to(_to), cost(_cost) {}};template <class T> struct Graph : std::vector<std::vector<Edge<T>>> {using std::vector<std::vector<Edge<T>>>::vector;void add_edge(int u, int v, T w, bool directed = false) {(*this)[u].emplace_back(v, w);if (directed) return;(*this)[v].emplace_back(u, w);}};struct graph : std::vector<std::vector<int>> {using std::vector<std::vector<int>>::vector;void add_edge(int u, int v, bool directed = false) {(*this)[u].emplace_back(v);if (directed) return;(*this)[v].emplace_back(u);}void read_tree(int offset = 1) {read_graph((int)size()-1, offset);}void read_graph(int m, int offset = 1, bool directed = false) {for(int i = 0; i < m; i++) {int u,v;std::cin >> u >> v;u -= offset;v -= offset;add_edge(u, v, directed);}}};} // namespace ebi#line 8 "template/utility.hpp"namespace ebi {template <class T> inline bool chmin(T &a, T b) {if (a > b) {a = b;return true;}return false;}template <class T> inline bool chmax(T &a, T b) {if (a < b) {a = b;return true;}return false;}template <class T> T safe_ceil(T a, T b) {if (a % b == 0)return a / b;else if (a >= 0)return (a / b) + 1;elsereturn -((-a) / b);}template <class T> T safe_floor(T a, T b) {if (a % b == 0)return a / b;else if (a >= 0)return a / b;elsereturn -((-a) / b) - 1;}constexpr i64 LNF = std::numeric_limits<i64>::max() / 4;constexpr int INF = std::numeric_limits<int>::max() / 2;const std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};const std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};} // namespace ebi#line 2 "a.cpp"namespace ebi {void main_() {int n, m;std::cin >> n >> m;std::vector<int> a(n);std::cin >> a;int x = 0;bool all_zero = true;rep(i, 0, n) {x ^= a[i] / m;all_zero &= (a[i] / m) == 0;}if (x != 0) {std::cout << "Alice\n";return;}rep(i,0,n) {a[i] %= m;}while (true) {i64 sum = 0;rep(i, 0, n) sum += a[i];if (sum % 2 == 1) {std::cout << "Alice\n";return;}if (sum == 0) break;rep(i, 0, n) a[i] /= 2;}std::cout << "Bob\n";}} // namespace ebiint main() {ebi::fast_io();int t = 1;// std::cin >> t;while (t--) {ebi::main_();}return 0;}