Submission #1092483


Source Code Expand

#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <map>
#include <set>
#include <deque>
#include <cstring>
#include <functional>
#include <climits>
#include <list>
#include <ctime>
#include <complex>
 
#define F1(x,y,z) for(int x=(y);x<(z);x++)
#define F2(x,y,z) for(int x=(y);x<=(z);x++)
#define F3(x,y,z) for(int x=(y);x>(z);x--)
#define F4(x,y,z) for(int x=(y);x>=(z);x--)
#define mp make_pair
#define pb push_back
#define LL long long
#define co complex<double>
#define fi first
#define se second
 
#define MAX 100005
#define AMAX 1025*1005
#define MOD 1000000007
 
#define f(c,d) ((1<<(c))*(d))
 
using namespace std;
 
LL n,x[MAX],s,ta,tb,tc;
 
int main(){
	scanf("%lld",&n);
	F1(a,0,n){
		scanf("%lld",x+a);
		s+=x[a];
	}
	ta=n*(n+1)/2;
	if(n==1)printf("YES\n");
	else if(s%ta)printf("NO\n");
	else{
		ta=s/ta;
		F1(a,0,n){
			tb=ta-(x[(a+1)%n]-x[a]);
			if(tb%n||tb<0)tc=LLONG_MIN;
			else tc+=tb/n;			
		}
		if(tc==ta)printf("YES\n");
		else printf("NO\n");
	}
	#ifdef LOCAL_PROJECT
	system("pause");
	#endif
	return 0;
}

Submission Info

Submission Time
Task B - Boxes
User nhho
Language C++14 (GCC 5.4.1)
Score 500
Code Size 1177 Byte
Status AC
Exec Time 16 ms
Memory 896 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:40:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld",&n);
                  ^
./Main.cpp:42:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",x+a);
                    ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 30
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
Case Name Status Exec Time Memory
in1.txt AC 14 ms 896 KB
in10.txt AC 3 ms 256 KB
in11.txt AC 16 ms 896 KB
in12.txt AC 16 ms 896 KB
in13.txt AC 13 ms 768 KB
in14.txt AC 1 ms 128 KB
in15.txt AC 1 ms 128 KB
in16.txt AC 1 ms 128 KB
in17.txt AC 1 ms 128 KB
in18.txt AC 1 ms 128 KB
in19.txt AC 1 ms 128 KB
in2.txt AC 16 ms 896 KB
in20.txt AC 1 ms 128 KB
in21.txt AC 13 ms 896 KB
in22.txt AC 13 ms 896 KB
in23.txt AC 13 ms 896 KB
in24.txt AC 2 ms 256 KB
in25.txt AC 3 ms 256 KB
in26.txt AC 15 ms 896 KB
in27.txt AC 16 ms 896 KB
in3.txt AC 16 ms 896 KB
in4.txt AC 16 ms 896 KB
in5.txt AC 16 ms 896 KB
in6.txt AC 14 ms 896 KB
in7.txt AC 14 ms 896 KB
in8.txt AC 3 ms 256 KB
in9.txt AC 3 ms 256 KB
sample1.txt AC 1 ms 128 KB
sample2.txt AC 1 ms 128 KB
sample3.txt AC 1 ms 128 KB