結果
問題 | No.1654 Binary Compression |
ユーザー | satashun |
提出日時 | 2021-08-27 14:35:47 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 115 ms / 2,000 ms |
コード長 | 5,587 bytes |
コンパイル時間 | 2,459 ms |
コンパイル使用メモリ | 210,696 KB |
実行使用メモリ | 44,736 KB |
最終ジャッジ日時 | 2024-04-30 16:29:26 |
合計ジャッジ時間 | 7,139 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 2 ms
6,940 KB |
testcase_08 | AC | 2 ms
6,944 KB |
testcase_09 | AC | 2 ms
6,940 KB |
testcase_10 | AC | 99 ms
25,548 KB |
testcase_11 | AC | 101 ms
26,532 KB |
testcase_12 | AC | 102 ms
24,760 KB |
testcase_13 | AC | 103 ms
26,196 KB |
testcase_14 | AC | 101 ms
27,140 KB |
testcase_15 | AC | 102 ms
26,332 KB |
testcase_16 | AC | 52 ms
24,948 KB |
testcase_17 | AC | 54 ms
25,696 KB |
testcase_18 | AC | 103 ms
25,592 KB |
testcase_19 | AC | 104 ms
26,360 KB |
testcase_20 | AC | 103 ms
24,860 KB |
testcase_21 | AC | 102 ms
25,800 KB |
testcase_22 | AC | 104 ms
27,080 KB |
testcase_23 | AC | 15 ms
9,240 KB |
testcase_24 | AC | 15 ms
9,288 KB |
testcase_25 | AC | 16 ms
10,044 KB |
testcase_26 | AC | 15 ms
9,132 KB |
testcase_27 | AC | 51 ms
18,088 KB |
testcase_28 | AC | 50 ms
18,084 KB |
testcase_29 | AC | 16 ms
9,168 KB |
testcase_30 | AC | 14 ms
9,192 KB |
testcase_31 | AC | 15 ms
9,208 KB |
testcase_32 | AC | 14 ms
9,224 KB |
testcase_33 | AC | 50 ms
18,088 KB |
testcase_34 | AC | 48 ms
18,084 KB |
testcase_35 | AC | 15 ms
9,176 KB |
testcase_36 | AC | 14 ms
9,056 KB |
testcase_37 | AC | 15 ms
9,272 KB |
testcase_38 | AC | 14 ms
9,244 KB |
testcase_39 | AC | 115 ms
44,736 KB |
testcase_40 | AC | 113 ms
43,276 KB |
testcase_41 | AC | 89 ms
43,508 KB |
testcase_42 | AC | 12 ms
7,676 KB |
testcase_43 | AC | 12 ms
8,604 KB |
testcase_44 | AC | 89 ms
44,708 KB |
testcase_45 | AC | 89 ms
43,588 KB |
testcase_46 | AC | 12 ms
9,112 KB |
testcase_47 | AC | 2 ms
6,944 KB |
testcase_48 | AC | 2 ms
6,940 KB |
testcase_49 | AC | 57 ms
25,212 KB |
testcase_50 | AC | 51 ms
25,064 KB |
testcase_51 | AC | 58 ms
16,204 KB |
testcase_52 | AC | 57 ms
17,028 KB |
ソースコード
//#pragma GCC optimize("Ofast") //#pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using pii = pair<int, int>; template <class T> using V = vector<T>; template <class T> using VV = V<V<T>>; template <class T> V<T> make_vec(size_t a) { return V<T>(a); } template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) { return V<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...)); } #define pb push_back #define eb emplace_back #define mp make_pair #define fi first #define se second #define rep(i, n) rep2(i, 0, n) #define rep2(i, m, n) for (int i = m; i < (n); i++) #define per(i, b) per2(i, 0, b) #define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--) #define ALL(c) (c).begin(), (c).end() #define SZ(x) ((int)(x).size()) constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); } template <class T, class U> void chmin(T& t, const U& u) { if (t > u) t = u; } template <class T, class U> void chmax(T& t, const U& u) { if (t < u) t = u; } template <class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << "(" << p.first << "," << p.second << ")"; return os; } template <class T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "{"; rep(i, v.size()) { if (i) os << ","; os << v[i]; } os << "}"; return os; } #ifdef LOCAL void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...); } #define debug(...) \ cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif template <unsigned int MOD> struct ModInt { using uint = unsigned int; using ull = unsigned long long; using M = ModInt; uint v; ModInt(ll _v = 0) { set_norm(_v % MOD + MOD); } M& set_norm(uint _v) { //[0, MOD * 2)->[0, MOD) v = (_v < MOD) ? _v : _v - MOD; return *this; } explicit operator bool() const { return v != 0; } explicit operator int() const { return v; } M operator+(const M& a) const { return M().set_norm(v + a.v); } M operator-(const M& a) const { return M().set_norm(v + MOD - a.v); } M operator*(const M& a) const { return M().set_norm(ull(v) * a.v % MOD); } M operator/(const M& a) const { return *this * a.inv(); } M& operator+=(const M& a) { return *this = *this + a; } M& operator-=(const M& a) { return *this = *this - a; } M& operator*=(const M& a) { return *this = *this * a; } M& operator/=(const M& a) { return *this = *this / a; } M operator-() const { return M() - *this; } M& operator++(int) { return *this = *this + 1; } M& operator--(int) { return *this = *this - 1; } M pow(ll n) const { if (n < 0) return inv().pow(-n); M x = *this, res = 1; while (n) { if (n & 1) res *= x; x *= x; n >>= 1; } return res; } M inv() const { ll a = v, b = MOD, p = 1, q = 0, t; while (b != 0) { t = a / b; swap(a -= t * b, b); swap(p -= t * q, q); } return M(p); } friend ostream& operator<<(ostream& os, const M& a) { return os << a.v; } friend istream& operator>>(istream& in, M& x) { ll v_; in >> v_; x = M(v_); return in; } bool operator<(const M& r) const { return v < r.v; } bool operator>(const M& r) const { return v < *this; } bool operator<=(const M& r) const { return !(r < *this); } bool operator>=(const M& r) const { return !(*this < r); } bool operator==(const M& a) const { return v == a.v; } bool operator!=(const M& a) const { return v != a.v; } static uint get_mod() { return MOD; } }; // using Mint = ModInt<1000000007>; using Mint = ModInt<924844033>; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); string s; cin >> s; int n = SZ(s); Mint bb = 1; { int l = 0; while (l < n && s[l] == '0') { l++; } int r = n - 1; while (r >= l && s[r] == '0') { r--; } if (r < l) { cout << n << endl; return 0; } bb *= (l + 1) * (n - r); s = s.substr(l, r - l + 1); n = SZ(s); } debug(bb, s); V<int> v1, c0; rep(i, n) { if (s[i] == '1') v1.pb(i); } rep(i, SZ(v1) - 1) { c0.pb(v1[i + 1] - v1[i] - 1); } debug(c0); V<Mint> dp(SZ(v1)); dp.back() = 1; V<pii> vec; Mint sum; // 10..010..010..01 per(i, SZ(c0)) { { int la = -1; while (SZ(vec) && vec.back().fi <= c0[i]) { sum -= dp[vec.back().se] * (vec.back().fi - la); la = vec.back().fi; vec.pop_back(); } if (SZ(vec)) { sum -= dp[vec.back().se] * (vec.back().fi - la); sum += dp[vec.back().se] * (vec.back().fi - c0[i]); } } vec.eb(c0[i], i + 1); sum += dp[i + 1] * (c0[i] + 1); dp[i] = sum + 1; /* int la = -1; dp[i] = 1; per(j, SZ(vec)) { dp[i] += dp[vec[j].se] * (vec[j].fi - la); la = vec[j].fi; }*/ } cout << dp[0] * bb << endl; return 0; }