結果
問題 | No.1654 Binary Compression |
ユーザー | snuke |
提出日時 | 2021-08-21 19:54:10 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 122 ms / 2,000 ms |
コード長 | 5,209 bytes |
コンパイル時間 | 2,380 ms |
コンパイル使用メモリ | 214,776 KB |
実行使用メモリ | 40,724 KB |
最終ジャッジ日時 | 2024-10-15 10:31:18 |
合計ジャッジ時間 | 11,079 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 5 ms
15,024 KB |
testcase_01 | AC | 6 ms
15,208 KB |
testcase_02 | AC | 6 ms
14,976 KB |
testcase_03 | AC | 6 ms
15,044 KB |
testcase_04 | AC | 6 ms
14,976 KB |
testcase_05 | AC | 7 ms
15,036 KB |
testcase_06 | AC | 6 ms
14,868 KB |
testcase_07 | AC | 5 ms
15,036 KB |
testcase_08 | AC | 6 ms
15,104 KB |
testcase_09 | AC | 6 ms
14,976 KB |
testcase_10 | AC | 113 ms
28,348 KB |
testcase_11 | AC | 116 ms
28,420 KB |
testcase_12 | AC | 119 ms
28,736 KB |
testcase_13 | AC | 116 ms
28,540 KB |
testcase_14 | AC | 117 ms
28,420 KB |
testcase_15 | AC | 119 ms
28,540 KB |
testcase_16 | AC | 92 ms
28,724 KB |
testcase_17 | AC | 94 ms
28,720 KB |
testcase_18 | AC | 122 ms
28,720 KB |
testcase_19 | AC | 119 ms
28,720 KB |
testcase_20 | AC | 119 ms
28,784 KB |
testcase_21 | AC | 122 ms
28,720 KB |
testcase_22 | AC | 120 ms
28,724 KB |
testcase_23 | AC | 82 ms
15,000 KB |
testcase_24 | AC | 82 ms
15,024 KB |
testcase_25 | AC | 82 ms
15,176 KB |
testcase_26 | AC | 82 ms
15,176 KB |
testcase_27 | AC | 90 ms
24,852 KB |
testcase_28 | AC | 91 ms
24,912 KB |
testcase_29 | AC | 81 ms
15,048 KB |
testcase_30 | AC | 81 ms
15,056 KB |
testcase_31 | AC | 81 ms
15,052 KB |
testcase_32 | AC | 81 ms
15,020 KB |
testcase_33 | AC | 91 ms
24,956 KB |
testcase_34 | AC | 91 ms
24,852 KB |
testcase_35 | AC | 80 ms
15,056 KB |
testcase_36 | AC | 83 ms
15,048 KB |
testcase_37 | AC | 81 ms
15,052 KB |
testcase_38 | AC | 81 ms
15,056 KB |
testcase_39 | AC | 105 ms
40,584 KB |
testcase_40 | AC | 105 ms
40,460 KB |
testcase_41 | AC | 105 ms
40,472 KB |
testcase_42 | AC | 72 ms
15,048 KB |
testcase_43 | AC | 73 ms
15,052 KB |
testcase_44 | AC | 103 ms
40,724 KB |
testcase_45 | AC | 102 ms
40,592 KB |
testcase_46 | AC | 69 ms
7,312 KB |
testcase_47 | AC | 6 ms
14,976 KB |
testcase_48 | AC | 2 ms
5,248 KB |
testcase_49 | AC | 92 ms
27,496 KB |
testcase_50 | AC | 91 ms
27,620 KB |
testcase_51 | AC | 96 ms
20,800 KB |
testcase_52 | AC | 98 ms
20,784 KB |
ソースコード
#include <bits/stdc++.h> #define fi first #define se second #define rep(i,n) for(int i = 0; i < (n); ++i) #define rrep(i,n) for(int i = 1; i <= (n); ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) #define srep(i,s,t) for (int i = s; i < (t); ++i) #define dsrep(i,t,s) for(int i = (t)-1; i >= (s); --i) #define rng(a) a.begin(),a.end() #define rrng(a) a.rbegin(),a.rend() #define isin(x,l,r) ((l) <= (x) && (x) < (r)) #define pb push_back #define eb emplace_back #define sz(x) (int)(x).size() #define pcnt __builtin_popcountll #define snuke srand((unsigned)clock()+(unsigned)time(NULL)); #define show(x) cerr<<#x<<" = "<<x<<endl; #define bn(x) ((1<<(x))-1) #define newline puts("") using namespace std; template<typename T> using vc = vector<T>; template<typename T> using vv = vc<vc<T>>; template<typename T> using PQ = priority_queue<T,vc<T>,greater<T> >; using ll = long long; using uint = unsigned; using ull = unsigned long long; using P = pair<int,int>; using T3 = tuple<int,int,int>; using vi = vc<int>; using vvi = vv<int>; using vl = vc<ll>; using vp = vc<P>; using vt = vc<T3>; int getInt(){int x;scanf("%d",&x);return x;} vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;} template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;} template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();} template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;} template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;} template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;} vc<string> split(const string& s,char d=' '){vc<string> r(1);for(char c:s)if(c==d)r.pb("");else r.back()+=c;return r;} string operator*(const string& s,int t){return join(vc<string>(t,s));} template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;} template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;} template<typename T>T dup(T x, T y){return (x+y-1)/y;} template<typename T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;} template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());} const double eps = 1e-10; const ll LINF = 1001002003004005006ll; const int INF = 1001001001; #define dame { puts("-1"); return;} #define yn {puts("Yes");}else{puts("No");} const int MX = 3000005; // Mod int const uint mod = 924844033; struct mint { uint x; mint(): x(0) {} mint(ll x):x((x%mod+mod)%mod) {} mint operator-() const { return mint(0) - *this;} mint operator~() const { return mint(1) / *this;} mint& operator+=(const mint& a) { if((x+=a.x)>=mod) x-=mod; return *this;} mint& operator-=(const mint& a) { if((x+=mod-a.x)>=mod) x-=mod; return *this;} mint& operator*=(const mint& a) { x=(ull)x*a.x%mod; return *this;} mint& operator/=(const mint& a) { x=(ull)x*a.pow(mod-2).x%mod; return *this;} mint operator+(const mint& a) const { return mint(*this) += a;} mint operator-(const mint& a) const { return mint(*this) -= a;} mint operator*(const mint& a) const { return mint(*this) *= a;} mint operator/(const mint& a) const { return mint(*this) /= a;} mint pow(ll t) const { if(!t) return 1; mint res = pow(t/2); res *= res; return (t&1)?res*x:res; } bool operator<(const mint& a) const { return x < a.x;} bool operator==(const mint& a) const { return x == a.x;} bool operator!=(const mint& a) const { return x != a.x;} }; mint ex(mint x, ll t) { return x.pow(t);} istream& operator>>(istream&i,mint&a) {i>>a.x;return i;} //* ostream& operator<<(ostream&o,const mint&a) {o<<a.x;return o;} /*/ ostream& operator<<(ostream&o, const mint&x) { int a = x.x, b = 1; rep(s,2)rrep(i,1000) { int y = ((s?-x:x)*i).x; if (abs(a)+b > y+i) a = s?-y:y, b = i; } o<<a; if (b != 1) o<<'/'<<b; return o; }//*/ using vm = vector<mint>; using vvm = vector<vm>; struct comb { vm f, g; comb() {} comb(int mx): f(mx+1), g(mx+1) { f[0] = 1; rrep(i,mx) f[i] = f[i-1]*i; g[mx] = f[mx].pow(mod-2); for(int i = mx; i > 0; --i) g[i-1] = g[i]*i; } mint operator()(int a, int b) { if (a < b || b < 0) return 0; return f[a]*g[b]*g[a-b]; } }; // struct Solver { vi read() { string s; cin>>s; int len = 0; vi a; for (char c : s) { if (c == '0') ++len; else a.pb(len), len = 0; } a.pb(len); return a; } void solve() { vi a = read(); int n = sz(a); if (n == 1) { cout<<a[0]<<endl; return; } mint mul = mint(a[0]+1)*(a.back()+1); a.pop_back(); a.erase(a.begin()); n -= 2; vm dp(n+1); vi p(MX,-1); dp[0] = 1; rep(i,n) { mint now; rep(j,a[i]+1) { now += dp[i]; if (p[j] != -1) now -= dp[p[j]]; p[j] = i; } dp[i+1] = dp[i]+now; } mint ans = dp[n]; ans *= mul; cout<<ans<<endl; } }; int main() { int ts = 1; // scanf("%d",&ts); rrep(ti,ts) { Solver solver; solver.solve(); } return 0; }