CSES - Aalto Competitive Programming 2024 - wk2 - Mon - Results
Submission details
Task:Establish equality
Sender:AleksandrPolitov
Submission time:2024-09-09 17:23:24 +0300
Language:C++ (C++20)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#70.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#130.00 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails
#16ACCEPTED0.00 sdetails
#17ACCEPTED0.00 sdetails
#18ACCEPTED0.00 sdetails
#190.00 sdetails
#200.00 sdetails
#21ACCEPTED0.00 sdetails
#22ACCEPTED0.00 sdetails
#23ACCEPTED0.00 sdetails
#24ACCEPTED0.00 sdetails
#250.00 sdetails
#26ACCEPTED0.00 sdetails
#27ACCEPTED0.00 sdetails
#280.00 sdetails
#29ACCEPTED0.00 sdetails
#30ACCEPTED0.00 sdetails
#31ACCEPTED0.01 sdetails
#32ACCEPTED0.01 sdetails
#330.01 sdetails
#340.01 sdetails
#350.01 sdetails
#36ACCEPTED0.04 sdetails
#37ACCEPTED0.04 sdetails
#380.04 sdetails
#390.04 sdetails
#40ACCEPTED0.04 sdetails
#410.23 sdetails
#42ACCEPTED0.55 sdetails
#43ACCEPTED0.90 sdetails
#44--details
#45--details
#46--details
#47--details
#48--details
#49--details
#50--details
#51--details
#52--details
#53--details
#54--details
#55--details

Compiler report

input/code.cpp: In function 'bool can(ll)':
input/code.cpp:95:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |     for (int i = 0; i < v.size(); i++) {
      |                     ~~^~~~~~~~~~

Code

#ifdef ONPC
    #define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>

#define char unsigned char
#define rep(i, a, b) for(int i=a; i< (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back

#define LSOne(S) ((S) & -(S))

using namespace std;
// mt19937 rnd(239);
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

typedef long long C;
typedef complex<C> P;
#define X real()
#define Y imag()

template<class T>
istream& operator>> (istream& is, complex<T>& p) {
    T value;
    is >> value;
    p.real(value);
    is >> value;
    p.imag(value);
    return is;
}

typedef long long ll;
typedef long double ld;

using pi = pair<ll, ll>;
using vi = vector<ll>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;

int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }

#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef DEBUG
#define dbg(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
#define dbg(x...)
#endif

template<typename S, typename T = S> void chmin(S &s, T t) {s = s < t ? s : t;}
template<typename S, typename T = S> void chmax(S &s, T t) {s = s > t ? s : t;}

const int INF = 1e9; // 10^9 = 1B is < 2^31-1
const ll LLINF = 4e18; // 4*10^18 is < 2^63-1
const double EPS = 1e-9;
const ll MOD = 1e9+7;

vector<ll> v;

bool can(ll x) {
    multiset<ll> st;
    for (int i = 0; i < v.size(); i++) {
        st.insert(v[i]);
    }

    while(*st.begin()<x) {
        ll low=*st.begin();
        ll big=*st.rbegin();

        if(low+(big-x)/2>=x && big-2*(big-x)/2>=x) {
            ll k=(x-low);
            st.erase(st.find(low));
            st.erase(st.find(big));
            big-=2*k;
            low+=k;
            st.insert(low);
            st.insert(big);
        } else {
            ll k=(big-x-1)/2;
            if(k>0) {
                st.erase(st.find(low));
                st.erase(st.find(big));
                low+=k;
                big-=2*k;
                st.insert(low);
                st.insert(big);
                //std::cout << "to " << low << " " << big << std::endl;
            } else {
                break;
            }

        }



        //std::cout  << std::endl;
        //__print(st);
        //std::cout  << std::endl;
    }


    //__print(st);
    return *st.begin()>=x;
    
}

int solve() {
    int n; std::cin >> n;
    v.resize(n);
    for (int i = 0; i < n; i++) std::cin >> v[i];

    

    ll lo=0, hi=LLINF;
    while(lo<hi) {
        ll mid=(lo+hi+1)/2;
        if(can(mid)) {
            lo=mid;
        } else {
            hi=mid-1;
        }
    }

    std::cout << lo << std::endl;

    return 0;
}

int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1;
    //cin >> TET;
    for (int i = 1; i <= TET; i++) {
        #ifdef ONPC
            cout << "TEST CASE#" << i << endl;
        #endif
        
        if (solve()) {
            break;
        }

        #ifdef ONPC
            cout << "__________________________" << endl;
        #endif
    }
    #ifdef ONPC
        cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
    #endif
}

Test details

Test 1

Verdict: ACCEPTED

input
1

correct output
4

user output
4

Test 2

Verdict: ACCEPTED

input
2
4 2 

correct output
2

user output
2

Test 3

Verdict: ACCEPTED

input
2
6 0 

correct output
2

user output
2

Test 4

Verdict: ACCEPTED

input
3
10 9 6 

correct output
7

user output
7

Test 5

Verdict: ACCEPTED

input
6
2 0 9 9 2 4 

correct output
3

user output
3

Test 6

Verdict: ACCEPTED

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

correct output
3

user output
3

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: ACCEPTED

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

correct output
6

user output
6

Test 10

Verdict: ACCEPTED

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

correct output
3

user output
3

Test 11

Verdict: ACCEPTED

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

correct output
2

user output
2

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: ACCEPTED

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

correct output
3

user output
3

Test 15

Verdict: ACCEPTED

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

correct output
3

user output
3

Test 16

Verdict: ACCEPTED

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

correct output
402

user output
402

Test 17

Verdict: ACCEPTED

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

correct output
402

user output
402

Test 18

Verdict: ACCEPTED

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

correct output
391

user output
391

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: ACCEPTED

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

correct output
401

user output
401

Test 22

Verdict: ACCEPTED

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

correct output
409

user output
409

Test 23

Verdict: ACCEPTED

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

correct output
419

user output
419

Test 24

Verdict: ACCEPTED

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

correct output
410

user output
410

Test 25

Verdict:

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

correct output
381

user output
380

Test 26

Verdict: ACCEPTED

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

correct output
446

user output
446

Test 27

Verdict: ACCEPTED

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

correct output
431

user output
431

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: ACCEPTED

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

correct output
433

user output
433

Test 31

Verdict: ACCEPTED

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

correct output
417

user output
417

Test 32

Verdict: ACCEPTED

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

correct output
409

user output
409

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: ACCEPTED

input
2000
958701282 356460600 224848373 ...

correct output
419252506

user output
419252506

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: ACCEPTED

input
2000
11139167 391337047 538883743 5...

correct output
409258945

user output
409258945

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: ACCEPTED

input
30000
468145962 198730371 27838075 5...

correct output
410179075

user output
410179075

Test 44

Verdict:

input
40000
591414746 75940262 760367934 9...

correct output
414505355

user output
(empty)

Test 45

Verdict:

input
50000
967034923 587586157 185430193 ...

correct output
412022071

user output
(empty)

Test 46

Verdict:

input
60000
238363352 59249203 934941691 8...

correct output
414871380

user output
(empty)

Test 47

Verdict:

input
70000
958701282 356460600 224848373 ...

correct output
413955399

user output
(empty)

Test 48

Verdict:

input
80000
81935403 244103473 837431430 3...

correct output
414719178

user output
(empty)

Test 49

Verdict:

input
90000
937837680 11934037 257096282 9...

correct output
412407588

user output
(empty)

Test 50

Verdict:

input
100000
11139167 391337047 538883743 5...

correct output
413339299

user output
(empty)

Test 51

Verdict:

input
200000
589284011 636562059 767928733 ...

correct output
414309243

user output
(empty)

Test 52

Verdict:

input
200000
447773961 773442531 122815 137...

correct output
413259631

user output
(empty)

Test 53

Verdict:

input
200000
468145962 198730371 27838075 5...

correct output
413293056

user output
(empty)

Test 54

Verdict:

input
200000
591414746 75940262 760367934 9...

correct output
414827553

user output
(empty)

Test 55

Verdict:

input
200000
967034923 587586157 185430193 ...

correct output
412998578

user output
(empty)