Submission #1836784
Source Code Expand
#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <sstream> #include <iomanip> #include <cstdio> #include <cstdlib> #include <cmath> #include <cctype> #include <cstring> #include <vector> #include <list> #include <queue> #include <deque> #include <stack> #include <map> #include <set> #include <algorithm> #include <iterator> #include <bitset> #include <ctime> #include<complex> 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 int INF = 1000 * 1000 * 1000 + 7; const LL LINF = INF * (LL)INF; const int MAX = 1000 * 100 + 47; LL A[MAX]; void no() { cout << "NO" << endl; exit(0); } int main() { //freopen("in.txt", "r", stdin); //freopen("out.txt", "w", stdout); ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; FOR(i, 0, n) cin >> A[i]; LL s = 0; FOR(i, 0, n) { s += A[i]; } LL all = n *(LL) (n + 1) / 2; if (s % all != 0) no(); LL cnt = s / all; FOR(i, 0, n) { int nex = i + 1; if (nex == n) nex = 0; if ((A[i] - A[nex] + cnt) % n != 0) no(); } cout << "YES" << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Boxes |
User | vjudge5 |
Language | C++14 (Clang 3.8.0) |
Score | 0 |
Code Size | 1453 Byte |
Status | WA |
Exec Time | 107 ms |
Memory | 1024 KB |
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, sample1.txt, sample2.txt, sample3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 83 ms | 1024 KB |
in10.txt | AC | 11 ms | 384 KB |
in11.txt | WA | 106 ms | 1024 KB |
in12.txt | WA | 106 ms | 1024 KB |
in13.txt | WA | 89 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 | 105 ms | 1024 KB |
in20.txt | AC | 1 ms | 256 KB |
in21.txt | AC | 107 ms | 1024 KB |
in22.txt | AC | 107 ms | 1024 KB |
in23.txt | AC | 107 ms | 1024 KB |
in24.txt | AC | 6 ms | 256 KB |
in25.txt | AC | 12 ms | 384 KB |
in26.txt | WA | 104 ms | 1024 KB |
in27.txt | WA | 105 ms | 1024 KB |
in3.txt | AC | 106 ms | 1024 KB |
in4.txt | AC | 107 ms | 1024 KB |
in5.txt | AC | 107 ms | 1024 KB |
in6.txt | AC | 107 ms | 1024 KB |
in7.txt | AC | 104 ms | 1024 KB |
in8.txt | AC | 11 ms | 384 KB |
in9.txt | AC | 12 ms | 384 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |