Submission #1232463
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; const double pi = acos(-1); #define EACH(i,a) for (auto& i : a) #define FOR(i,a,b) for (ll i=(a);i<(b);i++) #define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--) #define REP(i,n) FOR(i,0,n) #define RREP(i,n) RFOR(i,0,n) template<typename T> ostream& operator<<(ostream& os, const vector<T>& v) { REP(i,v.size()){if(i)os<<" ";os<<v[i];}return os;} template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v) { REP(i,v.size()){if(i)os<<endl;os<<v[i];}return os;} bool solve(vector<ll> A) { ll n = A.size(); // ΣA[i] を求める ll sum = 0; REP(i, n) { sum += A[i]; } // 1回の操作で取り除く個数 ll K = n * (n+1) / 2; // 割り切れないとどう頑張ってもちょうど全部取り除けない if (sum % K != 0) { return false; } // 合計操作回数 ll T = sum / K; REP(i, n) { // 隣との差を埋められるか ll d = A[(i+1)%n] - A[i] - T; if (d > 0 || -d % n != 0) { return false; } } return true; } int main() { ios::sync_with_stdio(false); cin.tie(0); // メインプログラムここから ll n; cin >> n; vector<ll> A(n); REP(i, n) { cin >> A[i]; } if (solve(A)) { cout << "YES" << endl; } else { cout << "NO" << endl; } }
Submission Info
Submission Time | |
---|---|
Task | B - Boxes |
User | drafear |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1480 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 | 12 ms | 1792 KB |
in10.txt | AC | 2 ms | 384 KB |
in11.txt | AC | 11 ms | 1792 KB |
in12.txt | AC | 11 ms | 1792 KB |
in13.txt | AC | 10 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 | 1792 KB |
in22.txt | AC | 11 ms | 1792 KB |
in23.txt | AC | 11 ms | 1792 KB |
in24.txt | AC | 2 ms | 384 KB |
in25.txt | AC | 2 ms | 384 KB |
in26.txt | AC | 11 ms | 1792 KB |
in27.txt | AC | 11 ms | 1792 KB |
in3.txt | AC | 13 ms | 1792 KB |
in4.txt | AC | 13 ms | 1792 KB |
in5.txt | AC | 13 ms | 1792 KB |
in6.txt | AC | 11 ms | 1792 KB |
in7.txt | AC | 11 ms | 1792 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 |