Task: | Omenat |
Sender: | Henrik Lievonen |
Submission time: | 2015-12-20 16:51:45 +0200 |
Language: | C++ |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
test | verdict | time | score | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.06 s | 0 | details |
#2 | WRONG ANSWER | 0.06 s | 0 | details |
#3 | WRONG ANSWER | 0.04 s | 0 | details |
#4 | WRONG ANSWER | 0.05 s | 0 | details |
#5 | WRONG ANSWER | 0.05 s | 0 | details |
#6 | WRONG ANSWER | 0.06 s | 0 | details |
#7 | WRONG ANSWER | 0.05 s | 0 | details |
#8 | WRONG ANSWER | 0.05 s | 0 | details |
#9 | WRONG ANSWER | 0.06 s | 0 | details |
#10 | WRONG ANSWER | 0.04 s | 0 | details |
Code
// G #include <iostream> #include <random> #include <vector> #include <algorithm> using namespace std; typedef unsigned long long int ull; mt19937 mt(0); uniform_int_distribution<> flip(1, 2); vector<pair<ull, int>> apples; void print(const vector<char> &r) { for (char c : r) cout << c << '\n'; } int main() { int n; cin >> n; for (int i = 0; i < n; i++) { ull a; cin >> a; apples.push_back(make_pair(a, i)); } vector<char> naive(n); ull naived; { ull u = 0; ull m = 0; for (int i = 0; i < n; i++) { auto a = apples[i]; if (u > m) { naive[i] = '2'; m += a.first; } else { naive[i] = '1'; u += a.first; } } naived = min(u-m, m-u); } vector<char> sorted(n); ull sortedd; { sort(apples.begin(), apples.end()); ull u = 0; ull m = 0; for (int i = n-1; i >= 0; i--) { auto a = apples[i]; if (u > m) { sorted[a.second] = '2'; m += a.first; } else { sorted[a.second] = '1'; u += a.first; } } sortedd = min(u-m, m-u); } vector<char> random; ull randomd = 1ull<60; { /*for (int j = 0; j < 100000; j++) { vector<char> cur(n); ull u = 0; ull m = 0; for (int i = 0; i < n; i++) { auto a = apples[i]; if (flip(mt)) { cur[a.second] = '1'; u += a.first; } else { cur[a.second] = '2'; m += a.first; } } ull t = min(u-m, m-u); if (t < randomd) { randomd = t; random = cur; } }*/ } if (naived < sortedd && naived < randomd) { print(naive); } else if (sortedd < naived && sortedd < randomd) { print(sorted); } else if (randomd < naived && randomd < sortedd) { print(random); } else { print(sorted); } }
Test details
Test 1
Verdict: WRONG ANSWER
input |
---|
95 779724552 231968220 985023789 ... |
correct output |
---|
(empty) |
user output |
---|
(empty) |
Test 2
Verdict: WRONG ANSWER
input |
---|
85 229722261 51722691 862338862 8... |
correct output |
---|
(empty) |
user output |
---|
(empty) |
Test 3
Verdict: WRONG ANSWER
input |
---|
97 398995377 989444445 634573915 ... |
correct output |
---|
(empty) |
user output |
---|
(empty) |
Test 4
Verdict: WRONG ANSWER
input |
---|
99 843687873 164010938 51269970 4... |
correct output |
---|
(empty) |
user output |
---|
(empty) |
Test 5
Verdict: WRONG ANSWER
input |
---|
90 864611617 418460939 773297829 ... |
correct output |
---|
(empty) |
user output |
---|
(empty) |
Test 6
Verdict: WRONG ANSWER
input |
---|
92 289890246 25801423 763027596 7... |
correct output |
---|
(empty) |
user output |
---|
(empty) |
Test 7
Verdict: WRONG ANSWER
input |
---|
89 879039800 50522278 850785072 4... |
correct output |
---|
(empty) |
user output |
---|
(empty) |
Test 8
Verdict: WRONG ANSWER
input |
---|
96 27192469 222283781 681532515 1... |
correct output |
---|
(empty) |
user output |
---|
(empty) |
Test 9
Verdict: WRONG ANSWER
input |
---|
100 186459081 254674429 394007236 ... |
correct output |
---|
(empty) |
user output |
---|
(empty) |
Test 10
Verdict: WRONG ANSWER
input |
---|
98 612168861 979831717 671087051 ... |
correct output |
---|
(empty) |
user output |
---|
(empty) |