Submission #1093046
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<" "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define F(n) FOR(i,0,n)
#define FF(n) FOR(j,0,n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (1<<17)
ll S,K,O,M,t,G[MX],W;
int N,A[MX],T[MX],I;
int go(int d){
if(d==K)return 0;
ll U=d-K,B=N;
if(U%B)puts("NO"),exit(0);
return abs(U/B);
}
int main(void){
scanf("%d",&N),ga(N,A),A[N]=*A,O=N*(N+1ll)/2;
if(N==1)return puts("YES"),0;
F(N)S+=A[i];
if(S%O)return puts("NO"),0;
K=S/O;
F(N)W+=T[(i+1)%N]=go(A[i+1]-A[i]);
F(N*2){
I=i%N;
if(T[I]>0)t+=T[I],T[I]=-T[I];
else t+=T[I],M-=abs(T[I])*N;
M+=t,G[I]+=M;
}
F(N)if(G[i]^A[i])return puts("NO"),0;
// if(W^K)return puts("NO"),0;
puts("YES");
return 0;
}
Submission Info
Submission Time
2017-02-04 21:39:04+0900
Task
B - Boxes
User
Morass
Language
C++14 (GCC 5.4.1)
Score
500
Code Size
1278 Byte
Status
AC
Exec Time
18 ms
Memory
1792 KB
Compile Error
./Main.cpp: In function ‘void ga(int, int*)’:
./Main.cpp:22:42: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
void ga(int N,int *A){F(N)scanf("%d",A+i);}
^
./Main.cpp: In function ‘int main()’:
./Main.cpp:33:49: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&N),ga(N,A),A[N]=*A,O=N*(N+1ll)/2;
^
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
Case Name
Status
Exec Time
Memory
in1.txt
AC
16 ms
1792 KB
in10.txt
AC
4 ms
256 KB
in11.txt
AC
17 ms
1792 KB
in12.txt
AC
17 ms
1792 KB
in13.txt
AC
15 ms
1536 KB
in14.txt
AC
3 ms
256 KB
in15.txt
AC
3 ms
256 KB
in16.txt
AC
3 ms
256 KB
in17.txt
AC
2 ms
256 KB
in18.txt
AC
3 ms
256 KB
in19.txt
AC
3 ms
256 KB
in2.txt
AC
18 ms
1792 KB
in20.txt
AC
2 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
17 ms
1792 KB
in27.txt
AC
17 ms
1792 KB
in3.txt
AC
18 ms
1792 KB
in4.txt
AC
18 ms
1792 KB
in5.txt
AC
17 ms
1792 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
2 ms
256 KB
sample3.txt
AC
3 ms
256 KB