Submission #1093572
Source Code Expand
#include <iostream> #include <vector> #include <set> #include <array> #include <algorithm> using namespace std; typedef long long ll; bool is_all_zero(vector<ll> &vs) { for(auto v : vs) { if(v != 0) return false; } return true; } void print_array(vector<ll> &vs) { cerr << "["; for(auto v : vs) { cerr << v << ", "; } cerr << "]" << endl; } int main() { ll n; cin >> n; vector<ll> vs(n); ll sum = 0; for(int i = 0; i < n; i++) { cin >> vs[i]; sum += vs[i]; } if(sum % (n * (n + 1) / 2) == 0) { const ll counter = sum / (n * (n + 1) / 2); vector<ll> diff(n); for(int i = 0; i < n; i++) { diff[i] = vs[i] - vs[(i + 1) % n]; } swap(vs, diff); ll sum_2 = 0; bool all_div_n = true; for(int i = 0; i < n; i++) { diff[i] = vs[i] - vs[(i + 1) % n]; sum_2 += diff[i]; all_div_n &= (diff[i] % n == 0); } // print_array(diff); if(!sum_2 == 0 or !all_div_n) { cout << "NO" << endl; } else { ll counter_emu = 0; do { for(int i = 0; i < n; i++) { if(diff[i] < 0) { diff[(i + 1) % n] += diff[i]; counter_emu -= (diff[i] / n); diff[i] = 0; } } } while(!is_all_zero(diff)); if(counter == counter_emu) { cout << "Yes" << endl; } else { cout << "NO" << endl; } } } else { cout << "NO" << endl; } }
Submission Info
Submission Time | |
---|---|
Task | B - Boxes |
User | xyz600 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1424 Byte |
Status | WA |
Exec Time | 50 ms |
Memory | 1792 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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | WA | 38 ms | 1792 KB |
in10.txt | AC | 7 ms | 384 KB |
in11.txt | AC | 49 ms | 1792 KB |
in12.txt | AC | 49 ms | 1792 KB |
in13.txt | AC | 41 ms | 1536 KB |
in14.txt | WA | 3 ms | 256 KB |
in15.txt | WA | 3 ms | 256 KB |
in16.txt | AC | 3 ms | 256 KB |
in17.txt | WA | 2 ms | 256 KB |
in18.txt | WA | 2 ms | 256 KB |
in19.txt | AC | 3 ms | 256 KB |
in2.txt | WA | 47 ms | 1792 KB |
in20.txt | AC | 3 ms | 256 KB |
in21.txt | AC | 43 ms | 1024 KB |
in22.txt | AC | 42 ms | 1024 KB |
in23.txt | AC | 43 ms | 1152 KB |
in24.txt | AC | 5 ms | 384 KB |
in25.txt | AC | 7 ms | 384 KB |
in26.txt | AC | 50 ms | 1792 KB |
in27.txt | AC | 49 ms | 1792 KB |
in3.txt | WA | 47 ms | 1792 KB |
in4.txt | WA | 47 ms | 1792 KB |
in5.txt | WA | 47 ms | 1792 KB |
in6.txt | AC | 43 ms | 1024 KB |
in7.txt | AC | 45 ms | 1024 KB |
in8.txt | AC | 7 ms | 384 KB |
in9.txt | AC | 7 ms | 384 KB |
sample1.txt | WA | 3 ms | 256 KB |
sample2.txt | WA | 3 ms | 256 KB |
sample3.txt | AC | 3 ms | 256 KB |