| Task: | Tikut |
| Sender: | qhuge |
| Submission time: | 2024-10-31 23:20:37 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | 20 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | ACCEPTED | 8 |
| #3 | ACCEPTED | 12 |
| #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.01 s | 2, 5, 6 | details |
| #6 | ACCEPTED | 0.01 s | 2, 5, 6 | details |
| #7 | ACCEPTED | 0.00 s | 3, 5, 6 | details |
| #8 | ACCEPTED | 0.01 s | 3, 5, 6 | details |
| #9 | ACCEPTED | 0.00 s | 3, 5, 6 | details |
| #10 | ACCEPTED | 0.00 s | 3, 5, 6 | details |
| #11 | ACCEPTED | 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.00 s | 4, 5, 6 | details |
| #15 | WRONG ANSWER | 0.00 s | 4, 5, 6 | details |
| #16 | TIME LIMIT EXCEEDED | -- | 5, 6 | details |
| #17 | TIME LIMIT EXCEEDED | -- | 5, 6 | details |
| #18 | TIME LIMIT EXCEEDED | -- | 5, 6 | details |
| #19 | TIME LIMIT EXCEEDED | -- | 5, 6 | details |
| #20 | TIME LIMIT EXCEEDED | -- | 6 | details |
| #21 | TIME LIMIT EXCEEDED | -- | 6 | details |
| #22 | TIME LIMIT EXCEEDED | -- | 6 | details |
Code
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
int n, m;
std::cin >> n >> m;
std::vector<long int> map;
int z;
int number_of_entries = n;
for(int i = 0; i < number_of_entries; ++i)
if(std::cin >> z)
map.push_back(z);
std::string amnt;
std::vector<long> orig_vec = map;
sort(orig_vec.begin(), orig_vec.end());
std::reverse(orig_vec.begin(), orig_vec.end());
if (orig_vec[0] <= 999){
for (int i = 0; i < m; i++) {
int b = *std::max_element(map.begin(), map.end());
int newheight = floor((float)b/(float)2);
//std::cout << newheight << b << '\n';
auto itr = std::find(map.begin(), map.end(), b);
if (itr != map.end()) map.erase(itr);
if (newheight == b){
newheight--;
} else {
map.push_back(newheight);
}
map.push_back(b-newheight);
amnt = amnt + std::to_string(*std::max_element(map.begin(), map.end()) - *std::min_element(map.begin(), map.end())) + " ";
}
std::cout << amnt << '\n';
return 0;
}
for (long int z = 1; z < (m + 1); z++) {
std::vector<long int> t = map;
//cout << "Alkaa uusi" << '\n';
for (long int i = 0; i < (z - 1); i++){
std::vector<long int> orig_vec = t;
sort(orig_vec.begin(), orig_vec.end());
std::reverse(orig_vec.begin(), orig_vec.end());
long int s = orig_vec[1];
long int b = orig_vec[0];
long int newheight = ceil((float)b*((float)2/(float)3));
if (newheight <= s /*|| (b-newheight) < orig_vec[orig_vec.size()-1]*/){
newheight = ceil((float)b/(float)2);
}
//cout << "Suurin " << b << " -> " << newheight << " + " << b-newheight << '\n';
auto itr = std::find(t.begin(), t.end(), b);
if (itr != t.end()) t.erase(itr);
t.push_back(b-newheight);
t.push_back(newheight);
/*for (long int i: t)
std::cout << i << ' ';
std::cout << '\n';*/
}
long int b = *std::max_element(t.begin(), t.end());;
long int newheight = ceil((float)b/(float)2);
//cout << "Suurin " << b << " -> " << newheight << " + " << b-newheight << '\n';
auto itr = std::find(t.begin(), t.end(), b);
if (itr != t.end()) t.erase(itr);
t.push_back(b-newheight);
t.push_back(newheight);
/*for (long int i: t)
std::cout << i << ' ';
std::cout << '\n';*/
amnt = amnt + std::to_string(*std::max_element(t.begin(), t.end()) - *std::min_element(t.begin(), t.end())) + " ";
}
std::cout << amnt << '\n';
return 0;
}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: ACCEPTED
| input |
|---|
| 1000 2 501 501 501 501 501 501 501 50... |
| correct output |
|---|
| 1 168 |
| user output |
|---|
| 1 168 |
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: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 2000 928772177 816188227 216592201 ... |
| correct output |
|---|
| 991676844 990940224 990685481 ... |
| user output |
|---|
| (empty) |
Test 17
Group: 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 2000 665759876 597950008 615453266 ... |
| correct output |
|---|
| 498801198 498681904 498504321 ... |
| user output |
|---|
| (empty) |
Test 18
Group: 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 500 2000 683288817 784230412 626685186 ... |
| correct output |
|---|
| 497667621 498434895 495465990 ... |
| user output |
|---|
| (empty) |
Test 19
Group: 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 2000 666667000 809309500 571572000 ... |
| correct output |
|---|
| 499499500 499249250 498999000 ... |
| user output |
|---|
| (empty) |
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) |
