結果
問題 | No.1654 Binary Compression |
ユーザー | Sumitacchan |
提出日時 | 2021-08-20 23:26:23 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 7,180 bytes |
コンパイル時間 | 2,275 ms |
コンパイル使用メモリ | 208,432 KB |
実行使用メモリ | 47,664 KB |
最終ジャッジ日時 | 2024-10-14 07:13:03 |
合計ジャッジ時間 | 8,678 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
13,640 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,816 KB |
testcase_03 | AC | 2 ms
6,820 KB |
testcase_04 | AC | 2 ms
6,820 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 | 1 ms
6,816 KB |
testcase_09 | AC | 2 ms
6,816 KB |
testcase_10 | AC | 88 ms
28,148 KB |
testcase_11 | AC | 87 ms
28,544 KB |
testcase_12 | AC | 90 ms
28,704 KB |
testcase_13 | AC | 88 ms
28,476 KB |
testcase_14 | AC | 88 ms
27,392 KB |
testcase_15 | AC | 90 ms
27,948 KB |
testcase_16 | AC | 79 ms
47,664 KB |
testcase_17 | AC | 79 ms
46,284 KB |
testcase_18 | AC | 90 ms
29,548 KB |
testcase_19 | AC | 90 ms
29,104 KB |
testcase_20 | AC | 90 ms
28,956 KB |
testcase_21 | AC | 89 ms
28,468 KB |
testcase_22 | AC | 90 ms
30,584 KB |
testcase_23 | AC | 31 ms
8,732 KB |
testcase_24 | AC | 31 ms
9,164 KB |
testcase_25 | AC | 31 ms
8,784 KB |
testcase_26 | AC | 30 ms
7,676 KB |
testcase_27 | TLE | - |
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; //using namespace atcoder; struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; #define FOR(i, begin, end) for(int i=(begin);i<(end);i++) #define REP(i, n) FOR(i,0,n) #define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--) #define IREP(i, n) IFOR(i,0,n) #define Sort(v) sort(v.begin(), v.end()) #define Reverse(v) reverse(v.begin(), v.end()) #define all(v) v.begin(),v.end() #define SZ(v) ((int)v.size()) #define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x)) #define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x)) #define chmax(a, b) a = max(a, b) #define chmin(a, b) a = min(a, b) #define bit(n) (1LL<<(n)) #define debug(x) cout << #x << "=" << x << endl; #define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; } #define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} } #define pb push_back #define fi first #define se second #define int long long #define INF 1000000000000000000 template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; } template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; } template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; } template<typename T> void Out(T x) { cout << x << endl; } template<typename T1, typename T2> void chOut(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); } using vec = vector<int>; using mat = vector<vec>; using Pii = pair<int, int>; using v_bool = vector<bool>; using v_Pii = vector<Pii>; //int dx[4] = {1,0,-1,0}; //int dy[4] = {0,1,0,-1}; //char d[4] = {'D','R','U','L'}; //const int mod = 1000000007; //const int mod = 998244353; const int mod = 924844033; template<long long MOD> struct ModInt{ using ll = long long; ll val; void setval(ll v) { val = v % MOD; }; ModInt(): val(0) {} ModInt(ll v) { setval(v); }; ModInt operator+(const ModInt &x) const { return ModInt(val + x.val); } ModInt operator-(const ModInt &x) const { return ModInt(val - x.val + MOD); } ModInt operator*(const ModInt &x) const { return ModInt(val * x.val); } ModInt operator/(const ModInt &x) const { return *this * x.inv(); } ModInt operator-() const { return ModInt(MOD - val); } ModInt operator+=(const ModInt &x) { return *this = *this + x; } ModInt operator-=(const ModInt &x) { return *this = *this - x; } ModInt operator*=(const ModInt &x) { return *this = *this * x; } ModInt operator/=(const ModInt &x) { return *this = *this / x; } bool operator==(const ModInt &x) const { return (*this).val == x.val; } friend ostream& operator<<(ostream &os, const ModInt &x) { os << x.val; return os; } friend istream& operator>>(istream &is, ModInt &x) { is >> x.val; x.val = (x.val % MOD + MOD) % MOD; return is; } ModInt pow(ll n) const { ModInt a = 1; if(n == 0) return a; int i0 = 64 - __builtin_clzll(n); for(int i = i0 - 1; i >= 0; i--){ a = a * a; if((n >> i) & 1) a *= (*this); } return a; } ModInt inv() const { return this->pow(MOD - 2); } }; using mint = ModInt<mod>; mint pow(mint x, long long n) { return x.pow(n); } //using mint = double; //for debug using mvec = vector<mint>; using mmat = vector<mvec>; struct Combination{ vector<mint> fact, invfact; Combination(int N){ fact = vector<mint>({mint(1)}); invfact = vector<mint>({mint(1)}); fact_initialize(N); } void fact_initialize(int N){ int i0 = fact.size(); if(i0 >= N + 1) return; fact.resize(N + 1); invfact.resize(N + 1); for(int i = i0; i <= N; i++) fact[i] = fact[i - 1] * i; invfact[N] = (mint)1 / fact[N]; for(int i = N - 1; i >= i0; i--) invfact[i] = invfact[i + 1] * (i + 1); } mint nCr(int n, int r){ if(n < 0 || r < 0 || r > n) return mint(0); if(fact.size() < n + 1) fact_initialize(n); return fact[n] * invfact[r] * invfact[n - r]; } mint nPr(int n, int r){ if(n < 0 || r < 0 || r > n) return mint(0); if(fact.size() < n + 1) fact_initialize(n); return fact[n] * invfact[n - r]; } mint Catalan(int n){ if(n < 0) return 0; else if(n == 0) return 1; if(fact.size() < 2 * n + 1) fact_initialize(2 * n); return fact[2 * n] * invfact[n + 1] * invfact[n]; } }; struct SegmentTree { using T = mint; int N; vector<T> dat; T id = 0; T F(T &a, T &b) { return a + b; } SegmentTree(int n){ N = 1; while(n > N) N = N << 1; dat = vector<T>(2 * N - 1, id); } SegmentTree(int n, vector<T> &v){ N = 1; while(n > N) N = N << 1; dat = vector<T>(2 * N - 1, id); for(int i = 0; i < n; i++) dat[i + N - 1] = v[i]; for(int i = N - 2; i >= 0; i--) dat[i] = F(dat[i * 2 + 1], dat[i * 2 + 2]); } SegmentTree(){} void update(int k, T a){ k += N - 1; dat[k] = a; while(k > 0){ k = (k - 1) / 2; dat[k] = F(dat[k * 2 + 1], dat[k * 2 + 2]); } } void reset() { fill(dat.begin(), dat.end(), id); } T get(int a, int b, int k, int l, int r){ if(r <= a || b <= l) return id; if(a <= l && r <= b) return dat[k]; else{ T vl = get(a, b, k * 2 + 1, l, (l + r) / 2); T vr = get(a, b, k * 2 + 2, (l + r) / 2, r); return F(vl, vr); } } T get(int a, int b) { return get(a, b, 0, 0, N); } T val(int k){ return dat[k + N - 1]; } }; signed main(){ string S; cin >> S; int N = SZ(S); bool same = true; REP(i, N) if(S[i] != S[0]) same = false; if(same){ Out(N); return 0; } mint ans = 1; vec n0, n1; int t0 = 0, t1 = 0; REP(i, N){ if(i > 0 && S[i] != S[i - 1]){ if(S[i - 1] == '0'){ if(SZ(n1) == 0) ans *= t0 + 1; else n0.pb(t0); }else{ n1.pb(t1); } t0 = 0; t1 = 0; } if(S[i] == '0') t0++; else t1++; } if(t0 > 0) ans *= t0 + 1; if(t1 > 0) n1.pb(t1); //vdebug(n0); vdebug(n1); debug(ans); int sz = SZ(n1); mvec dp(sz, 0); mint t = 1; REP(i, sz){ if(i > 0){ int MM = 0; t += dp[i - 1] * n0[i - 1]; IFOR(j, 0, i - 1){ chmax(MM, n0[j]); if(MM >= n0[i - 1]) break; t += dp[j] * (n0[i - 1] - MM); } } dp[i] = t * n1[i]; } //vdebug(dp); mint ss = 0; REP(i, sz) ss += dp[i]; ans *= ss; Out(ans); return 0; }