| Task: | Omenat |
| Sender: | Metabolix |
| Submission time: | 2015-12-20 16:49:32 +0200 |
| Language: | C++ |
| Status: | READY |
| Result: | 86 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 86 |
| test | verdict | time | score | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.97 s | 8.6 | details |
| #2 | ACCEPTED | 0.96 s | 8.1 | details |
| #3 | ACCEPTED | 0.97 s | 9 | details |
| #4 | ACCEPTED | 0.97 s | 8.4 | details |
| #5 | ACCEPTED | 0.96 s | 8.5 | details |
| #6 | ACCEPTED | 0.97 s | 8.1 | details |
| #7 | ACCEPTED | 0.95 s | 9.1 | details |
| #8 | ACCEPTED | 0.94 s | 8.5 | details |
| #9 | ACCEPTED | 0.96 s | 8.4 | details |
| #10 | ACCEPTED | 0.97 s | 9.3 | details |
Code
#include <iostream>
#include <vector>
#include <algorithm>
#include <random>
#include <time.h>
int main() {
clock_t c0 = clock();
std::mt19937 gen;
int n;
std::cin >> n;
std::vector<int> p(n), a(n), a0;
a.reserve(n);
a0.reserve(n);
long e = 0;
for (int i = 0; i < n; ++i) {
std::cin >> p[i];
a[i] = p[i];
e += p[i];
}
e /= 2;
a0 = a;
long e0 = e;
while (e0 != 0 && (clock() - c0) * 1.0 / CLOCKS_PER_SEC < 0.90) {
for (int i = 0; i < 10000; ++i) {
for (int j = a.size(); j--;) {
std::swap(a[j], a[gen() % a.size()]);
}
for (int& j: a) {
if ((e < 0) == (j < 0)) {
e -= j;
j = -j;
}
if (std::abs(e) < e0) {
e0 = std::abs(e);
a0 = a;
if (e0 == 0) {
goto done;
}
}
}
}
}
done:
for (int i: p) {
auto j = std::find(a0.begin(), a0.end(), i);
if (j != a0.end()) {
a0.erase(j);
std::cout << "1 ";
} else {
std::cout << "2 ";
}
}
std::cout << "\n";
}
Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 95 779724552 231968220 985023789 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 1 2 1 2 2 2 1 1 1 2 1 1 1 ... |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 85 229722261 51722691 862338862 8... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 1 1 2 1 1 1 1 1 1 2 1 1 2 2 ... |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 97 398995377 989444445 634573915 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 1 2 2 1 2 1 2 2 2 2 1 2 1 ... |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 99 843687873 164010938 51269970 4... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 2 1 1 1 2 1 2 1 2 2 1 1 2 2 2 ... |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 90 864611617 418460939 773297829 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 1 2 2 1 1 1 1 2 2 2 2 1 2 2 ... |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 92 289890246 25801423 763027596 7... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 1 2 1 1 1 2 2 1 2 1 1 2 1 1 ... |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 89 879039800 50522278 850785072 4... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 1 1 2 1 1 1 1 1 2 1 1 1 1 1 ... |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 96 27192469 222283781 681532515 1... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 2 1 1 1 2 2 1 1 2 2 1 1 2 2 1 ... |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 100 186459081 254674429 394007236 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 1 1 1 2 1 1 2 1 1 1 1 1 2 2 ... |
Test 10
Verdict: ACCEPTED
| input |
|---|
| 98 612168861 979831717 671087051 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 2 1 2 1 1 1 1 2 2 2 2 1 1 ... |
