QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#784767#9614. 分治zjy0001100 ✓581ms10732kbC++172.1kb2024-11-26 15:54:362024-11-26 15:54:56

Judging History

你现在查看的是最新测评结果

  • [2024-11-26 15:54:56]
  • 评测
  • 测评结果:100
  • 用时:581ms
  • 内存:10732kb
  • [2024-11-26 15:54:36]
  • 提交

answer

#include<bits/stdc++.h>
#define LL long long
#define LLL __int128
#define uint unsigned
#define ldb long double
#define uLL unsigned long long
using namespace std;
const int N=2e5+5,Mod=998244353;
int n,q,ans,BL;
string s;
int F[N],f[N],g[N];
tuple<int,int,int>Q[N];
int frc[N],ivf[N],pw2[N];
inline int qpow(int x,int y,int z=1){
	for(;y;(y>>=1)&&(x=(LL)x*x%Mod))if(y&1)z=(LL)z*x%Mod;return z;
}
inline int add(int x,const int&y){
    return ((x+=y)-Mod)>=0?x-Mod:x;
}
inline int sub(int x,const int&y){
    return (x-=y)<0?x+Mod:x;
}
inline int neg(const int&x){
	return x?Mod-x:0;
}
inline int div2(const int&x){
    return x&1?(x+Mod)>>1:x>>1;
}
inline void Init(const int&n){
    frc[0]=1;
    for(int i=1;i<=n;++i)frc[i]=1ll*frc[i-1]*i%Mod;
    ivf[n]=qpow(frc[n],Mod-2);
    for(int i=n;i>=1;--i)ivf[i-1]=1ll*ivf[i]*i%Mod;
    pw2[0]=1;
    for(int i=1;i<=n;++i)pw2[i]=add(pw2[i-1],pw2[i-1]);
}
signed main(){
    cin.tie(0)->sync_with_stdio(0);
	cin>>s,n=s.length()-1,Init(n),BL=sqrtl(n)+1;
    for(int i=0;i<=n;++i)
        F[i]=1ll*pw2[i]*ivf[i]%Mod;
    for(int i=0;i<=n;++i)if(s[i]=='1')ans=add(ans,pw2[n-i]);
    Q[0]=make_tuple(n,0,0);
    for(int i=1,cur=1,mx=0;i<=n;++i)
        if(s[i]=='1')Q[++q]=make_tuple(n-i,cur+1,max(mx,cur+1)),mx=max(mx,cur),cur=0;
        else ++cur;
    for(int i=1;i<=q;++i){
        const auto [qx,qy,qz]=Q[i];
        ans=(ans+1ll*qz*pw2[qx])%Mod;
    }
    for(int x=1;x<BL;++x){
        for(int i=0;i<=n;++i){
            f[i]=0,g[i]=0;
            if(i-x>0)f[i]=sub(add(add(f[i-1],f[i-1]),pw2[i-x-1]),f[i-x-1]);
            if(i-x-x>=0)g[i]=(g[i-x]+1ll*frc[i-x]*F[i-x-x]%Mod*(x&1?ivf[x]:Mod-ivf[x]))%Mod;
        }
        for(int i=0;i<=q;++i){
            const auto [qx,qy,qz]=Q[i];
            int len=max(qz,BL-1),p=qx-len*x;
            if(p>=x+x)ans=add(ans,g[p]);
            if((p+=qy)>=x+x-1)ans=add(ans,sub(g[p+1],add(g[p],g[p])));
            if(x>qz){
                ans=add(ans,f[qx]);
                if(qx+qy-x>=0)ans=add(ans,sub(pw2[qx+qy-x],f[qx+qy-x]));
            }
        }
    }
    cout<<ans;
    return 0;
}
/*

*/

详细

Subtask #1:

score: 10
Accepted

Test #1:

score: 10
Accepted
time: 1ms
memory: 9912kb

input:

110

output:

15

result:

ok 1 number(s): "15"

Test #2:

score: 10
Accepted
time: 1ms
memory: 7680kb

input:

101

output:

12

result:

ok 1 number(s): "12"

Subtask #2:

score: 10
Accepted

Dependency #1:

100%
Accepted

Test #3:

score: 10
Accepted
time: 0ms
memory: 7864kb

input:

111110

output:

198

result:

ok 1 number(s): "198"

Test #4:

score: 10
Accepted
time: 0ms
memory: 7748kb

input:

1001001

output:

253

result:

ok 1 number(s): "253"

Subtask #3:

score: 20
Accepted

Dependency #2:

100%
Accepted

Test #5:

score: 20
Accepted
time: 0ms
memory: 7792kb

input:

10100011000100111

output:

386882

result:

ok 1 number(s): "386882"

Test #6:

score: 20
Accepted
time: 1ms
memory: 7748kb

input:

111010011111010110

output:

1107742

result:

ok 1 number(s): "1107742"

Subtask #4:

score: 5
Accepted

Test #7:

score: 5
Accepted
time: 1ms
memory: 7616kb

input:

100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

output:

412796008

result:

ok 1 number(s): "412796008"

Test #8:

score: 5
Accepted
time: 1ms
memory: 7744kb

input:

100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

output:

818656648

result:

ok 1 number(s): "818656648"

Subtask #5:

score: 5
Accepted

Dependency #3:

100%
Accepted

Dependency #4:

100%
Accepted

Test #9:

score: 5
Accepted
time: 1ms
memory: 7736kb

input:

10000000100000010010011110111101101110000000000001100000011000111111010011010101010000101001110110010001100110000110111101000101001111101111001010001001011101011111010000100010111100110000001101111

output:

703266161

result:

ok 1 number(s): "703266161"

Test #10:

score: 5
Accepted
time: 1ms
memory: 7696kb

input:

110100000100001000101000010010101000110111101010110000101001001100100111000011100101110110010000001111010011101001111110110010001110011101001111010101100100010011101010101111111111010110001100100110

output:

330527406

result:

ok 1 number(s): "330527406"

Subtask #6:

score: 5
Accepted

Dependency #4:

100%
Accepted

Test #11:

score: 5
Accepted
time: 1ms
memory: 7696kb

input:

100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

340672883

result:

ok 1 number(s): "340672883"

Test #12:

score: 5
Accepted
time: 1ms
memory: 7744kb

input:

100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

555946758

result:

ok 1 number(s): "555946758"

Subtask #7:

score: 10
Accepted

Dependency #5:

100%
Accepted

Dependency #6:

100%
Accepted

Test #13:

score: 10
Accepted
time: 1ms
memory: 7788kb

input:

110011100110101000000110101010111111001101101011010110100100110010111110110110000111011001110000101111110111011111000110001011011011101100001100100011010010111111010110010000101001001000100001100100000001000111110100000101001011100001100011011110110101101111110011100111001010001010001111001110111100...

output:

324123594

result:

ok 1 number(s): "324123594"

Test #14:

score: 10
Accepted
time: 0ms
memory: 7800kb

input:

110100110100110110001011100000011010000010000101100100001101100100110000101000111001111100001110001001101010110010111101000100111010001011001110101010001101111010000011000010110011000011100101110100000001011100111000101111010100001101011010100101110000010001101001000100111001101101110000101101011011...

output:

209285599

result:

ok 1 number(s): "209285599"

Subtask #8:

score: 10
Accepted

Dependency #6:

100%
Accepted

Test #15:

score: 10
Accepted
time: 181ms
memory: 10432kb

input:

100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

468567454

result:

ok 1 number(s): "468567454"

Test #16:

score: 10
Accepted
time: 388ms
memory: 10620kb

input:

100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

12752860

result:

ok 1 number(s): "12752860"

Subtask #9:

score: 25
Accepted

Dependency #1:

100%
Accepted

Dependency #2:

100%
Accepted

Dependency #3:

100%
Accepted

Dependency #4:

100%
Accepted

Dependency #5:

100%
Accepted

Dependency #6:

100%
Accepted

Dependency #7:

100%
Accepted

Dependency #8:

100%
Accepted

Test #17:

score: 25
Accepted
time: 581ms
memory: 10732kb

input:

101100010100101011010110001111101101001010000111001111000100110110010111101100011011011111010110000000011110000010100110111110110001101001101101001110101110011000010100100101000011000010000101011001011011000000100111011110100010000100001101011110100101110000100011000101100000111111100110000111010000...

output:

711712397

result:

ok 1 number(s): "711712397"

Test #18:

score: 25
Accepted
time: 579ms
memory: 10728kb

input:

110101110100100010101100000110000110101101111100110011100111111110000101111001101001111000110111100111110111010001000010111111110000001001011110101110001011010010010011101000110110000110110101000100111000100110101111011101111101000010000101001001000010011011000011001100111111011000111000010000100111...

output:

171668334

result:

ok 1 number(s): "171668334"

Test #19:

score: 25
Accepted
time: 416ms
memory: 8752kb

input:

100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

397846555

result:

ok 1 number(s): "397846555"

Test #20:

score: 25
Accepted
time: 474ms
memory: 10724kb

input:

100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

592103795

result:

ok 1 number(s): "592103795"

Extra Test:

score: 0
Extra Test Passed