Submission #1707768


Source Code Expand

#include <cstdio>
typedef long long lint;
int const N=1e5+10;
int n,a[N];
int dif[N];
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	lint s=n*(n+1)>>1,sum=0;
	for(int i=1;i<=n;i++) sum+=a[i],dif[i]=a[i+1]-a[i];
	if(sum%s!=0) {printf("NO"); return 0;}
	int k=sum/s,a1=0,sumX=0;
	for(int i=1;i<=n-1;i++)
	{
		int x=(k-dif[i])/5;
		if(x*5!=k-dif[i]) {printf("NO"); return 0;}
		a1+=(n+1-i)*x; sumX+=x;
	}
	if(a1+(k-sumX)!=a[1]) {printf("NO"); return 0;}
	printf("YES");
	return 0;
}

Submission Info

Submission Time
Task B - Boxes
User vjudge3
Language C++14 (Clang 3.8.0)
Score 0
Code Size 505 Byte
Status WA
Exec Time 14 ms
Memory 1268 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 3
AC × 27
WA × 6
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
in1.txt WA 14 ms 1268 KB
in10.txt AC 2 ms 384 KB
in11.txt AC 13 ms 1024 KB
in12.txt AC 13 ms 1024 KB
in13.txt AC 11 ms 896 KB
in14.txt AC 1 ms 256 KB
in15.txt AC 1 ms 256 KB
in16.txt AC 1 ms 256 KB
in17.txt AC 1 ms 256 KB
in18.txt WA 1 ms 256 KB
in19.txt AC 1 ms 256 KB
in2.txt WA 13 ms 1024 KB
in20.txt AC 1 ms 256 KB
in21.txt AC 13 ms 1024 KB
in22.txt AC 13 ms 1024 KB
in23.txt AC 13 ms 1024 KB
in24.txt AC 2 ms 256 KB
in25.txt AC 2 ms 384 KB
in26.txt AC 13 ms 1024 KB
in27.txt AC 13 ms 1024 KB
in3.txt WA 13 ms 1024 KB
in4.txt WA 13 ms 1024 KB
in5.txt WA 13 ms 1024 KB
in6.txt AC 13 ms 1024 KB
in7.txt AC 13 ms 1024 KB
in8.txt AC 2 ms 384 KB
in9.txt AC 2 ms 384 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB
sample3.txt AC 1 ms 256 KB