結果

問題 No.1654 Binary Compression
ユーザー satashunsatashun
提出日時 2021-08-27 14:31:44
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 5,526 bytes
コンパイル時間 2,335 ms
コンパイル使用メモリ 202,316 KB
最終ジャッジ日時 2025-01-24 02:14:26
ジャッジサーバーID
(参考情報)
judge3 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 12 WA * 38
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
template <class T>
V<T> make_vec(size_t a) {
return V<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return V<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T, class U>
void chmin(T& t, const U& u) {
if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
if (t < u) t = u;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
rep(i, v.size()) {
if (i) os << ",";
os << v[i];
}
os << "}";
return os;
}
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define debug(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
template <unsigned int MOD>
struct ModInt {
using uint = unsigned int;
using ull = unsigned long long;
using M = ModInt;
uint v;
ModInt(ll _v = 0) { set_norm(_v % MOD + MOD); }
M& set_norm(uint _v) { //[0, MOD * 2)->[0, MOD)
v = (_v < MOD) ? _v : _v - MOD;
return *this;
}
explicit operator bool() const { return v != 0; }
explicit operator int() const { return v; }
M operator+(const M& a) const { return M().set_norm(v + a.v); }
M operator-(const M& a) const { return M().set_norm(v + MOD - a.v); }
M operator*(const M& a) const { return M().set_norm(ull(v) * a.v % MOD); }
M operator/(const M& a) const { return *this * a.inv(); }
M& operator+=(const M& a) { return *this = *this + a; }
M& operator-=(const M& a) { return *this = *this - a; }
M& operator*=(const M& a) { return *this = *this * a; }
M& operator/=(const M& a) { return *this = *this / a; }
M operator-() const { return M() - *this; }
M& operator++(int) { return *this = *this + 1; }
M& operator--(int) { return *this = *this - 1; }
M pow(ll n) const {
if (n < 0) return inv().pow(-n);
M x = *this, res = 1;
while (n) {
if (n & 1) res *= x;
x *= x;
n >>= 1;
}
return res;
}
M inv() const {
ll a = v, b = MOD, p = 1, q = 0, t;
while (b != 0) {
t = a / b;
swap(a -= t * b, b);
swap(p -= t * q, q);
}
return M(p);
}
friend ostream& operator<<(ostream& os, const M& a) { return os << a.v; }
friend istream& operator>>(istream& in, M& x) {
ll v_;
in >> v_;
x = M(v_);
return in;
}
bool operator<(const M& r) const { return v < r.v; }
bool operator>(const M& r) const { return v < *this; }
bool operator<=(const M& r) const { return !(r < *this); }
bool operator>=(const M& r) const { return !(*this < r); }
bool operator==(const M& a) const { return v == a.v; }
bool operator!=(const M& a) const { return v != a.v; }
static uint get_mod() { return MOD; }
};
// using Mint = ModInt<1000000007>;
using Mint = ModInt<924844033>;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = SZ(s);
Mint bb = 1;
{
int l = 0;
while (l < n && s[l] == '0') {
l++;
}
int r = n - 1;
while (r >= l && s[r] == '0') {
r--;
}
if (r < l) {
cout << n + 1 << endl;
return 0;
}
bb *= (l + 1) * (n - r);
s = s.substr(l, r - l + 1);
n = SZ(s);
}
debug(bb, s);
V<int> v1, c0;
rep(i, n) {
if (s[i] == '1') v1.pb(i);
}
rep(i, SZ(v1) - 1) { c0.pb(v1[i + 1] - v1[i] - 1); }
debug(c0);
V<Mint> dp(SZ(v1));
dp.back() = 1;
V<pii> vec;
Mint sum;
// 10..010..010..01
per(i, SZ(c0)) {
{
int la = -1;
while (SZ(vec) && vec.back().fi <= c0[i]) {
sum -= dp[vec.back().se] * (vec.back().fi - la);
la = vec.back().fi;
vec.pop_back();
}
if (SZ(vec)) {
sum += dp[vec.back().se] * (vec.back().fi - c0[i]);
}
}
vec.eb(c0[i], i + 1);
sum += dp[i + 1] * (c0[i] + 1);
dp[i] = sum + 1;
/*
int la = -1;
dp[i] = 1;
per(j, SZ(vec)) {
dp[i] += dp[vec[j].se] * (vec[j].fi - la);
la = vec[j].fi;
}*/
}
cout << dp[0] * bb << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0