Submission #2213309
Source Code Expand
#include<bits/stdc++.h> using namespace std; int N, a[100009]; long long s; int main () { //freopen ("input", "r", stdin); //freopen ("output", "w", stdout); scanf ("%d", &N); for (int i=0; i<N; i++) scanf ("%d", &a[i]), s += a[i]; long long u = 1LL * N * (N + 1) / 2; if (s % u != 0 || s / u > 1e9) { printf ("NO\n"); return 0; } int steps = s / u; for (int i=0; i<N; i++) { int curr = a[(i + 1) % N] - a[i] - steps; if (curr % N != 0 || curr > 0) { printf ("NO\n"); return 0; } } printf ("YES\n"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Boxes |
User | geniucos |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 594 Byte |
Status | AC |
Exec Time | 13 ms |
Memory | 640 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:13:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf ("%d", &N); ^ ./Main.cpp:15:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf ("%d", &a[i]), s += a[i]; ^
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 | 11 ms | 640 KB |
in10.txt | AC | 2 ms | 256 KB |
in11.txt | AC | 12 ms | 640 KB |
in12.txt | AC | 12 ms | 640 KB |
in13.txt | AC | 11 ms | 512 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 | 13 ms | 640 KB |
in20.txt | AC | 1 ms | 256 KB |
in21.txt | AC | 12 ms | 640 KB |
in22.txt | AC | 12 ms | 640 KB |
in23.txt | AC | 12 ms | 640 KB |
in24.txt | AC | 2 ms | 256 KB |
in25.txt | AC | 2 ms | 256 KB |
in26.txt | AC | 12 ms | 640 KB |
in27.txt | AC | 12 ms | 640 KB |
in3.txt | AC | 13 ms | 640 KB |
in4.txt | AC | 13 ms | 640 KB |
in5.txt | AC | 13 ms | 640 KB |
in6.txt | AC | 12 ms | 640 KB |
in7.txt | AC | 12 ms | 640 KB |
in8.txt | AC | 2 ms | 256 KB |
in9.txt | AC | 2 ms | 256 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |