結果

問題 No.1654 Binary Compression
ユーザー sigma425sigma425
提出日時 2021-08-20 23:14:38
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 70 ms / 2,000 ms
コード長 4,528 bytes
コンパイル時間 2,248 ms
コンパイル使用メモリ 204,724 KB
実行使用メモリ 57,488 KB
最終ジャッジ日時 2024-10-14 06:47:26
合計ジャッジ時間 6,477 ms
ジャッジサーバーID
(参考情報)
judge2 / judge3
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 6 ms
15,148 KB
testcase_01 AC 5 ms
15,112 KB
testcase_02 AC 5 ms
15,152 KB
testcase_03 AC 5 ms
15,180 KB
testcase_04 AC 5 ms
15,136 KB
testcase_05 AC 5 ms
15,176 KB
testcase_06 AC 6 ms
15,232 KB
testcase_07 AC 5 ms
15,144 KB
testcase_08 AC 6 ms
15,180 KB
testcase_09 AC 6 ms
15,180 KB
testcase_10 AC 67 ms
37,556 KB
testcase_11 AC 66 ms
36,432 KB
testcase_12 AC 68 ms
37,992 KB
testcase_13 AC 68 ms
36,924 KB
testcase_14 AC 67 ms
36,784 KB
testcase_15 AC 67 ms
37,608 KB
testcase_16 AC 40 ms
36,560 KB
testcase_17 AC 44 ms
39,136 KB
testcase_18 AC 68 ms
37,628 KB
testcase_19 AC 67 ms
36,672 KB
testcase_20 AC 69 ms
37,616 KB
testcase_21 AC 70 ms
39,304 KB
testcase_22 AC 68 ms
36,736 KB
testcase_23 AC 21 ms
19,576 KB
testcase_24 AC 21 ms
19,800 KB
testcase_25 AC 21 ms
19,308 KB
testcase_26 AC 22 ms
19,516 KB
testcase_27 AC 34 ms
28,272 KB
testcase_28 AC 35 ms
29,980 KB
testcase_29 AC 21 ms
20,196 KB
testcase_30 AC 21 ms
20,100 KB
testcase_31 AC 20 ms
20,052 KB
testcase_32 AC 22 ms
19,300 KB
testcase_33 AC 35 ms
28,652 KB
testcase_34 AC 34 ms
28,268 KB
testcase_35 AC 20 ms
19,612 KB
testcase_36 AC 21 ms
19,788 KB
testcase_37 AC 20 ms
20,308 KB
testcase_38 AC 21 ms
20,676 KB
testcase_39 AC 62 ms
56,220 KB
testcase_40 AC 60 ms
56,368 KB
testcase_41 AC 61 ms
57,488 KB
testcase_42 AC 16 ms
19,764 KB
testcase_43 AC 17 ms
20,068 KB
testcase_44 AC 61 ms
54,960 KB
testcase_45 AC 57 ms
55,988 KB
testcase_46 AC 15 ms
19,256 KB
testcase_47 AC 5 ms
15,020 KB
testcase_48 AC 6 ms
15,196 KB
testcase_49 AC 40 ms
36,424 KB
testcase_50 AC 41 ms
36,836 KB
testcase_51 AC 46 ms
27,072 KB
testcase_52 AC 47 ms
27,160 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> void chmax(T& x, U y){if(x<y) x=y;}
template<class T,class U> void chmin(T& x, U y){if(y<x) x=y;}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}
template<class T>
V<T> Vec(size_t a) {
    return V<T>(a);
}
template<class T, class... Ts>
auto Vec(size_t a, Ts... ts) {
  return V<decltype(Vec<T>(ts...))>(a, Vec<T>(ts...));
}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ~ ";
	dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {";  \
	for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif
template<unsigned int mod_>
struct ModInt{
	using uint = unsigned int;
	using ll = long long;
	using ull = unsigned long long;

	constexpr static uint mod = mod_;

	uint v;
	ModInt():v(0){}
	ModInt(ll _v):v(normS(_v%mod+mod)){}
	explicit operator bool() const {return v!=0;}
	static uint normS(const uint &x){return (x<mod)?x:x-mod;}		// [0 , 2*mod-1] -> [0 , mod-1]
	static ModInt make(const uint &x){ModInt m; m.v=x; return m;}
	ModInt operator+(const ModInt& b) const { return make(normS(v+b.v));}
	ModInt operator-(const ModInt& b) const { return make(normS(v+mod-b.v));}
	ModInt operator-() const { return make(normS(mod-v)); }
	ModInt operator*(const ModInt& b) const { return make((ull)v*b.v%mod);}
	ModInt operator/(const ModInt& b) const { return *this*b.inv();}
	ModInt& operator+=(const ModInt& b){ return *this=*this+b;}
	ModInt& operator-=(const ModInt& b){ return *this=*this-b;}
	ModInt& operator*=(const ModInt& b){ return *this=*this*b;}
	ModInt& operator/=(const ModInt& b){ return *this=*this/b;}
	ModInt& operator++(int){ return *this=*this+1;}
	ModInt& operator--(int){ return *this=*this-1;}
	ModInt pow(ll p) const {
		if(p<0) return inv().pow(-p);
		ModInt a = 1;
		ModInt x = *this;
		while(p){
			if(p&1) a *= x;
			x *= x;
			p >>= 1;
		}
		return a;
	}
	ModInt inv() const {		// should be prime
		return pow(mod-2);
	}
	// ll extgcd(ll a,ll b,ll &x,ll &y) const{
	// 	ll p[]={a,1,0},q[]={b,0,1};
	// 	while(*q){
	// 		ll t=*p/ *q;
	// 		rep(i,3) swap(p[i]-=t*q[i],q[i]);
	// 	}
	// 	if(p[0]<0) rep(i,3) p[i]=-p[i];
	// 	x=p[1],y=p[2];
	// 	return p[0];
	// }
	// ModInt inv() const {
	// 	ll x,y;
	// 	extgcd(v,mod,x,y);
	// 	return make(normS(x+mod));
	// }

	bool operator==(const ModInt& b) const { return v==b.v;}
	bool operator!=(const ModInt& b) const { return v!=b.v;}
	bool operator<(const ModInt& b) const { return v<b.v;}
	friend istream& operator>>(istream &o,ModInt& x){
		ll tmp;
		o>>tmp;
		x=ModInt(tmp);
		return o;
	}
	friend ostream& operator<<(ostream &o,const ModInt& x){ return o<<x.v;}
};
using mint = ModInt<924844033>;

mint dp[3000010];
mint sm;

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);		//DON'T USE scanf/printf/puts !!
	cout << fixed << setprecision(20);

	string s; cin >> s;
	V<int> a;
	{
		V<int> one;
		one.pb(-1);
		rep(i,si(s)) if(s[i] == '1') one.pb(i);
		one.pb(si(s));
		rep(i,si(one)-1) a.pb(one[i+1]-one[i]-1);
	}
	show(a);
	int N = si(a);
	if(N == 1){
		cout << a[0] << endl;
		return 0;
	}
	auto ch = [&](int i,mint v){
		sm += v-dp[i];
		dp[i] = v;
	};
	rep1(i,N-2){
		int x = a[i];
		mint oldsm = sm;
		rep(y,x+1)  ch(y,oldsm+1);
	}
	cout << (sm+1) * (a[0]+1) * (a[N-1]+1) << endl;
}
0