Submission #7873285


Source Code Expand

Copy
#include <bits/stdc++.h>

#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif

using namespace std;

const int MOD=998244353;
int N, D[200000], PS[200001], P2[200001], V[200001];
bool chk[200001];
string X;

bool check(int c, int SZ)
{
	for(int p=0;p*SZ<N;p++) {
		for(int i=0;i<c;i++) {
			if(X[p*SZ+i]<(D[i]^(p&1))+'0') return false;
			if(X[p*SZ+i]>(D[i]^(p&1))+'0') return true;
		}
		if(PS[(p+1)*SZ]-PS[p*SZ+c]<(SZ-c)*(p&1)) return false;
		if(PS[(p+1)*SZ]-PS[p*SZ+c]>(SZ-c)*(p&1)) return true;
	}
	return true;
}

int solve(int SZ)
{
	int ret=0;
	bool L=false;
	for(int i=0;i<SZ;i++) {
		D[i]=1;
		if(L || X[i]=='1' && check(i+1,SZ)) ret=(ret+P2[SZ-1-i])%MOD;
		else {
			if(X[i]=='1') L=true;
			D[i]=0;
		}
	}
	if(check(SZ,SZ)) ret=(ret+1)%MOD;
	return ret;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(NULL); cout.tie(NULL);
	TEST(freopen("input.txt","r",stdin));
	TEST(freopen("output.txt","w",stdout));
	TEST(freopen("debug.txt","w",stderr));
	int ans;
	cin>>N>>X;
	P2[0]=1; ans=2*N;
	for(int i=N-1;i>=0;i--) {
		if(X[i]=='1') ans=(ans+2LL*N*P2[N-1-i])%MOD;
		P2[N-i]=(2*P2[N-1-i])%MOD;
	}
	for(int i=0;i<N;i++) PS[i+1]=PS[i]+X[i]-'0';
	if(N&1) {
		chk[1]=true;
		V[1]=solve(1);
	}
	for(int i=2;i*i<=N;i++) if(N%i==0) {
		if(N/i&1) {
			chk[i]=true;
			V[i]=solve(i);
		}
		if(i*i!=N && (i&1)) {
			chk[N/i]=true;
			V[N/i]=solve(N/i);
		}
	}
	for(int i=1;i<=N;i++) if(chk[i]) {
		ans=(ans+2LL*(N-i)*(MOD-V[i]))%MOD;
		for(int j=3*i;j<=N;j+=2*i) V[j]=(V[j]+MOD-V[i])%MOD;
	}
	cout<<ans<<'\n';
	return 0;
}

Submission Info

Submission Time
Task C - Division by Two with Something
User Lawali
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1667 Byte
Status TLE
Exec Time 2103 ms
Memory 3092 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 800
Status
AC × 3
AC × 38
TLE × 11
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt TLE 2103 ms 2256 KB
02.txt AC 1087 ms 3092 KB
03.txt AC 4 ms 2512 KB
04.txt TLE 2103 ms 2324 KB
05.txt TLE 2103 ms 2128 KB
06.txt TLE 2103 ms 2000 KB
07.txt AC 132 ms 2512 KB
08.txt AC 1290 ms 1872 KB
09.txt AC 4 ms 2964 KB
10.txt TLE 2103 ms 1744 KB
11.txt TLE 2103 ms 2256 KB
12.txt AC 548 ms 3092 KB
13.txt AC 4 ms 2512 KB
14.txt TLE 2103 ms 2452 KB
15.txt AC 1281 ms 2896 KB
16.txt AC 1290 ms 2512 KB
17.txt AC 68 ms 2512 KB
18.txt AC 649 ms 1872 KB
19.txt AC 5 ms 2964 KB
20.txt AC 1247 ms 2256 KB
21.txt TLE 2103 ms 2256 KB
22.txt AC 546 ms 3092 KB
23.txt AC 4 ms 2512 KB
24.txt TLE 2103 ms 2452 KB
25.txt AC 1278 ms 2896 KB
26.txt AC 1293 ms 2512 KB
27.txt AC 68 ms 2512 KB
28.txt AC 647 ms 1872 KB
29.txt AC 4 ms 2964 KB
30.txt AC 1279 ms 2256 KB
31.txt TLE 2103 ms 2256 KB
32.txt AC 546 ms 3092 KB
33.txt AC 4 ms 2512 KB
34.txt TLE 2103 ms 2452 KB
35.txt AC 1284 ms 2896 KB
36.txt AC 1292 ms 2512 KB
37.txt AC 68 ms 2512 KB
38.txt AC 649 ms 1872 KB
39.txt AC 4 ms 2964 KB
40.txt AC 1280 ms 2256 KB
41.txt AC 5 ms 2896 KB
42.txt AC 4 ms 3092 KB
43.txt AC 1 ms 256 KB
44.txt AC 1 ms 256 KB
45.txt AC 1 ms 256 KB
46.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB
s3.txt AC 1 ms 256 KB