Submission details
Task:Establish equality
Sender:aalto26bm_026
Submission time:2026-09-07 17:48:13 +0300
Language:C++ (C++20)
Status:READY
Result:
Test results
testverdicttime
#10.00 sdetails
#20.00 sdetails
#30.00 sdetails
#40.00 sdetails
#50.00 sdetails
#60.00 sdetails
#70.00 sdetails
#8ACCEPTED0.00 sdetails
#90.00 sdetails
#100.00 sdetails
#110.00 sdetails
#12ACCEPTED0.00 sdetails
#130.00 sdetails
#140.00 sdetails
#150.00 sdetails
#16ACCEPTED0.00 sdetails
#170.00 sdetails
#180.00 sdetails
#190.00 sdetails
#200.00 sdetails
#210.00 sdetails
#220.00 sdetails
#230.00 sdetails
#240.00 sdetails
#250.00 sdetails
#260.00 sdetails
#270.00 sdetails
#280.00 sdetails
#29ACCEPTED0.00 sdetails
#300.00 sdetails
#31ACCEPTED0.00 sdetails
#320.00 sdetails
#330.00 sdetails
#340.00 sdetails
#350.00 sdetails
#36ACCEPTED0.01 sdetails
#370.01 sdetails
#380.01 sdetails
#390.01 sdetails
#400.01 sdetails
#410.01 sdetails
#42ACCEPTED0.02 sdetails
#430.02 sdetails
#440.03 sdetails
#450.04 sdetails
#460.04 sdetails
#470.05 sdetails
#480.06 sdetails
#49ACCEPTED0.06 sdetails
#500.07 sdetails
#51ACCEPTED0.13 sdetails
#520.13 sdetails
#530.13 sdetails
#540.13 sdetails
#55ACCEPTED0.13 sdetails

Code

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <stdint.h>
using namespace std;

bool isValidSolution(const vector<uint64_t>& bottles, uint64_t target)
{
    uint64_t deficit, surplus;
    deficit = surplus = 0;
    for (size_t i = 0; i < bottles.size(); i++)
    {
        if (bottles[i] < target)
        {
            deficit += target - bottles[i];
        }
        else
        {
            surplus += bottles[i] - target;
        }
    }
    return surplus >= 2 * deficit;
}

int main()
{
    uint64_t n;
    cin >> n;
    vector<uint64_t> bottles(n);
    for (size_t i = 0; i < n; i++)
    {
        cin >> bottles[i];
    }

    uint64_t bestSolution = 0;
    uint64_t a = 0, b = 1000000000;
    while (a <= b)
    {
        uint64_t k = a + (b - a) / 2;
        if (isValidSolution(bottles, k))
        {
                bestSolution = k;
            a = k + 1;
        }
        else
        {
            b = k - 1;
        }
    }
    if (isValidSolution(bottles, bestSolution - 1))
    {
    cout << bestSolution - 1 << endl;
        
    }
    else
    {
    cout << bestSolution << endl;
        
    }

}

Test details

Test 1

Verdict:

input
1

correct output
4

user output
3

Test 2

Verdict:

input
2
4 2 

correct output
2

user output
1

Test 3

Verdict:

input
2
6 0 

correct output
2

user output
1

Test 4

Verdict:

input
3
10 9 6 

correct output
7

user output
6

Test 5

Verdict:

input
6
2 0 9 9 2 4 

correct output
3

user output
2

Test 6

Verdict:

input
10
4 10 7 10 0 1 3 10 1 2 

correct output
3

user output
2

Test 7

Verdict:

input
10
4 2 0 10 6 10 4 5 4 3 

correct output
4

user output
3

Test 8

Verdict: ACCEPTED

input
10
6 0 7 9 3 1 5 6 9 4 

correct output
3

user output
3

Test 9

Verdict:

input
10
10 9 6 1 10 9 7 6 7 6 

correct output
6

user output
5

Test 10

Verdict:

input
10
2 0 9 9 2 4 10 10 5 0 

correct output
3

user output
2

Test 11

Verdict:

input
10
1 0 0 7 5 2 7 10 4 1 

correct output
2

user output
1

Test 12

Verdict: ACCEPTED

input
10
1 4 8 9 2 0 5 7 0 3 

correct output
2

user output
2

Test 13

Verdict:

input
10
8 6 2 9 9 9 10 1 10 8 

correct output
6

user output
5

Test 14

Verdict:

input
10
5 10 8 7 9 4 0 1 3 2 

correct output
3

user output
2

Test 15

Verdict:

input
10
9 8 1 6 0 1 3 9 3 10 

correct output
3

user output
2

Test 16

Verdict: ACCEPTED

input
100
417 998 721 933 0 128 302 1000...

correct output
402

user output
402

Test 17

Verdict:

input
100
436 185 25 932 550 948 435 485...

correct output
402

user output
401

Test 18

Verdict:

input
100
551 70 708 840 291 121 511 569...

correct output
391

user output
390

Test 19

Verdict:

input
100
967 901 547 172 973 856 715 60...

correct output
395

user output
394

Test 20

Verdict:

input
100
222 55 871 832 206 364 919 980...

correct output
418

user output
417

Test 21

Verdict:

input
100
180 68 19 665 463 194 725 927 ...

correct output
401

user output
400

Test 22

Verdict:

input
100
154 446 740 874 263 86 534 724...

correct output
409

user output
408

Test 23

Verdict:

input
100
778 607 237 860 825 893 966 17...

correct output
419

user output
418

Test 24

Verdict:

input
100
514 922 773 659 871 366 8 149 ...

correct output
410

user output
409

Test 25

Verdict:

input
100
849 814 179 591 54 111 361 819...

correct output
381

user output
380

Test 26

Verdict:

input
100
48 800 289 680 721 36 21 952 2...

correct output
446

user output
445

Test 27

Verdict:

input
100
208 702 482 731 420 638 860 78...

correct output
431

user output
430

Test 28

Verdict:

input
100
517 669 947 185 766 782 282 57...

correct output
417

user output
416

Test 29

Verdict: ACCEPTED

input
100
960 294 700 52 1000 317 220 98...

correct output
483

user output
483

Test 30

Verdict:

input
100
870 696 582 433 279 98 186 181...

correct output
433

user output
432

Test 31

Verdict: ACCEPTED

input
1000
549 593 715 845 603 858 545 84...

correct output
417

user output
417

Test 32

Verdict:

input
1000
417 998 721 933 0 128 302 1000...

correct output
409

user output
408

Test 33

Verdict:

input
1000
436 185 25 932 550 948 435 485...

correct output
409

user output
408

Test 34

Verdict:

input
1000
551 70 708 840 291 121 511 569...

correct output
416

user output
415

Test 35

Verdict:

input
1000
967 901 547 172 973 856 715 60...

correct output
420

user output
419

Test 36

Verdict: ACCEPTED

input
2000
238363352 59249203 934941691 8...

correct output
408637955

user output
408637955

Test 37

Verdict:

input
2000
958701282 356460600 224848373 ...

correct output
419252506

user output
419252505

Test 38

Verdict:

input
2000
81935403 244103473 837431430 3...

correct output
416082617

user output
416082616

Test 39

Verdict:

input
2000
937837680 11934037 257096282 9...

correct output
417515719

user output
417515718

Test 40

Verdict:

input
2000
11139167 391337047 538883743 5...

correct output
409258945

user output
409258944

Test 41

Verdict:

input
10000
589284011 636562059 767928733 ...

correct output
413957321

user output
413957320

Test 42

Verdict: ACCEPTED

input
20000
447773961 773442531 122815 137...

correct output
414852078

user output
414852078

Test 43

Verdict:

input
30000
468145962 198730371 27838075 5...

correct output
410179075

user output
410179074

Test 44

Verdict:

input
40000
591414746 75940262 760367934 9...

correct output
414505355

user output
414505354

Test 45

Verdict:

input
50000
967034923 587586157 185430193 ...

correct output
412022071

user output
412022070

Test 46

Verdict:

input
60000
238363352 59249203 934941691 8...

correct output
414871380

user output
414871379

Test 47

Verdict:

input
70000
958701282 356460600 224848373 ...

correct output
413955399

user output
413955398

Test 48

Verdict:

input
80000
81935403 244103473 837431430 3...

correct output
414719178

user output
414719177

Test 49

Verdict: ACCEPTED

input
90000
937837680 11934037 257096282 9...

correct output
412407588

user output
412407588

Test 50

Verdict:

input
100000
11139167 391337047 538883743 5...

correct output
413339299

user output
413339298

Test 51

Verdict: ACCEPTED

input
200000
589284011 636562059 767928733 ...

correct output
414309243

user output
414309243

Test 52

Verdict:

input
200000
447773961 773442531 122815 137...

correct output
413259631

user output
413259630

Test 53

Verdict:

input
200000
468145962 198730371 27838075 5...

correct output
413293056

user output
413293055

Test 54

Verdict:

input
200000
591414746 75940262 760367934 9...

correct output
414827553

user output
414827552

Test 55

Verdict: ACCEPTED

input
200000
967034923 587586157 185430193 ...

correct output
412998578

user output
412998578