結果
問題 | No.2 素因数ゲーム |
ユーザー | noshi91 |
提出日時 | 2019-09-20 22:40:53 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 4,930 bytes |
コンパイル時間 | 1,204 ms |
コンパイル使用メモリ | 79,912 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-14 18:40:37 |
合計ジャッジ時間 | 1,718 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 1 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 2 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 2 ms
5,376 KB |
testcase_18 | AC | 2 ms
5,376 KB |
testcase_19 | AC | 2 ms
5,376 KB |
testcase_20 | AC | 2 ms
5,376 KB |
testcase_21 | AC | 2 ms
5,376 KB |
testcase_22 | AC | 2 ms
5,376 KB |
testcase_23 | AC | 2 ms
5,376 KB |
testcase_24 | AC | 2 ms
5,376 KB |
testcase_25 | AC | 2 ms
5,376 KB |
testcase_26 | AC | 2 ms
5,376 KB |
testcase_27 | AC | 2 ms
5,376 KB |
testcase_28 | AC | 2 ms
5,376 KB |
testcase_29 | AC | 2 ms
5,376 KB |
testcase_30 | AC | 2 ms
5,376 KB |
ソースコード
//#define NDEBUG #include <cstddef> #include <cstdint> #include <iostream> #include <iterator> #include <vector> namespace n91 { using i8 = std::int_fast8_t; using i32 = std::int_fast32_t; using i64 = std::int_fast64_t; using u8 = std::uint_fast8_t; using u32 = std::uint_fast32_t; using u64 = std::uint_fast64_t; using isize = std::ptrdiff_t; using usize = std::size_t; constexpr usize operator"" _z(unsigned long long x) noexcept { return static_cast<usize>(x); } template <class T> class integral_iterator { public: using difference_type = T; using value_type = T; using pointer = const value_type *; using reference = value_type; using iterator_category = std::random_access_iterator_tag; private: using self_type = integral_iterator<value_type>; value_type i; public: constexpr integral_iterator() noexcept : i() {} explicit constexpr integral_iterator(const value_type i) noexcept : i(i) {} constexpr self_type operator++(int) noexcept { return self_type(i++); } constexpr self_type operator--(int) noexcept { return self_type(i--); } constexpr self_type operator[](const difference_type rhs) const noexcept { return self_type(i + rhs); } constexpr self_type &operator++() noexcept { ++i; return *this; } constexpr self_type &operator--() noexcept { --i; return *this; } constexpr reference operator*() const noexcept { return i; } constexpr self_type operator+(const difference_type rhs) const noexcept { return self_type(i + rhs); } constexpr self_type operator-(const difference_type rhs) const noexcept { return self_type(i - rhs); } constexpr difference_type operator-(const self_type rhs) const noexcept { return i - rhs.i; } constexpr bool operator<(const self_type rhs) const noexcept { return i < rhs.i; } constexpr bool operator<=(const self_type rhs) const noexcept { return i <= rhs.i; } constexpr bool operator>(const self_type rhs) const noexcept { return i > rhs.i; } constexpr bool operator>=(const self_type rhs) const noexcept { return i >= rhs.i; } constexpr bool operator==(const self_type rhs) const noexcept { return i == rhs.i; } constexpr bool operator!=(const self_type rhs) const noexcept { return i != rhs.i; } constexpr self_type &operator+=(const difference_type rhs) noexcept { i += rhs; return *this; } constexpr self_type &operator-=(const difference_type rhs) noexcept { i -= rhs; return *this; } }; template <class T> constexpr integral_iterator<T> make_int_itr(const T i) noexcept { return integral_iterator<T>(i); } class rep { const usize f, l; public: constexpr rep(const usize f, const usize l) noexcept : f(f), l(l) {} constexpr auto begin() const noexcept { return make_int_itr(f); } constexpr auto end() const noexcept { return make_int_itr(l); } }; class revrep { const usize f, l; public: revrep(const usize f, const usize l) noexcept : f(l), l(f) {} auto begin() const noexcept { return std::make_reverse_iterator(make_int_itr(f)); } auto end() const noexcept { return std::make_reverse_iterator(make_int_itr(l)); } }; template <class T> auto md_vec(const usize n, const T &value) { return std::vector<T>(n, value); } template <class... Args> auto md_vec(const usize n, Args... args) { return std::vector<decltype(md_vec(args...))>(n, md_vec(args...)); } template <class T> constexpr T difference(const T &a, const T &b) { return a < b ? b - a : a - b; } template <class T> T scan() { T ret; std::cin >> ret; return ret; } } // namespace n91 #include <utility> #include <vector> namespace n91 { template <class T> std::vector<T> factorize(T n) noexcept { std::vector<T> ret; for (T p = static_cast<T>(2); p * p <= n; ++p) { while (n % p == static_cast<T>(0)) { n /= p; ret.push_back(p); } } if (n != static_cast<T>(1)) { ret.push_back(std::move(n)); } ret.shrink_to_fit(); return std::move(ret); } } // namespace n91 #include <utility> #include <vector> namespace n91 { template <class T> std::vector<std::pair<T, std::size_t>> run_length_encoding(const std::vector<T> &a) { if (a.empty()) { return std::vector<std::pair<T, std::size_t>>(); } std::vector<std::pair<T, std::size_t>> ret; ret.reserve(a.size()); ret.emplace_back(a.front(), static_cast<std::size_t>(0)); for (const T &e : a) { if (e != ret.back().first) { ret.emplace_back(e, static_cast<std::size_t>(0)); } ++ret.back().second; } ret.shrink_to_fit(); return std::move(ret); } } // namespace n91 #include <algorithm> #include <iostream> #include <utility> namespace n91 { void main_() { usize g = 0_z; for (const auto &e : run_length_encoding(factorize(scan<u64>()))) { g ^= e.second; } std::cout << (g != 0_z ? "Alice" : "Bob") << std::endl; } } // namespace n91 int main() { n91::main_(); return 0; }