結果
問題 | No.1654 Binary Compression |
ユーザー | n_vip |
提出日時 | 2021-08-20 23:40:00 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 9,825 bytes |
コンパイル時間 | 1,552 ms |
コンパイル使用メモリ | 146,160 KB |
実行使用メモリ | 59,468 KB |
最終ジャッジ日時 | 2024-10-14 07:45:25 |
合計ジャッジ時間 | 8,481 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | AC | 67 ms
22,372 KB |
testcase_43 | AC | 67 ms
22,368 KB |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | AC | 68 ms
22,368 KB |
testcase_47 | AC | 50 ms
16,340 KB |
testcase_48 | AC | 52 ms
16,384 KB |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
ソースコード
#include <string> #include <vector> #include<iostream> #include<cstdio> #include<cstdlib> #include<stack> #include<queue> #include<cmath> #include<algorithm> #include<functional> #include<list> #include<deque> #include<bitset> #include<set> #include<map> #include<unordered_map> #include<unordered_set> #include<cstring> #include<sstream> #include<complex> #include<iomanip> #include<numeric> #include<cassert> #include<random> #define X first #define Y second #define pb push_back #define rep(X,Y) for (int (X) = 0;(X) < (int)(Y);++(X)) #define reps(X,S,Y) for (int (X) = (int)(S);(X) < (int)(Y);++(X)) #define rrep(X,Y) for (int (X) = (int)(Y)-1;(X) >=0;--(X)) #define rreps(X,S,Y) for (int (X) = (int)(Y)-1;(X) >= (int)(S);--(X)) #define repe(X,Y) for ((X) = 0;(X) < (Y);++(X)) #define peat(X,Y) for (;(X) < (Y);++(X)) #define all(X) (X).begin(),(X).end() #define rall(X) (X).rbegin(),(X).rend() #define eb emplace_back #define UNIQUE(X) (X).erase(unique(all(X)),(X).end()) #define Endl endl #define NL <<"\n" #define cauto const auto using namespace std; using ll=long long; using pii=pair<int,int>; using pll=pair<ll,ll>; template<class T> using vv=vector<vector<T>>; template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;} template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;} //#undef NUIP #ifdef NUIP #include "benri.h" #else #define out(args...) #endif void ouT(ll x,int d=3){auto re=to_string(x);if((int)re.size()>d) re=x>0?"oo":"-oo";cout<<string(d-re.size(),' ')<<re<<",";} #ifdef __cpp_init_captures template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);} template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));} #endif template<class A,class B> pair<A,B> operator+(const pair<A,B> &p,const pair<A,B> &q){ return {p.X+q.X,p.Y+q.Y};} template<class A,class B,class C,class D> pair<A,B>& operator+=(pair<A,B> &p,const pair<C,D> &q){ p.X+=q.X; p.Y+=q.Y; return p;} template<class A,class B> pair<A,B> operator-(const pair<A,B> &p,const pair<A,B> &q){ return {p.X-q.X,p.Y-q.Y};} template<class A,class B,class C,class D> pair<A,B>& operator-=(pair<A,B> &p,const pair<C,D> &q){ p.X-=q.X; p.Y-=q.Y; return p;} template<class A,class B> istream& operator>>(istream &is, pair<A,B> &p){ is>>p.X>>p.Y; return is;} template<class T=ll> T read(){ T re; cin>>re; return re;} template<class T=ll> T read(const T &dec){ T re; cin>>re; return re-dec;} template<class T=ll> vector<T> readV(const int sz){ vector<T> re(sz); for(auto &x:re) x=read<T>(); return re;} template<class T=ll> vector<T> readV(const int sz, const T &dec){ vector<T> re(sz); for(auto &x:re) x=read<T>(dec); return re;} vv<int> readG(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); g[b].pb(a);} return g;} vv<int> readG(const int &n){ return readG(n,n-1);} vv<int> readD(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); } return g;} vv<int> readD(const int &n){ return readD(n,n-1);} template<class T> vv<pair<int,T>> readG(const int &n,const int &m){ vv<pair<int,T>> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); cauto c=read<T>(); g[a].eb(b,c); g[b].eb(a,c);} return g;} template<class T> vv<pair<int,T>> readG(const int &n){ return readG<T>(n,n-1);} template<class T> vv<pair<int,T>> readD(const int &n,const int &m){ vv<pair<int,T>> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); cauto c=read<T>(); g[a].eb(b,c); } return g;} template<class T> vv<pair<int,T>> readD(const int &n){ return readD<T>(n,n-1);} #ifdef __cpp_init_captures template<typename T> vector<T> readT(int n, T v){ return readV(n,v);} template <class... Args> auto readT(int n, Args... args){ vector re(1,readT(args...));rep(_,n-1) re.eb(readT(args...)); return re;} template<typename T, size_t... Is> void addadd(T& t1, const T& t2, integer_sequence<size_t, Is...>){ cauto l = { (get<Is>(t1) += get<Is>(t2), 0)... }; (void)l;} template <typename...T>tuple<T...>& operator += (tuple<T...>& lhs, const tuple<T...>& rhs){ addadd(lhs, rhs, index_sequence_for<T...>{}); return lhs;} template <typename...T>tuple<T...> operator +(tuple<T...> lhs, const tuple<T...>& rhs){ return lhs += rhs;} template<typename T, size_t... Is> void subsub(T& t1, const T& t2, integer_sequence<size_t, Is...>){ cauto l = { (get<Is>(t1) -= get<Is>(t2), 0)... }; (void)l;} template <typename...T>tuple<T...>& operator -= (tuple<T...>& lhs, const tuple<T...>& rhs){ subsub(lhs, rhs, index_sequence_for<T...>{}); return lhs;} template <typename...T>tuple<T...> operator - (tuple<T...> lhs, const tuple<T...>& rhs){ return lhs -= rhs;} template<class Tuple, size_t... Is> void read_tuple_impl(istream &is, Tuple& t, index_sequence<Is...>){((is >> get<Is>(t)), ...);} template<class... Args> auto& operator>>(istream &is, tuple<Args...>& t){ read_tuple_impl(is, t, index_sequence_for<Args...>{}); return is;} #endif #define TT cauto TTT=read();rep(_,TTT) const ll MOD=924844033; ll modpow_(ll r,ll n,ll m=MOD){ ll re=1,d=r%m; if(n<0)(n%=m-1)+=m-1; for(;n;n/=2){ if(n&1)(re*=d)%=m; (d*=d)%=m; } return re; } template <int mod=MOD> struct ModInt{ int v; ModInt(int v=0):v(v){} ModInt operator+(const ModInt &n)const{return v+n.v<mod ? v+n.v : v+n.v-mod;} ModInt operator-(const ModInt &n)const{return v-n.v<0 ? v-n.v+mod : v-n.v;} ModInt operator*(const ModInt &n)const{return int(ll(v)*n.v%mod);} ModInt operator/(const ModInt &n)const{return int(ll(v)*modpow_(n.v%mod,-1,mod)%mod);} ModInt operator+(const int &n)const{return v+n<mod ? v+n : v+n-mod;} ModInt operator-(const int &n)const{return v-n<0 ? v-n+mod : v-n;} ModInt operator*(const ll &n)const{return int(ll(v)*(n%mod)%mod);} ModInt operator/(const ll &n)const{return int(ll(v)*modpow_(n%mod,-1,mod)%mod);} ModInt& operator+=(const ModInt &n){v+=n.v; if(v>=mod) v-=mod; return *this;} ModInt& operator-=(const ModInt &n){v-=n.v; if(v<0) v+=mod; return *this;} ModInt& operator*=(const ModInt &n){v=ll(v)*n.v%mod; return *this;} ModInt& operator/=(const ModInt &n){v=ll(v)*modpow_(n.v,-1,mod)%mod; return *this;} ModInt& operator+=(const int &n){v+=n; if(v>=mod) v-=mod; return *this;} ModInt& operator-=(const int &n){v-=n; if(v<0) v+=mod; return *this;} ModInt& operator*=(const ll &n){v=ll(v)*n%mod; return *this;} ModInt& operator/=(const ll &n){v=ll(v)*modpow_(n,-1,mod)%mod; return *this;} bool operator==(const ModInt &n)const{return v==n.v;}; bool operator!=(const ModInt &n)const{return v!=n.v;}; ModInt& operator++(){ return operator+=(1); } ModInt& operator--(){ return operator-=(1); } ModInt operator++(int i){ ModInt tmp(*this); operator++(); return tmp; } ModInt operator--(int i){ ModInt tmp(*this); operator--(); return tmp; } }; #ifdef NUIP class MINT_FRAC____{ public: unordered_map<int,pii> dict; MINT_FRAC____(int n){ rep(p,n+1)reps(q,1,n+1)if(__gcd(p,q)==1){ dict[int(1ll*p*modpow_(q,-1)%MOD)]=pii(p,q); dict[int(MOD-1ll*p*modpow_(q,-1)%MOD)]=pii(-p,q); } } } Il1Il1Il1(1000); template<int mod> ostream& operator<<(ostream &os,const ModInt<mod> &n){if(Il1Il1Il1.dict.count(n.v)) os<<n.v, cerr<<"("<<Il1Il1Il1.dict[n.v].X<<"/"<<Il1Il1Il1.dict[n.v].Y<<")";else os<<n.v;return os;}; #else template<int mod> ostream& operator<<(ostream &os,const ModInt<mod> &n){return os<<n.v;}; #endif template<int mod> ModInt<mod> operator+(const ll &n,const ModInt<mod> &m){return m.v+n<mod ? m.v+n : m.v+n-mod;} template<int mod> ModInt<mod> operator-(const ll &n,const ModInt<mod> &m){return n-m.v<0 ? n-m.v+mod : n-m.v;} template<int mod> ModInt<mod> operator*(const ll &n,const ModInt<mod> &m){return ll(m.v)*(n%mod)%mod;} template<int mod> ModInt<mod> operator/(const ll &n,const ModInt<mod> &m){return ModInt<mod>(n%mod)/m;} typedef ModInt<MOD> mint; template <int mod> ModInt<mod> modpow(ModInt<mod> r,ll n){ ModInt<mod> re(1); if(n<0)(n%=mod-1)+=mod-1; for(;n;n/=2){if(n&1) re*=r; r*=r;} return re;} vector<mint> fact,finv,inv; mint comb(ll n,ll r){ if(n<r||r<0)return 0; return fact[n]*finv[n-r]*finv[r];} class Doralion{ void Modinvs(vector<mint> &re,int n){ re.resize(n+1); re[1]=1; for(int i=2;i<=n;++i)re[i]=re[MOD%i]*(MOD-MOD/i);} void Facts(vector<mint> &re,int n){ re.resize(n+1); re[0]=1; rep(i,n)re[i+1]=re[i]*(i+1);} void Factinvs(vector<mint> &re,const vector<mint> &inv,int n){ re.resize(n+1); re[0]=1; rep(i,n)re[i+1]=re[i]*inv[i+1];} public: Doralion(int n){ Modinvs(inv,n); Facts(fact,n); Factinvs(finv,inv,n);} } doralion(1123456); using pmm=pair<mint,mint>; mint modpow(ll r,ll n){ return (int)modpow_(r,n);} mint solve(const vector<int> vs){ const int n=vs.size(); vector<mint> dp(n+2); vector<pii> stk{{MOD,-1}}; mint sum=0; rrep(i,n){ cauto &v=vs[i]; while(stk.back().X<=v) stk.pop_back(); sum-=(v+1)*(dp[stk.back().Y+1]+1); stk.eb(v,i); sum+=(v+1)*(dp[stk.back().Y+1]+1); dp[i]=sum; // int last=-1; // rreps(ii,1,stk.size()){ // cauto &[v,j]=stk[ii]; // dp[i]+=(v-last)*(dp[j+1]+1); // last=v; // } } // out(vs,dp,1); return dp[0]+1; } mint solve(const string s){ vector<int> lens(1); for(cauto &c:s){ if(c=='1') lens.eb(); else ++lens.back(); } if(lens.size()==1) return lens[0]; mint re=mint(lens[0]+1)*(lens.back()+1); lens.pop_back(); lens.erase(lens.begin()); return re*solve(lens); } int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout<<fixed<<setprecision(0); // out(solve("0100101"),1); // out(solve("1010010"),1); // return 0; if(0){ rep(_,1000){ const int n=rand()%100+1; string s(n,'0'); for(auto &c:s)if(rand()%2) c++; cauto a=solve(s); reverse(all(s)); cauto b=solve(s); if(a!=b){ out(a,b,s,1); return 0; } } return 0; } cauto s=read<string>(); cout<<solve(s) NL; return 0; }