Submission #1131035
Source Code Expand
#include<iostream> #include<iomanip> #include<map> #include<unordered_map> #include<set> #include<unordered_set> #include<vector> #include<array> #include<string> #include<stack> #include<queue> #include<algorithm> #include<cassert> #include<functional> #include<random> #include<complex> #include<bitset> #include<chrono> //#include<boost/multiprecision/cpp_int.hpp> #define int int64_t #define uint uint64_t #define REP(i, a, b) for (int64_t i = (int64_t)(a); i < (int64_t)(b); i++) #define rep(i, a) REP(i, 0, a) #define SZ(X) ((int64_t)((X).size())) #define ITR(x, a) for (auto x = a.begin(); x != a.end(); x++) #define ALL(a) (a.begin()), (a.end()) #define HAS(a, x) (a.find(x) != a.end()) #define Min(x) *min_element(ALL(x)) #define Max(x) *max_element(ALL(x)) #define Unique(L) (L.erase(unique(ALL(L)), L.end())) #define intmax (std::numeric_limits<int64_t>::max() / 4) #define doublemax (std::numeric_limits<double>::max() / 4) using namespace std; //typedef boost::multiprecision::cpp_int bigint; const double EPS = 1e-9; const double PI = acos(-1.0); signed main() { cin.tie(0); ios::sync_with_stdio(false); int N; cin >> N; vector<int>A(N); int sum = 0; rep(i, N) { cin >> A[i]; sum += A[i]; } int onestep = 0; for (int i = 1; i <= N; i++)onestep += i; if (sum%onestep) { cout << "NO"<<endl; return 0; } int step = sum / onestep; vector<int>dA(N); rep(i, N)dA[i] = A[(i + 1) % N] - A[i] - step; rep(i, N) { if (0 < dA[i]) { cout << "NO" << endl; return 0; } if (dA[i] == 0)continue; if((-dA[i]) % N) { cout << "NO" << endl; return 0; } } cout << "YES" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Boxes |
User | eukaryo |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1715 Byte |
Status | AC |
Exec Time | 13 ms |
Memory | 1792 KB |
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 | 1792 KB |
in10.txt | AC | 2 ms | 384 KB |
in11.txt | AC | 12 ms | 1792 KB |
in12.txt | AC | 12 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 | 13 ms | 1792 KB |
in20.txt | AC | 1 ms | 256 KB |
in21.txt | AC | 11 ms | 1024 KB |
in22.txt | AC | 11 ms | 1024 KB |
in23.txt | AC | 11 ms | 1024 KB |
in24.txt | AC | 2 ms | 384 KB |
in25.txt | AC | 2 ms | 384 KB |
in26.txt | AC | 12 ms | 1792 KB |
in27.txt | AC | 12 ms | 1792 KB |
in3.txt | AC | 13 ms | 1792 KB |
in4.txt | AC | 12 ms | 1792 KB |
in5.txt | AC | 12 ms | 1792 KB |
in6.txt | AC | 11 ms | 1024 KB |
in7.txt | AC | 11 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 |