Task: | Omenat |
Sender: | OOliOO |
Submission time: | 2016-01-23 23:06:51 +0200 |
Language: | C++ |
Status: | READY |
Result: | 77 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 76.8 |
test | verdict | time | score | |
---|---|---|---|---|
#1 | ACCEPTED | 0.05 s | 8.1 | details |
#2 | ACCEPTED | 0.06 s | 7.5 | details |
#3 | ACCEPTED | 0.06 s | 8.4 | details |
#4 | ACCEPTED | 0.05 s | 7.7 | details |
#5 | ACCEPTED | 0.05 s | 6.8 | details |
#6 | ACCEPTED | 0.05 s | 8.8 | details |
#7 | ACCEPTED | 0.05 s | 7.1 | details |
#8 | ACCEPTED | 0.06 s | 8.1 | details |
#9 | ACCEPTED | 0.06 s | 7.7 | details |
#10 | ACCEPTED | 0.05 s | 6.6 | details |
Code
#include <iostream> #include <vector> #include <stack> #include <queue> #include <algorithm> #include <cmath> #include <iomanip> #include <unordered_set> #include <stdio.h> #include <string.h> #include <unordered_map> #include <fstream> #include <set> #include <map> #define MOD 1000000007 #define ll long long //#define N (1<<50) #define float double #define str string using namespace std; struct lol{ vector<int> o1,o2; ll diff; }; bool operator<(lol a, lol b){ return a.diff<b.diff; } lol op(lol a, lol b){ if(a<b) return op(b,a); lol c; c.diff=a.diff-b.diff; for(auto asd:a.o1) c.o1.push_back(asd); for(auto asd:a.o2) c.o2.push_back(asd); for(auto asd:b.o1) c.o2.push_back(asd); for(auto asd:b.o2) c.o1.push_back(asd); return c; } int vast[100]; int main(){ int n; cin>>n; priority_queue<lol> pq; for(int i=0; i<n; i++){ lol uus; ll w; cin>>w; uus.diff=w; uus.o1.push_back(i); pq.push(uus); } while(pq.size()>=2){ lol a,b; a=pq.top(); pq.pop(); b=pq.top(); pq.pop(); pq.push(op(a,b)); } for(int i:pq.top().o1) vast[i]=1; for(int i:pq.top().o2) vast[i]=2; for(int i=0; i<n; i++) cout<<vast[i]<<" "; return 0; }
Test details
Test 1
Verdict: ACCEPTED
input |
---|
95 779724552 231968220 985023789 ... |
correct output |
---|
(empty) |
user output |
---|
1 1 2 2 2 2 1 1 2 1 2 1 2 2 1 ... |
Test 2
Verdict: ACCEPTED
input |
---|
85 229722261 51722691 862338862 8... |
correct output |
---|
(empty) |
user output |
---|
1 2 2 1 1 1 1 2 2 2 1 2 1 2 1 ... |
Test 3
Verdict: ACCEPTED
input |
---|
97 398995377 989444445 634573915 ... |
correct output |
---|
(empty) |
user output |
---|
1 2 1 2 2 1 1 2 2 1 1 2 1 1 2 ... |
Test 4
Verdict: ACCEPTED
input |
---|
99 843687873 164010938 51269970 4... |
correct output |
---|
(empty) |
user output |
---|
1 1 2 2 2 1 2 1 2 2 2 1 1 1 2 ... |
Test 5
Verdict: ACCEPTED
input |
---|
90 864611617 418460939 773297829 ... |
correct output |
---|
(empty) |
user output |
---|
1 1 1 1 1 1 2 2 2 2 1 1 2 1 2 ... |
Test 6
Verdict: ACCEPTED
input |
---|
92 289890246 25801423 763027596 7... |
correct output |
---|
(empty) |
user output |
---|
1 1 2 2 1 1 1 2 2 1 2 2 1 2 2 ... |
Test 7
Verdict: ACCEPTED
input |
---|
89 879039800 50522278 850785072 4... |
correct output |
---|
(empty) |
user output |
---|
1 2 2 2 2 2 1 2 2 1 1 1 2 1 1 ... |
Test 8
Verdict: ACCEPTED
input |
---|
96 27192469 222283781 681532515 1... |
correct output |
---|
(empty) |
user output |
---|
2 1 2 2 1 1 2 1 1 2 2 2 1 2 1 ... |
Test 9
Verdict: ACCEPTED
input |
---|
100 186459081 254674429 394007236 ... |
correct output |
---|
(empty) |
user output |
---|
1 1 1 1 2 1 1 1 2 2 2 2 2 2 2 ... |
Test 10
Verdict: ACCEPTED
input |
---|
98 612168861 979831717 671087051 ... |
correct output |
---|
(empty) |
user output |
---|
2 2 1 2 1 1 2 1 2 1 1 2 2 1 2 ... |