Submission #1499283
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <numeric> #include <random> #include <chrono> #define repeat(i,n) for (int i = 0; (i) < int(n); ++(i)) #define repeat_from(i,m,n) for (int i = (m); (i) < int(n); ++(i)) #define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x) using ll = long long; using namespace std; bool solve(vector<int> & a) { auto start = chrono::system_clock::now(); int n = a.size(); const ll nc2 = n*(n+1ll)/2; const ll sum_a = whole(accumulate, a, 0ll); if (sum_a % nc2 != 0) return false; repeat (q, sum_a / nc2) { int i = whole(min_element, a) - a.begin(); if (a[i] <= 0) break; repeat (k,i) a[k] -= (n+k)-i+1; repeat_from (k,i,n) a[k] -= k -i+1; if (q % 10 == 0) { auto end = chrono::system_clock::now(); double t = chrono::duration<double>(end - start).count(); if (t > 1.9) { return true; // random_device device; // uniform_int_distribution<int> dist(0, 1); // return dist(device); } } } return whole(count, a, 0) == n; } int main() { int n; cin >> n; vector<int> a(n); repeat (i,n) cin >> a[i]; cout << (solve(a) ? "YES" : "NO") << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Boxes |
User | kimiyuki |
Language | C++14 (Clang 3.8.0) |
Score | 500 |
Code Size | 1413 Byte |
Status | AC |
Exec Time | 1901 ms |
Memory | 896 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 | 88 ms | 896 KB |
in10.txt | AC | 483 ms | 256 KB |
in11.txt | AC | 924 ms | 640 KB |
in12.txt | AC | 894 ms | 640 KB |
in13.txt | AC | 248 ms | 640 KB |
in14.txt | AC | 1 ms | 256 KB |
in15.txt | AC | 1901 ms | 256 KB |
in16.txt | AC | 1 ms | 256 KB |
in17.txt | AC | 1901 ms | 256 KB |
in18.txt | AC | 1901 ms | 256 KB |
in19.txt | AC | 1 ms | 256 KB |
in2.txt | AC | 1060 ms | 640 KB |
in20.txt | AC | 1 ms | 256 KB |
in21.txt | AC | 111 ms | 640 KB |
in22.txt | AC | 111 ms | 640 KB |
in23.txt | AC | 111 ms | 640 KB |
in24.txt | AC | 109 ms | 256 KB |
in25.txt | AC | 310 ms | 256 KB |
in26.txt | AC | 319 ms | 640 KB |
in27.txt | AC | 592 ms | 640 KB |
in3.txt | AC | 1062 ms | 640 KB |
in4.txt | AC | 1199 ms | 640 KB |
in5.txt | AC | 1283 ms | 640 KB |
in6.txt | AC | 109 ms | 640 KB |
in7.txt | AC | 107 ms | 640 KB |
in8.txt | AC | 116 ms | 384 KB |
in9.txt | AC | 533 ms | 256 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |