結果
問題 | No.1654 Binary Compression |
ユーザー |
![]() |
提出日時 | 2021-08-20 22:50:07 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 82 ms / 2,000 ms |
コード長 | 3,629 bytes |
コンパイル時間 | 1,105 ms |
コンパイル使用メモリ | 88,360 KB |
最終ジャッジ日時 | 2025-01-24 00:08:01 |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 50 |
ソースコード
//#define NDEBUG #pragma warning(disable : 4146) #include <algorithm> #include <cassert> #include <cstddef> #include <cstdint> #include <iomanip> #include <iostream> #include <utility> #include <vector> namespace n91 { using i32 = std::int32_t; using i64 = std::int64_t; using u32 = std::uint32_t; using u64 = std::uint64_t; using isize = std::ptrdiff_t; using usize = std::size_t; using f64 = double; struct rep { struct itr { usize i; constexpr itr(const usize i) noexcept : i(i) {} void operator++() noexcept { ++i; } constexpr usize operator*() const noexcept { return i; } constexpr bool operator!=(const itr x) const noexcept { return i != x.i; } }; const itr f, l; constexpr rep(const usize f, const usize l) noexcept : f(std::min(f, l)), l(l) {} constexpr auto begin() const noexcept { return f; } constexpr auto end() const noexcept { return l; } }; struct revrep { struct itr { usize i; constexpr itr(const usize i) noexcept : i(i) {} void operator++() noexcept { --i; } constexpr usize operator*() const noexcept { return i; } constexpr bool operator!=(const itr x) const noexcept { return i != x.i; } }; const itr f, l; constexpr revrep(const usize f, const usize l) noexcept : f(l - 1), l(std::min(f, l) - 1) {} constexpr auto begin() const noexcept { return f; } constexpr auto end() const noexcept { return 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) noexcept { return a < b ? b - a : a - b; } template <class T> void chmin(T &a, const T &b) noexcept { if (b < a) a = b; } template <class T> void chmax(T &a, const T &b) noexcept { if (a < b) a = b; } template <class F> class rec_lambda { F f; public: rec_lambda(F &&f_) : f(std::forward<F>(f_)) {} template <class... Args> auto operator()(Args &&... args) const { return f(*this, std::forward<Args>(args)...); } }; template <class T> T scan() { T ret; std::cin >> ret; return ret; } constexpr char eoln = '\n'; template <class T> T ceildiv(const T &l, const T &r) { return l / r + (l % r != 0 ? 1 : 0); } #ifdef N91_LOCAL #define OJ_LOCAL(a, b) b #else #define OJ_LOCAL(a, b) a #endif } // namespace n91 #include <atcoder/modint> namespace n91 { void main_() { using mint = atcoder::static_modint<924844033>; std::string S; std::cin >> S; std::vector<usize> a = {0}; for (const char e : S) { if (e == '1') { a.push_back(0); } else { a.back() += 1; } } if (a.size() == 1) { std::cout << a[0] << eoln; return; } const mint coef = mint(a[0] + 1) * (a.back() + 1); a.pop_back(); a.erase(a.begin()); const usize n = a.size(); a.push_back(3000000); std::vector<mint> dp(n + 2); dp[n + 1] = 0; dp[n] = 1; mint acc = 0; std::vector<usize> st; st.push_back(n); for (const usize i : revrep(0, n)) { while (a[st.back()] <= a[i]) { const usize temp = st.rbegin()[1]; acc -= (a[temp] - a[st.back()]) * dp[temp + 1]; st.pop_back(); } acc += (a[st.back()] - a[i]) * dp[st.back() + 1]; st.push_back(i); dp[i] = acc + (a[i] + 1) * dp[i + 1] + 1; } std::cout << (coef * dp[0]).val() << eoln; } } // namespace n91 int main() { //* std::ios::sync_with_stdio(false); std::cin.tie(nullptr); //*/ std::cout << std::setprecision(20); n91::main_(); return 0; }