| Task: | Omenat |
| Sender: | |
| Submission time: | 2015-12-20 16:26:38 +0200 |
| Language: | C++ |
| Status: | READY |
| Result: | 31 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 30.5 |
| test | verdict | time | score | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.05 s | 2.4 | details |
| #2 | ACCEPTED | 0.06 s | 4.7 | details |
| #3 | ACCEPTED | 0.06 s | 2.9 | details |
| #4 | ACCEPTED | 0.06 s | 3.1 | details |
| #5 | ACCEPTED | 0.07 s | 3.6 | details |
| #6 | ACCEPTED | 0.05 s | 3 | details |
| #7 | ACCEPTED | 0.04 s | 2.5 | details |
| #8 | ACCEPTED | 0.04 s | 2.8 | details |
| #9 | ACCEPTED | 0.06 s | 3.3 | details |
| #10 | ACCEPTED | 0.04 s | 2.2 | details |
Compiler report
input/code.cpp: In function 'int main()':
input/code.cpp:25:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int64_t i=0;i<a.size();i++) {
^Code
#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
typedef pair<int64_t,int64_t> P;
int main(void) {
int64_t n;
cin >> n;
vector<P> a(n);
for(int64_t i=0;i<n;i++) {
cin>>a[i].first;
a[i].first=-a[i].first;
a[i].second=i;
}
sort(a.begin(), a.end());
map<int64_t,int> who;
int64_t A=0,B=0;
for(int64_t i=0;i<a.size();i++) {
if(A <= B) {
A+=-a[i].first;
who[a[i].second]=1;
} else {
B+=-a[i].first;
who[a[i].second]=2;
}
}
for(int64_t i=0;i<n;i++) {
cout << who[i] << " ";
}
return 0;
}
Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 95 779724552 231968220 985023789 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 2 1 1 1 1 1 1 1 2 1 2 1 2 1 1 ... |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 85 229722261 51722691 862338862 8... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 2 2 1 1 2 1 2 1 2 1 1 1 2 2 2 ... |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 97 398995377 989444445 634573915 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 2 1 1 2 2 1 2 2 1 2 2 2 2 1 1 ... |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 99 843687873 164010938 51269970 4... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 2 2 1 2 1 1 2 2 2 2 2 1 1 1 2 ... |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 90 864611617 418460939 773297829 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 2 2 2 2 2 1 1 1 1 1 2 1 1 1 1 ... |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 92 289890246 25801423 763027596 7... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 2 1 1 1 2 2 1 2 1 1 1 1 2 ... |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 89 879039800 50522278 850785072 4... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 1 1 1 2 1 1 2 2 2 2 2 2 2 2 ... |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 96 27192469 222283781 681532515 1... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 2 2 1 1 2 1 1 1 1 1 1 2 1 1 2 ... |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 100 186459081 254674429 394007236 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 1 2 2 1 2 1 1 2 2 1 1 1 2 1 ... |
Test 10
Verdict: ACCEPTED
| input |
|---|
| 98 612168861 979831717 671087051 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 1 1 1 1 1 2 2 2 2 1 2 1 1 2 ... |
