結果
問題 |
No.873 バイナリ、ヤバいなり!w
|
ユーザー |
![]() |
提出日時 | 2023-02-28 17:53:10 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 209 ms / 2,000 ms |
コード長 | 3,262 bytes |
コンパイル時間 | 2,096 ms |
コンパイル使用メモリ | 195,568 KB |
最終ジャッジ日時 | 2025-02-11 00:12:56 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 36 |
コンパイルメッセージ
main.cpp: In function ‘void n91::main_()’: main.cpp:111:14: warning: ‘ret’ may be used uninitialized [-Wmaybe-uninitialized] 111 | m -= c * c; | ~~^~~ main.cpp:103:15: note: ‘ret’ was declared here 103 | usize ret; | ^~~
ソースコード
//#define NDEBUG #include <cstddef> #include <cstdint> #include <iostream> #include <bits/stdc++.h> 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); } class rep { const usize f, l; public: class itr { friend rep; usize i; constexpr itr(const usize x) noexcept : i(x) {} public: void operator++() noexcept { ++i; } constexpr usize operator*() const noexcept { return i; } constexpr bool operator!=(const itr x) const noexcept { return i != x.i; } }; constexpr rep(const usize first, const usize last) noexcept : f(first), l(last) {} constexpr itr begin() const noexcept { return itr(f); } constexpr itr end() const noexcept { return itr(l); } }; class revrep { const usize f, l; public: class itr { friend revrep; usize i; constexpr itr(usize x) noexcept : i(x) {} public: void operator++() noexcept { --i; } constexpr usize operator*() const noexcept { return i; } constexpr bool operator!=(const itr x) const noexcept { return i != x.i; } }; constexpr revrep(usize first, usize last) noexcept : f(--first), l(--last) {} constexpr itr begin() const noexcept { return itr(l); } constexpr itr end() const noexcept { return itr(f); } }; template <class T> using vec_alias = std::vector<T>; 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 <algorithm> #include <iostream> #include <string> #include <utility> namespace n91 { void main_() { const usize n = scan<usize>(); std::string ans; std::vector<usize> dp(n + 1_z, std::numeric_limits<usize>::max()); for (const auto i : rep(1_z, n + 1_z)) { for (usize j = 1_z; j * j <= i; ++j) { dp[i] = std::min(dp[i], dp[i - j * j] + j); } } usize m = n; char next = '0'; constexpr char ex = '0' ^ '1'; while (m != 0_z) { usize c = [&]() { for (usize j = next == '0' ? 1_z : 2_z; j * j <= m; j += 2_z) { if (dp[m] == dp[m - j * j] + j) { return j; } } usize ret; for (usize j = next == '0' ? 2_z : 1_z; j * j <= m; j += 2_z) { if (dp[m] == dp[m - j * j] + j) { ret = j; } } return ret; }(); m -= c * c; for (const auto i : rep(0_z, c)) { ans.push_back(next); next ^= ex; } next ^= ex; } std::cout << ans << std::endl; } } // namespace n91 int main() { n91::main_(); return 0; }