結果
問題 | No.1654 Binary Compression |
ユーザー | tokusakurai |
提出日時 | 2021-08-20 23:46:19 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 468 ms / 2,000 ms |
コード長 | 4,465 bytes |
コンパイル時間 | 2,481 ms |
コンパイル使用メモリ | 217,844 KB |
実行使用メモリ | 262,784 KB |
最終ジャッジ日時 | 2024-10-14 07:59:22 |
合計ジャッジ時間 | 12,171 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,820 KB |
testcase_03 | AC | 2 ms
6,816 KB |
testcase_04 | AC | 2 ms
6,816 KB |
testcase_05 | AC | 2 ms
6,816 KB |
testcase_06 | AC | 2 ms
6,816 KB |
testcase_07 | AC | 2 ms
6,820 KB |
testcase_08 | AC | 2 ms
6,816 KB |
testcase_09 | AC | 2 ms
6,820 KB |
testcase_10 | AC | 299 ms
129,216 KB |
testcase_11 | AC | 303 ms
129,344 KB |
testcase_12 | AC | 311 ms
133,068 KB |
testcase_13 | AC | 311 ms
130,844 KB |
testcase_14 | AC | 303 ms
129,236 KB |
testcase_15 | AC | 312 ms
132,912 KB |
testcase_16 | AC | 177 ms
112,432 KB |
testcase_17 | AC | 176 ms
114,104 KB |
testcase_18 | AC | 311 ms
132,028 KB |
testcase_19 | AC | 314 ms
133,016 KB |
testcase_20 | AC | 311 ms
132,152 KB |
testcase_21 | AC | 313 ms
134,656 KB |
testcase_22 | AC | 317 ms
132,028 KB |
testcase_23 | AC | 12 ms
8,080 KB |
testcase_24 | AC | 13 ms
8,796 KB |
testcase_25 | AC | 13 ms
8,672 KB |
testcase_26 | AC | 13 ms
8,240 KB |
testcase_27 | AC | 151 ms
88,492 KB |
testcase_28 | AC | 151 ms
88,640 KB |
testcase_29 | AC | 13 ms
8,220 KB |
testcase_30 | AC | 13 ms
7,832 KB |
testcase_31 | AC | 12 ms
8,344 KB |
testcase_32 | AC | 13 ms
8,172 KB |
testcase_33 | AC | 148 ms
88,552 KB |
testcase_34 | AC | 150 ms
89,232 KB |
testcase_35 | AC | 13 ms
8,864 KB |
testcase_36 | AC | 13 ms
8,692 KB |
testcase_37 | AC | 13 ms
8,124 KB |
testcase_38 | AC | 13 ms
7,836 KB |
testcase_39 | AC | 468 ms
261,340 KB |
testcase_40 | AC | 451 ms
262,784 KB |
testcase_41 | AC | 346 ms
218,716 KB |
testcase_42 | AC | 13 ms
9,276 KB |
testcase_43 | AC | 12 ms
8,804 KB |
testcase_44 | AC | 345 ms
219,524 KB |
testcase_45 | AC | 347 ms
219,684 KB |
testcase_46 | AC | 12 ms
8,112 KB |
testcase_47 | AC | 2 ms
6,820 KB |
testcase_48 | AC | 2 ms
6,816 KB |
testcase_49 | AC | 190 ms
120,772 KB |
testcase_50 | AC | 162 ms
102,912 KB |
testcase_51 | AC | 167 ms
68,944 KB |
testcase_52 | AC | 165 ms
69,708 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define rep2(i, x, n) for(int i = x; i <= n; i++) #define rep3(i, x, n) for(int i = x; i >= n; i--) #define each(e, v) for(auto &e: v) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)x.size() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; const int MOD = 924844033; //const int MOD = 998244353; const int inf = (1<<30)-1; const ll INF = (1LL<<60)-1; template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;}; template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;}; struct io_setup{ io_setup(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; template<int mod> struct Mod_Int{ int x; Mod_Int() : x(0) {} Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} Mod_Int &operator += (const Mod_Int &p){ if((x += p.x) >= mod) x -= mod; return *this; } Mod_Int &operator -= (const Mod_Int &p){ if((x += mod - p.x) >= mod) x -= mod; return *this; } Mod_Int &operator *= (const Mod_Int &p){ x = (int) (1LL * x * p.x % mod); return *this; } Mod_Int &operator /= (const Mod_Int &p){ *this *= p.inverse(); return *this; } Mod_Int &operator ++ () {return *this += Mod_Int(1);} Mod_Int operator ++ (int){ Mod_Int tmp = *this; ++*this; return tmp; } Mod_Int &operator -- () {return *this -= Mod_Int(1);} Mod_Int operator -- (int){ Mod_Int tmp = *this; --*this; return tmp; } Mod_Int operator - () const {return Mod_Int(-x);} Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;} Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;} Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;} Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;} bool operator == (const Mod_Int &p) const {return x == p.x;} bool operator != (const Mod_Int &p) const {return x != p.x;} Mod_Int inverse() const{ assert(*this != Mod_Int(0)); return pow(mod-2); } Mod_Int pow(long long k) const{ Mod_Int now = *this, ret = 1; for(; k > 0; k >>= 1, now *= now){ if(k&1) ret *= now; } return ret; } friend ostream &operator << (ostream &os, const Mod_Int &p){ return os << p.x; } friend istream &operator >> (istream &is, Mod_Int &p){ long long a; is >> a; p = Mod_Int<mod>(a); return is; } }; using mint = Mod_Int<MOD>; int main(){ string S; cin >> S; int N = sz(S); S += '1'; vector<int> cnt, ids; int ptr = 0; while(ptr <= N){ int j = 0; while(ptr+j <= N && S[ptr+j] == '0') j++; ptr += j; cnt.eb(j), ids.eb(ptr); ptr++; } int K = sz(ids); //rep(i, K) cout << cnt[i] << ' ' << ids[i] << '\n'; if(K == 1){ cout << N << '\n'; return 0; } vector<vector<tuple<int, int, int>>> p(K-1); vector<int> v; vector<pii> tmp; rep3(i, K-2, 0){ while(!empty(v) && cnt[v.back()] <= cnt[i]){ int t = v.back(); auto [r, c] = tmp.back(); v.pop_back(), tmp.pop_back(); p[t].eb(i, r, c); } if(!empty(v)){ int t = v.back(); auto [r, c] = tmp.back(); p[t].eb(i, r, c); tmp.back().first = i; tmp.back().second = cnt[t]-cnt[i]; } v.eb(i); tmp.eb(i, cnt[i]+1); } rep(i, sz(v)){ int t = v[i]; auto [r, c] = tmp[i]; p[t].eb(0, r, c); } vector<mint> dp(K-1, 0); vector<mint> s(K, 0); dp[0] = cnt[0]+1; s[1] = dp[0]; rep2(i, 1, K-2){ int pre = -1; each(e, p[i]){ auto [l, r, c] = e; dp[i] += (s[r]-s[l])*c; } s[i+1] = s[i]+dp[i]; } //rep(i, K-1) cout << dp[i] << ' '; cout << '\n'; cout << accumulate(all(dp), mint(0))*(cnt[K-1]+1) << '\n'; }