Submission #1092465

---

Source Code Expand

#include<vector>
#include<cmath>
#include<map>
#include<cstdlib>
#include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<set>
#include<stack>
#include<bitset>
#include<functional>
#include<ctime>
#include<queue>
#include<deque>
#include<complex>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long lint;
typedef complex<double> P;
#define mp make_pair
#define fi first
#define se second
typedef pair<int,int> pint;
#define All(s) s.begin(),s.end()
#define rAll(s) s.rbegin(),s.rend()
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
lint a[114514],b[114514];
int main()
{
	int N;lint n,sum=0,num;
	cin>>N;n=N;
	rep(i,N){
		cin>>a[i];
		sum+=a[i];
	}
	a[N]=a[0];
	if(sum%(n*(n+1)/2)>0){
		cout<<"NO"<<endl;return 0;
	}
	num=sum/(n*(n+1)/2);
	rep(i,N){
		lint di=a[i+1]-a[i],d2=num-di;
		if(d2%n>0){
			cout<<"NO"<<endl;return 0;
		}
		b[(i+1)%n]=d2/n;
	}
	//rep(i,N) cout<<b[i]<<endl;
	lint s=0;rep(i,N) s+=(n-i)*b[i];
	for(int i=N-1;i>=0;i--){
		//cout<<i<<' '<<s<<endl;
		if(a[i]!=s){
			cout<<"NO"<<endl;return 0;
		}
		s-=num;s+=n*b[i];
	}
	cout<<"YES"<<endl;
}

Submission Info

Judge Result