QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#765044#8834. Formal Fringmhb2010AC ✓39ms22996kbC++14681b2024-11-20 11:45:242024-11-20 11:45:24

Judging History

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

  • [2024-11-20 11:45:24]
  • 评测
  • 测评结果:AC
  • 用时:39ms
  • 内存:22996kb
  • [2024-11-20 11:45:24]
  • 提交

answer

#include<bits/stdc++.h>
#define int long long
using namespace std;
void ts(){cout<<"IAKIOI"<<endl;}
const int N=1.1e6, mod=998244353;
int n, dp[N], g[N], h[N];
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	dp[0]=1;
	for(int i=1; i<=n; i++){
		dp[i]=(dp[i-1]+(i&1?0:dp[i/2]))%mod;
		h[i] =(__lg(i)!=__lg(i+1))?__lg(i+1):h[i>>1];
	}
	for(int i=1; i<=20; i++){
		g[i]=dp[(1<<i)-1];
		for(int j=1; j<i; j++){
			g[i]=(g[i]+(mod-g[j])*dp[(1<<(i-j))-1])%mod;
		}
	}
	for(int i=1; i<=n; i++){
		int ans=0;
		for(int j=1; j<=h[i]; j++){
			ans=(ans+g[j]*dp[i^(1<<j)-1<<__lg(i)-j+1])%mod;
		}
		cout<<ans<<' ';
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 7812kb

input:

10

output:

1 1 2 1 1 3 6 1 1 2 

result:

ok 10 numbers

Test #2:

score: 0
Accepted
time: 1ms
memory: 7740kb

input:

70

output:

1 1 2 1 1 3 6 1 1 2 2 5 5 11 26 1 1 2 2 4 4 6 6 11 11 16 16 27 27 53 166 1 1 2 2 4 4 6 6 10 10 14 14 20 20 26 26 37 37 48 48 64 64 80 80 107 107 134 134 187 187 353 1626 1 1 2 2 4 4 6 

result:

ok 70 numbers

Test #3:

score: 0
Accepted
time: 39ms
memory: 22996kb

input:

1000000

output:

1 1 2 1 1 3 6 1 1 2 2 5 5 11 26 1 1 2 2 4 4 6 6 11 11 16 16 27 27 53 166 1 1 2 2 4 4 6 6 10 10 14 14 20 20 26 26 37 37 48 48 64 64 80 80 107 107 134 134 187 187 353 1626 1 1 2 2 4 4 6 6 10 10 14 14 20 20 26 26 36 36 46 46 60 60 74 74 94 94 114 114 140 140 166 166 203 203 240 240 288 288 336 336 400 ...

result:

ok 1000000 numbers

Extra Test:

score: 0
Extra Test Passed