Submission #1239907
Source Code Expand
#include<cstdio> #include<cstring> #include<vector> #include<queue> #include<algorithm> #include<cmath> #include<climits> #include<string> #include<numeric> #include<set> #include<map> #include<iostream> using namespace std; #define rep(i,n) for(int i = 0;i<((int)(n));i++) #define reg(i,a,b) for(lli i = ((int)(a));i<=((int)(b));i++) #define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--) #define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--) typedef long long int lli; typedef pair<int, int> mp; #define fir first #define sec second #define IINF INT_MAX #define LINF LLONG_MAX #define eprintf(...) fprintf(stderr,__VA_ARGS__) #define pque(type) priority_queue<type,vector<type>,greater<type> > #define memst(a,b) memset(a,b,sizeof(a)) int main(void){ lli n; cin >> n; vector<lli> a(n); rep(i, n) cin >> a[i]; lli sum = accumulate(a.begin(), a.end(), 0LL); if(sum%(n*(n+1)/2) != 0){ cout << "NO" << endl; return 0; } lli m = sum/(n*(n+1)/2); rep(i, n){ lli k = m+a[i]-a[(i+1)%n]; if(k < 0 || k%n != 0){ cout << "NO" << endl; return 0; } } cout << "YES" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Boxes |
User | ktyshmt |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1164 Byte |
Status | AC |
Exec Time | 43 ms |
Memory | 1024 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
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 | AC | 34 ms | 1024 KB |
in10.txt | AC | 5 ms | 384 KB |
in11.txt | AC | 40 ms | 1024 KB |
in12.txt | AC | 41 ms | 1024 KB |
in13.txt | AC | 34 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 | AC | 1 ms | 256 KB |
in19.txt | AC | 1 ms | 256 KB |
in2.txt | AC | 43 ms | 1024 KB |
in20.txt | AC | 1 ms | 256 KB |
in21.txt | AC | 40 ms | 1024 KB |
in22.txt | AC | 40 ms | 1024 KB |
in23.txt | AC | 41 ms | 1024 KB |
in24.txt | AC | 3 ms | 256 KB |
in25.txt | AC | 5 ms | 384 KB |
in26.txt | AC | 40 ms | 1024 KB |
in27.txt | AC | 40 ms | 1024 KB |
in3.txt | AC | 43 ms | 1024 KB |
in4.txt | AC | 43 ms | 1024 KB |
in5.txt | AC | 43 ms | 1024 KB |
in6.txt | AC | 41 ms | 1024 KB |
in7.txt | AC | 41 ms | 1024 KB |
in8.txt | AC | 5 ms | 384 KB |
in9.txt | AC | 5 ms | 384 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |