結果
問題 | No.1654 Binary Compression |
ユーザー | tokusakurai |
提出日時 | 2021-08-20 23:18:39 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 3,919 bytes |
コンパイル時間 | 2,285 ms |
コンパイル使用メモリ | 210,936 KB |
実行使用メモリ | 813,600 KB |
最終ジャッジ日時 | 2024-10-14 06:57:26 |
合計ジャッジ時間 | 10,277 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | RE | - |
testcase_01 | RE | - |
testcase_02 | AC | 2 ms
6,816 KB |
testcase_03 | RE | - |
testcase_04 | RE | - |
testcase_05 | RE | - |
testcase_06 | RE | - |
testcase_07 | AC | 2 ms
6,816 KB |
testcase_08 | AC | 2 ms
6,816 KB |
testcase_09 | AC | 2 ms
6,816 KB |
testcase_10 | AC | 274 ms
124,092 KB |
testcase_11 | AC | 273 ms
123,488 KB |
testcase_12 | AC | 283 ms
126,636 KB |
testcase_13 | AC | 281 ms
126,108 KB |
testcase_14 | AC | 275 ms
123,488 KB |
testcase_15 | AC | 283 ms
125,984 KB |
testcase_16 | AC | 162 ms
105,656 KB |
testcase_17 | AC | 161 ms
105,788 KB |
testcase_18 | AC | 282 ms
127,156 KB |
testcase_19 | AC | 283 ms
127,032 KB |
testcase_20 | AC | 284 ms
127,284 KB |
testcase_21 | AC | 283 ms
127,288 KB |
testcase_22 | AC | 283 ms
127,160 KB |
testcase_23 | RE | - |
testcase_24 | AC | 61 ms
29,256 KB |
testcase_25 | RE | - |
testcase_26 | AC | 62 ms
29,856 KB |
testcase_27 | MLE | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
testcase_41 | -- | - |
testcase_42 | -- | - |
testcase_43 | -- | - |
testcase_44 | -- | - |
testcase_45 | -- | - |
testcase_46 | -- | - |
testcase_47 | -- | - |
testcase_48 | -- | - |
testcase_49 | -- | - |
testcase_50 | -- | - |
testcase_51 | -- | - |
testcase_52 | -- | - |
ソースコード
#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<int>> nxt(K-1); vector<int> v; rep3(i, K-1, 0){ nxt[i] = v; reverse(all(nxt[i])); while(!empty(v) && cnt[v.back()] <= cnt[i]) v.pop_back(); v.eb(i); } vector<mint> dp(K-1, 0); dp[0] = cnt[0]+1; rep(i, K-2){ int pre = -1; each(e, nxt[i]){ dp[e] += dp[i]*(cnt[e]-pre); pre = cnt[e]; } } //rep(i, K-1) cout << dp[i] << ' '; cout << '\n'; cout << accumulate(all(dp), mint(0))*(cnt[K-1]+1) << '\n'; }