Submission #1092490
Source Code Expand
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <unordered_map>
#include <cmath>
#include <cstdlib>
#include <memory.h>
#include <ctime>
#include <bitset>
using namespace std;
#define ABS(a) ((a>0)?a:-(a))
#define MIN(a,b) ((a<b)?(a):(b))
#define MAX(a,b) ((a<b)?(b):(a))
#define FOR(i,a,n) for (int i=(a);i<(n);++i)
#define FI(i,n) for (int i=0; i<(n); ++i)
#define pnt pair <int, int>
#define mp make_pair
#define PI 3.1415926535897
#define MEMS(a,b) memset(a,b,sizeof(a))
#define LL long long
#define U unsigned
int a[100100];
int main()
{
#ifdef Fcdkbear
freopen("in.txt", "r", stdin);
double beg = clock();
//freopen("out.txt", "w", stdout);
#endif
int n;
scanf("%d",&n);
LL sum = 0;
FOR(i,0,n) {
scanf("%d",&a[i]);
sum += a[i];
}
if ((sum + sum) % (n * 1ll * (n + 1)) > 0) {
printf("NO\n");
return 0;
}
LL k = (sum + sum) / (n * 1ll * (n + 1));
k %= n;
FOR(i,0,n-1) {
int dif = a[i + 1] - a[i];
if (dif < 0) {
dif += n;
}
if (dif >= n) {
dif -= n;
}
if (dif != k) {
printf("NO\n");
return 0;
}
}
printf("YES\n");
#ifdef Fcdkbear
double end = clock();
fprintf(stderr, "*** Total time = %.3lf ***\n", (end - beg) / CLOCKS_PER_SEC);
#endif
return 0;
}
Submission Info
Submission Time
2017-02-04 21:21:41+0900
Task
B - Boxes
User
Fcdkbear
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
1445 Byte
Status
WA
Exec Time
15 ms
Memory
768 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:44:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:47:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&a[i]);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 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
Case Name
Status
Exec Time
Memory
in1.txt
AC
13 ms
640 KB
in10.txt
AC
4 ms
256 KB
in11.txt
AC
14 ms
640 KB
in12.txt
AC
14 ms
640 KB
in13.txt
AC
13 ms
512 KB
in14.txt
AC
3 ms
256 KB
in15.txt
AC
3 ms
256 KB
in16.txt
AC
3 ms
256 KB
in17.txt
WA
3 ms
256 KB
in18.txt
WA
3 ms
256 KB
in19.txt
AC
3 ms
256 KB
in2.txt
WA
15 ms
640 KB
in20.txt
AC
3 ms
256 KB
in21.txt
AC
15 ms
640 KB
in22.txt
AC
15 ms
640 KB
in23.txt
AC
15 ms
640 KB
in24.txt
AC
3 ms
256 KB
in25.txt
AC
4 ms
256 KB
in26.txt
AC
15 ms
640 KB
in27.txt
AC
15 ms
640 KB
in3.txt
WA
15 ms
640 KB
in4.txt
WA
15 ms
768 KB
in5.txt
WA
15 ms
640 KB
in6.txt
AC
15 ms
640 KB
in7.txt
AC
15 ms
640 KB
in8.txt
AC
4 ms
256 KB
in9.txt
AC
4 ms
256 KB
sample1.txt
AC
3 ms
256 KB
sample2.txt
AC
3 ms
256 KB
sample3.txt
AC
3 ms
256 KB