Submission #1836594
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define RFOR(i,b,a) for(int i = (b) - 1; i >= (a); i--)
#define ITER(it, a) for(typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(a, value) memset(a, value, sizeof(a))
#define SZ(a) (int) a.size()
#define ALL(a) a.begin(),a.end()
#define PB push_back
#define MP make_pair
typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
const double PI = acos(-1.0);
const LL INF = 1000 * 1000 * 1000 + 7;
const LL LINF = INF * (LL)INF;
const int MAX = 100100;
LL A[MAX];
LL B[MAX];
int main()
{
//freopen("in.txt", "r", stdin);
//ios::sync_with_stdio(false); cin.tie(0);
int n;
scanf("%d", &n);
LL sum = 0;
FOR (i, 0, n)
{
int x;
scanf("%d", &x);
A[i] = x;
sum += A[i];
}
LL b = n * (LL)(n+1) / 2;
if (sum % b != 0)
{
cout<<"NO"<<endl;
return 0;
}
LL cnt = sum / b;
FOR (i, 0, n)
{
B[i] = A[(i + 1) % n] - A[i];
}
FOR (i, 0, n)
{
B[i] -= cnt;
}
LL x = 0;
FOR (i, 0, n)
{
if (B[i] > 0 || B[i] % n != 0)
{
cout<<"NO"<<endl;
return 0;
}
x += abs(B[i] / n);
}
if (x == cnt) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
Submission Info
Submission Time |
|
Task |
B - Boxes |
User |
vjudge1 |
Language |
C++14 (GCC 5.4.1) |
Score |
500 |
Code Size |
1214 Byte |
Status |
AC |
Exec Time |
15 ms |
Memory |
1792 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:33:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
./Main.cpp:40:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &x);
^
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 |
14 ms |
1792 KB |
in10.txt |
AC |
2 ms |
384 KB |
in11.txt |
AC |
13 ms |
1792 KB |
in12.txt |
AC |
13 ms |
1792 KB |
in13.txt |
AC |
11 ms |
1536 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 |
15 ms |
1792 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 |
384 KB |
in25.txt |
AC |
2 ms |
384 KB |
in26.txt |
AC |
13 ms |
1792 KB |
in27.txt |
AC |
13 ms |
1792 KB |
in3.txt |
AC |
15 ms |
1792 KB |
in4.txt |
AC |
15 ms |
1792 KB |
in5.txt |
AC |
15 ms |
1792 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 |