Task: | Tikut |
Sender: | vulpesomnia |
Submission time: | 2024-11-07 12:01:04 +0200 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 8 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | ACCEPTED | 8 |
#3 | WRONG ANSWER | 0 |
#4 | WRONG ANSWER | 0 |
#5 | WRONG ANSWER | 0 |
#6 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.00 s | 1, 3, 4, 5, 6 | details |
#2 | WRONG ANSWER | 0.00 s | 1, 4, 5, 6 | details |
#3 | WRONG ANSWER | 0.00 s | 1, 4, 5, 6 | details |
#4 | WRONG ANSWER | 0.00 s | 1, 4, 5, 6 | details |
#5 | ACCEPTED | 0.00 s | 2, 5, 6 | details |
#6 | ACCEPTED | 0.00 s | 2, 5, 6 | details |
#7 | ACCEPTED | 0.00 s | 3, 5, 6 | details |
#8 | ACCEPTED | 0.00 s | 3, 5, 6 | details |
#9 | ACCEPTED | 0.00 s | 3, 5, 6 | details |
#10 | ACCEPTED | 0.00 s | 3, 5, 6 | details |
#11 | WRONG ANSWER | 0.00 s | 3, 5, 6 | details |
#12 | WRONG ANSWER | 0.00 s | 4, 5, 6 | details |
#13 | WRONG ANSWER | 0.00 s | 4, 5, 6 | details |
#14 | WRONG ANSWER | 0.01 s | 4, 5, 6 | details |
#15 | WRONG ANSWER | 0.00 s | 4, 5, 6 | details |
#16 | WRONG ANSWER | 0.06 s | 5, 6 | details |
#17 | WRONG ANSWER | 0.05 s | 5, 6 | details |
#18 | WRONG ANSWER | 0.04 s | 5, 6 | details |
#19 | WRONG ANSWER | 0.05 s | 5, 6 | details |
#20 | TIME LIMIT EXCEEDED | -- | 6 | details |
#21 | TIME LIMIT EXCEEDED | -- | 6 | details |
#22 | TIME LIMIT EXCEEDED | -- | 6 | details |
Code
#include <bits/stdc++.h> using namespace std; vector<int> bruteForce(int n, int m, std::map<int, int> a) { vector<int> vastaus = {}; int min = 0; int max = 0; for (const auto &pair : a) { if (pair.first < min || min == 0) { min = pair.first; } if (pair.first > max || max == 0) { max = pair.first; } } for (int i = 1; i <= m; i++) { //Mennään läpi kaikki leikkaukset. a[max] -= 1; int half = floor(max/2); //tsek if already does floor //cout << "Max: " << max << "Min:" << min << "\n"; //Varmistus, onko olemassa? Tee funktio helpotukseksi? if ((float)half != max/2.0) { a[half] += 1; a[half+1] += 1; } else { a[half] += 2; } //TODO LASKE UUSI MAKSIMI TAI MINIMIKIN?? min = 0; max = 0; for (const auto &pair : a) { if (pair.second != 0) { if (pair.first < min || min == 0) { min = pair.first; } if (pair.first > max || max == 0) { max = pair.first; } } } //for loopin jälkeen push back vastaukseen vastaus.push_back(max-min); } return vastaus; } int main() { int n, m; std::map<int, int> a; cin >> n >> m; for (int i = 0; i < n; i++) { int temp; cin >> temp; if (a[temp] > 0) { a[temp] += 1; } else { a[temp] = 1; } } vector<int> vastaukset = bruteForce(n, m, a); for (int i = 0; i < (int)vastaukset.size(); i++) { cout << vastaukset[i] << " "; } }
Test details
Test 1
Group: 1, 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
1 1 6 |
correct output |
---|
0 |
user output |
---|
0 |
Test 2
Group: 1, 4, 5, 6
Verdict: WRONG ANSWER
input |
---|
5 10 4 8 6 2 7 |
correct output |
---|
5 4 2 2 2 1 1 1 1 1 |
user output |
---|
5 4 2 2 2 2 1 2 2 1 |
Test 3
Group: 1, 4, 5, 6
Verdict: WRONG ANSWER
input |
---|
5 10 5 5 8 6 7 |
correct output |
---|
3 3 2 3 2 2 1 1 1 2 |
user output |
---|
3 3 2 3 2 2 2 1 2 2 |
Test 4
Group: 1, 4, 5, 6
Verdict: WRONG ANSWER
input |
---|
5 10 8 7 9 6 10 |
correct output |
---|
4 4 3 3 2 2 1 2 2 1 |
user output |
---|
4 4 3 3 2 3 3 2 2 2 |
Test 5
Group: 2, 5, 6
Verdict: ACCEPTED
input |
---|
1000 1071 3 2 3 1 3 3 2 3 2 3 2 2 2 1 2 ... |
correct output |
---|
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ... |
user output |
---|
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ... |
Test 6
Group: 2, 5, 6
Verdict: ACCEPTED
input |
---|
1000 1500 3 2 2 3 2 3 2 2 2 3 2 2 3 3 3 ... |
correct output |
---|
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ... |
user output |
---|
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ... |
Test 7
Group: 3, 5, 6
Verdict: ACCEPTED
input |
---|
1000 2 15 710 210 347 398 66 318 277 ... |
correct output |
---|
994 994 |
user output |
---|
994 994 |
Test 8
Group: 3, 5, 6
Verdict: ACCEPTED
input |
---|
1000 2 743 890 592 942 736 969 616 50... |
correct output |
---|
498 496 |
user output |
---|
498 496 |
Test 9
Group: 3, 5, 6
Verdict: ACCEPTED
input |
---|
1000 2 987 968 920 994 988 918 914 95... |
correct output |
---|
500 500 |
user output |
---|
500 500 |
Test 10
Group: 3, 5, 6
Verdict: ACCEPTED
input |
---|
1000 2 996 1000 998 998 999 997 997 9... |
correct output |
---|
500 500 |
user output |
---|
500 500 |
Test 11
Group: 3, 5, 6
Verdict: WRONG ANSWER
input |
---|
1000 2 501 501 501 501 501 501 501 50... |
correct output |
---|
1 168 |
user output |
---|
1 251 |
Test 12
Group: 4, 5, 6
Verdict: WRONG ANSWER
input |
---|
100 200 145 136 74 83 73 36 196 115 11... |
correct output |
---|
194 190 189 183 182 181 181 17... |
user output |
---|
194 190 189 183 182 181 181 17... |
Test 13
Group: 4, 5, 6
Verdict: WRONG ANSWER
input |
---|
100 200 157 110 168 155 192 107 146 15... |
correct output |
---|
95 96 96 95 93 94 94 94 90 91 ... |
user output |
---|
95 96 96 95 93 94 94 94 90 91 ... |
Test 14
Group: 4, 5, 6
Verdict: WRONG ANSWER
input |
---|
50 200 137 118 160 118 146 160 140 18... |
correct output |
---|
98 98 98 96 90 91 88 88 84 86 ... |
user output |
---|
98 98 98 96 90 91 88 88 84 86 ... |
Test 15
Group: 4, 5, 6
Verdict: WRONG ANSWER
input |
---|
100 200 147 174 186 148 155 128 158 18... |
correct output |
---|
99 99 98 98 97 97 96 96 95 95 ... |
user output |
---|
99 99 98 98 97 97 96 96 95 95 ... |
Test 16
Group: 5, 6
Verdict: WRONG ANSWER
input |
---|
1000 2000 928772177 816188227 216592201 ... |
correct output |
---|
991676844 990940224 990685481 ... |
user output |
---|
991676844 990940224 990685481 ... |
Test 17
Group: 5, 6
Verdict: WRONG ANSWER
input |
---|
1000 2000 665759876 597950008 615453266 ... |
correct output |
---|
498801198 498681904 498504321 ... |
user output |
---|
498801198 498681904 498504321 ... |
Test 18
Group: 5, 6
Verdict: WRONG ANSWER
input |
---|
500 2000 683288817 784230412 626685186 ... |
correct output |
---|
497667621 498434895 495465990 ... |
user output |
---|
497667621 498434895 495465990 ... |
Test 19
Group: 5, 6
Verdict: WRONG ANSWER
input |
---|
1000 2000 666667000 809309500 571572000 ... |
correct output |
---|
499499500 499249250 498999000 ... |
user output |
---|
499499500 499249250 498999000 ... |
Test 20
Group: 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 200000 861772559 734298084 983382252 ... |
correct output |
---|
499973914 499985299 499985141 ... |
user output |
---|
(empty) |
Test 21
Group: 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
30000 200000 691834579 617419813 514778075 ... |
correct output |
---|
499967533 499976270 499969810 ... |
user output |
---|
(empty) |
Test 22
Group: 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 200000 820255000 960780000 741965000 ... |
correct output |
---|
499995000 499992500 499990000 ... |
user output |
---|
(empty) |