Submission #7872847


Source Code Expand

Copy
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cmath>
#define fo(a,b,c) for (a=b; a<=c; a++)
#define fd(a,b,c) for (a=b; a>=c; a--)
#define mod 998244353
using namespace std;

struct type{
	int len;
	long long s;
} b[200001];
bool a[200001];
int n,i,j,k,l,S,tot;
long long ans,s;
char ch;

bool cmp(type a,type b)
{
	return a.len<b.len;
}

int main()
{
//	freopen("c.in","r",stdin);
	
	scanf("%d",&n);
	
	s=0;
	fo(i,1,n)
	{
		ch=getchar();
		while (ch!='0' && ch!='1')
		ch=getchar();
		
		if (ch=='1')
		a[i]=1;
		
		s=(s*2+a[i])%mod;
	}
	
	ans=(s+1)*(n+n)%mod;
	S=floor(sqrt(n));
	
	fo(i,1,S)
	if (!(n%i))
	{
		l=n/i;
		if (l>1 && (l&1))
		{
			s=0;
			fo(j,1,i)
			s=(s*2+a[j])%mod;
			++s;
			
			fo(j,1,n)
			if (((j-1)/i)&1)
			{
				if (a[j]<(a[(j-1)%i+1]^1))
				{
					--s;
					break;
				}
				else
				if (a[j]>(a[(j-1)%i+1]^1))
				break;
			}
			else
			{
				if (a[j]<a[(j-1)%i+1])
				{
					--s;
					break;
				}
				else
				if (a[j]>a[(j-1)%i+1])
				break;
			}
			
			++tot;
			b[tot].len=i;
			b[tot].s=s;
		}
		
		if (i>1 && (i&1) && i!=l)
		{
			s=0;
			fo(j,1,l)
			s=(s*2+a[j])%mod;
			++s;
			
			fo(j,1,n)
			if (((j-1)/l)&1)
			{
				if (a[j]<(a[(j-1)%l+1]^1))
				{
					--s;
					break;
				}
				else
				if (a[j]>(a[(j-1)%l+1]^1))
				break;
			}
			else
			{
				if (a[j]<a[(j-1)%l+1])
				{
					--s;
					break;
				}
				else
				if (a[j]>a[(j-1)%l+1])
				break;
			}
			
			++tot;
			b[tot].len=l;
			b[tot].s=s;
		}
	}
	
	sort(b+1,b+tot+1,cmp);
	
	fo(i,1,tot)
	{
		fo(j,1,i-1)
		if (!(b[i].len%b[j].len))
		b[i].s=(b[i].s-b[j].s)%mod;
		
		ans=(ans-b[i].s*(n+n-b[i].len-b[i].len)%mod)%mod;
	}
	
	printf("%lld\n",(ans+mod)%mod);
}

Submission Info

Submission Time
Task C - Division by Two with Something
User gmh77
Language C++ (GCC 5.4.1)
Score 800
Code Size 1866 Byte
Status AC
Exec Time 37 ms
Memory 384 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:30:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 800 / 800
Status
AC × 3
AC × 49
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 AC 5 ms 384 KB
02.txt AC 4 ms 384 KB
03.txt AC 3 ms 384 KB
04.txt AC 5 ms 384 KB
05.txt AC 4 ms 384 KB
06.txt AC 4 ms 384 KB
07.txt AC 3 ms 384 KB
08.txt AC 3 ms 384 KB
09.txt AC 3 ms 384 KB
10.txt AC 4 ms 384 KB
11.txt AC 5 ms 384 KB
12.txt AC 4 ms 384 KB
13.txt AC 3 ms 384 KB
14.txt AC 6 ms 384 KB
15.txt AC 4 ms 384 KB
16.txt AC 4 ms 384 KB
17.txt AC 3 ms 384 KB
18.txt AC 3 ms 384 KB
19.txt AC 4 ms 384 KB
20.txt AC 4 ms 384 KB
21.txt AC 5 ms 384 KB
22.txt AC 4 ms 384 KB
23.txt AC 3 ms 384 KB
24.txt AC 6 ms 384 KB
25.txt AC 4 ms 384 KB
26.txt AC 6 ms 384 KB
27.txt AC 3 ms 384 KB
28.txt AC 3 ms 384 KB
29.txt AC 3 ms 384 KB
30.txt AC 37 ms 384 KB
31.txt AC 5 ms 384 KB
32.txt AC 3 ms 384 KB
33.txt AC 3 ms 384 KB
34.txt AC 8 ms 384 KB
35.txt AC 11 ms 384 KB
36.txt AC 4 ms 384 KB
37.txt AC 3 ms 384 KB
38.txt AC 3 ms 384 KB
39.txt AC 3 ms 384 KB
40.txt AC 37 ms 384 KB
41.txt AC 5 ms 256 KB
42.txt AC 3 ms 256 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