Task: | Tikut |
Sender: | Tmotomaster |
Submission time: | 2024-11-10 11:32:39 +0200 |
Language: | C++ (C++20) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | RUNTIME ERROR | 0 |
#2 | TIME LIMIT EXCEEDED | 0 |
#3 | RUNTIME ERROR | 0 |
#4 | RUNTIME ERROR | 0 |
#5 | RUNTIME ERROR | 0 |
#6 | RUNTIME ERROR | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | RUNTIME ERROR | 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 | RUNTIME ERROR | 0.00 s | 1, 4, 5, 6 | details |
#5 | TIME LIMIT EXCEEDED | -- | 2, 5, 6 | details |
#6 | TIME LIMIT EXCEEDED | -- | 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.01 s | 3, 5, 6 | details |
#12 | RUNTIME ERROR | 0.00 s | 4, 5, 6 | details |
#13 | WRONG ANSWER | 0.02 s | 4, 5, 6 | details |
#14 | WRONG ANSWER | 0.02 s | 4, 5, 6 | details |
#15 | WRONG ANSWER | 0.02 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 | RUNTIME ERROR | 0.01 s | 5, 6 | details |
#20 | RUNTIME ERROR | 0.32 s | 6 | details |
#21 | TIME LIMIT EXCEEDED | -- | 6 | details |
#22 | RUNTIME ERROR | 0.29 s | 6 | details |
Code
#include <iostream> #include <math.h> using namespace std; struct Pituus { int arvo; bool olemassa = true; Pituus* vasen = nullptr; Pituus* oikea = nullptr; Pituus(int luku) { arvo = luku; } ~Pituus() { if (vasen != nullptr) { delete vasen; } if (oikea != nullptr) { delete oikea; } } void Add(int luku) { if (luku < arvo) { if (vasen == nullptr) { vasen = new Pituus(luku); } else { vasen->Add(luku); } } else { if (oikea == nullptr) { oikea = new Pituus(luku); } else { oikea->Add(luku); } } } Pituus* Get(int luku) { if (luku == arvo) { return this; } else if (luku < arvo) { if (vasen == nullptr) { return this; } else { return vasen->Get(luku); } } else { if (oikea == nullptr) { return this; } else { return oikea->Get(luku); } } } int Suurin(int varaArvo=0) { if (oikea == nullptr) { if (olemassa) { return arvo; } else if (vasen != nullptr) { return vasen->Suurin(varaArvo); } else { return varaArvo; } } else { return oikea->Suurin(olemassa ? arvo : varaArvo); } } int ToiseksiSuurin(int varaArvo = 0) { int suurin = Suurin(); if (oikea == nullptr) { return (*vasen).arvo; } else if ((*oikea).arvo == suurin) { if (olemassa) { return arvo; } else if (vasen != nullptr) { return vasen->ToiseksiSuurin(varaArvo); } else { return varaArvo; } } else { return oikea->ToiseksiSuurin(olemassa ? arvo : varaArvo); } } int Pienin(int varaArvo=0) { if (vasen == nullptr) { return olemassa ? arvo : varaArvo; } else { return vasen->Pienin(olemassa ? arvo : varaArvo); } } void mPrint() { if (vasen != nullptr) { vasen->mPrint(); } if (olemassa) { cout << '|' << arvo << '|'; } if (oikea != nullptr) { oikea->mPrint(); } } void Leikkaa(int luku, int nimittaja) { (*this->Get(luku)).olemassa = false; int pikkuosia = nimittaja * ((luku / nimittaja) + 1) - luku; for (int i = 0; i < pikkuosia; i++) { Add(luku / nimittaja); } for (int i = 0; i < nimittaja - pikkuosia; i++) { Add(luku / nimittaja + 1); } } }; int main() { int n, m; cin >> n >> m; int tikku1; cin >> tikku1; int* alkutikut = new int[n] {tikku1}; for (int i = 1; i < n; i++) { int tikku; cin >> tikku; alkutikut[i] = tikku; } for (int k = 1; k <= m; k++) { Pituus* tikut = new Pituus(tikku1); for (int i = 1; i < n; i++) { tikut->Add(alkutikut[i]); } for (int l = 0; l < k; l++) { int suurin = tikut->Suurin(); int toiseksiSuurin = tikut->ToiseksiSuurin(); int leikkaus = 2; while (ceil((float)suurin / (float)leikkaus) > toiseksiSuurin && leikkaus - 1 < k - l) { leikkaus += 1; l++; } tikut->Leikkaa(suurin, leikkaus); // Tee pituudesta jotenkin sellainen, ettei se jaa ainoastaan kahdella. Sä pystyt siihen ehkä :ɔ } // tikut->mPrint(); cout << tikut->Suurin() - tikut->Pienin(); if (k < m) { cout << " "; } } return 0; }
Test details
Test 1
Group: 1, 3, 4, 5, 6
Verdict: RUNTIME ERROR
input |
---|
1 1 6 |
correct output |
---|
0 |
user output |
---|
(empty) |
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 0 0 0 0 0 0 |
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 3 3 3 3 3 3 |
Test 4
Group: 1, 4, 5, 6
Verdict: RUNTIME ERROR
input |
---|
5 10 8 7 9 6 10 |
correct output |
---|
4 4 3 3 2 2 1 2 2 1 |
user output |
---|
(empty) |
Test 5
Group: 2, 5, 6
Verdict: TIME LIMIT EXCEEDED
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 |
---|
(empty) |
Test 6
Group: 2, 5, 6
Verdict: TIME LIMIT EXCEEDED
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 |
---|
(empty) |
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: RUNTIME ERROR
input |
---|
100 200 145 136 74 83 73 36 196 115 11... |
correct output |
---|
194 190 189 183 182 181 181 17... |
user output |
---|
(empty) |
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 72 73 -78 0 -84 -84 -... |
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 89 67 80 80 80 80 80 80 ... |
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 91 92 81 60 -73 0 -87... |
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: RUNTIME ERROR
input |
---|
1000 2000 666667000 809309500 571572000 ... |
correct output |
---|
499499500 499249250 498999000 ... |
user output |
---|
(empty) |
Test 20
Group: 6
Verdict: RUNTIME ERROR
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: RUNTIME ERROR
input |
---|
100000 200000 820255000 960780000 741965000 ... |
correct output |
---|
499995000 499992500 499990000 ... |
user output |
---|
(empty) |