CSES - Aalto Competitive Programming 2026 - wk2 - Mon

Submission details
Task:	Establish equality
Sender:	aalto26bm_042
Submission time:	2026-09-07 17:12:13 +0300
Language:	C++ (C++20)
Status:	READY
Result:	ACCEPTED

Test results
test	verdict	time
#1	ACCEPTED	0.00 s	details
#2	ACCEPTED	0.00 s	details
#3	ACCEPTED	0.00 s	details
#4	ACCEPTED	0.00 s	details
#5	ACCEPTED	0.00 s	details
#6	ACCEPTED	0.00 s	details
#7	ACCEPTED	0.00 s	details
#8	ACCEPTED	0.00 s	details
#9	ACCEPTED	0.00 s	details
#10	ACCEPTED	0.00 s	details
#11	ACCEPTED	0.00 s	details
#12	ACCEPTED	0.00 s	details
#13	ACCEPTED	0.00 s	details
#14	ACCEPTED	0.00 s	details
#15	ACCEPTED	0.00 s	details
#16	ACCEPTED	0.00 s	details
#17	ACCEPTED	0.00 s	details
#18	ACCEPTED	0.00 s	details
#19	ACCEPTED	0.00 s	details
#20	ACCEPTED	0.00 s	details
#21	ACCEPTED	0.00 s	details
#22	ACCEPTED	0.00 s	details
#23	ACCEPTED	0.00 s	details
#24	ACCEPTED	0.00 s	details
#25	ACCEPTED	0.00 s	details
#26	ACCEPTED	0.00 s	details
#27	ACCEPTED	0.00 s	details
#28	ACCEPTED	0.00 s	details
#29	ACCEPTED	0.00 s	details
#30	ACCEPTED	0.00 s	details
#31	ACCEPTED	0.00 s	details
#32	ACCEPTED	0.01 s	details
#33	ACCEPTED	0.01 s	details
#34	ACCEPTED	0.01 s	details
#35	ACCEPTED	0.01 s	details
#36	ACCEPTED	0.01 s	details
#37	ACCEPTED	0.01 s	details
#38	ACCEPTED	0.01 s	details
#39	ACCEPTED	0.01 s	details
#40	ACCEPTED	0.01 s	details
#41	ACCEPTED	0.01 s	details
#42	ACCEPTED	0.02 s	details
#43	ACCEPTED	0.02 s	details
#44	ACCEPTED	0.03 s	details
#45	ACCEPTED	0.04 s	details
#46	ACCEPTED	0.04 s	details
#47	ACCEPTED	0.05 s	details
#48	ACCEPTED	0.06 s	details
#49	ACCEPTED	0.07 s	details
#50	ACCEPTED	0.07 s	details
#51	ACCEPTED	0.14 s	details
#52	ACCEPTED	0.14 s	details
#53	ACCEPTED	0.14 s	details
#54	ACCEPTED	0.14 s	details
#55	ACCEPTED	0.14 s	details

Code

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define die(x) return cout << x << endl, 0
#define all(o) o.begin(), o.end()
#define endl '\n'
#define IOS ios::sync_with_stdio(0), cin.tie(0)
#define FILE freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define SZ(x) ((int)(x).size())
typedef long double ld;
typedef long long ll;
int gcd(int x,int y){ return (!y ? x : gcd(y, x%y)); }
int to_int(string sconvert){stringstream geek(sconvert);int xconvert = 0; geek >> xconvert; return xconvert;}
const int MAXN=200000+30,MAX_LOG=40,INF=1e18+10,MOD=1e9+7;
const double PI = acos(-1);
int mod(int x) { return (x % MOD + MOD) % MOD; }
int power(int x,int y){
    if(y==0)return 1;
    int c=power(x,y/2);
    c=(c*c)%MOD;
    if(y%2)c=(c*x)%MOD;
    return c;
}

int n;
int a[MAXN];

// vector<int> g[MAXN];
// int visited[MAXN];
// int color[MAXN];
// int max_color = 1;
// int is_impossible = 0;

// vector<pair<int,int>> edges;
// int dfs(int v, int root){
//     visited[v]=1;

//     int ones = 0;
//     int twos = 0;
//     int is_leaf = 1;
//     for(int u:g[v]){
//         // cout <<v<<"pp pp"<<u<<" " <<visited[u]<<endl;
//         if(!visited[u]){
//             is_leaf = 0;
//             int c = dfs(u, root);
//             if (c == 1) ones++;
//             else twos ++;
//         }
//         else{
//             int c = color [u];
//             // cout <<c<<endl;
//             if (c != 0){
//                 if (c == 1) ones++;
//                 else twos ++; 
//             }
//         }
//     }

//     if(is_leaf){
//         // cout<<v<<" kk"<<g[v].size()<<endl;

//         color[v] = 1;
//         return 1;
//     }

//     // cout<<ones<<" "<<twos<<"--- "<<v<<endl;
//     if (ones>0 && twos >0){
//         is_impossible=1;
//         return 1;
//     }
//     else if (ones>=0){
//         color[v]=2;
//         return 2;
//     }
//     else{
//         color[v]=1;
//         return 1;
//     }
// }

int is_possible(int target){
    int total_spare = 0;
    for (int i = 0; i < n; i++){
        if(a[i] < target) total_spare = total_spare - (target - a[i]);
        else if (a[i]> target) total_spare = total_spare + (a[i] - target) /2;
        // cout<<total_spare<<" ";
    }
    // cout<<target<<endl;
    if (total_spare >=0)return 1;
    return 0;
}

int MAIN(){
    cin>>n;
    int max_amount = 0;
    for (int i = 0; i < n; i++){
        cin>>a[i];
        max_amount = max(max_amount, a[i]);
    }
    int low = 0; 
    int high = max_amount;
    for (int i = 0; i < 100; i++){
        int target = (low + high) / 2;
        // cout <<target<<" "<<is_possible(target)<<endl;
        if (is_possible(target)){
            low = target;
        }
        else high = target;
        
    }
    if(is_possible(high))cout<<high;
    else cout<<low;
 

    
    return 0;
}
int32_t main(){
    IOS;
    int t=1;
    // cin>>t;
    while(t--)MAIN();
    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
`1 4` view save

correct output
`4` view save

user output
`4` view save

Test 2

Verdict: ACCEPTED

input
`2 4 2` view save

correct output
`2` view save

user output
`2` view save

Test 3

Verdict: ACCEPTED

input
`2 6 0` view save

correct output
`2` view save

user output
`2` view save

Test 4

Verdict: ACCEPTED

input
`3 10 9 6` view save

correct output
`7` view save

user output
`7` view save

Test 5

Verdict: ACCEPTED

input
`6 2 0 9 9 2 4` view save

correct output
`3` view save

user output
`3` view save

Test 6

Verdict: ACCEPTED

input
`10 4 10 7 10 0 1 3 10 1 2` view save

correct output
`3` view save

user output
`3` view save

Test 7

Verdict: ACCEPTED

input
`10 4 2 0 10 6 10 4 5 4 3` view save

correct output
`4` view save

user output
`4` view save

Test 8

Verdict: ACCEPTED

input
`10 6 0 7 9 3 1 5 6 9 4` view save

correct output
`3` view save

user output
`3` view save

Test 9

Verdict: ACCEPTED

input
`10 10 9 6 1 10 9 7 6 7 6` view save

correct output
`6` view save

user output
`6` view save

Test 10

Verdict: ACCEPTED

input
`10 2 0 9 9 2 4 10 10 5 0` view save

correct output
`3` view save

user output
`3` view save

Test 11

Verdict: ACCEPTED

input
`10 1 0 0 7 5 2 7 10 4 1` view save

correct output
`2` view save

user output
`2` view save

Test 12

Verdict: ACCEPTED

input
`10 1 4 8 9 2 0 5 7 0 3` view save

correct output
`2` view save

user output
`2` view save

Test 13

Verdict: ACCEPTED

input
`10 8 6 2 9 9 9 10 1 10 8` view save

correct output
`6` view save

user output
`6` view save

Test 14

Verdict: ACCEPTED

input
`10 5 10 8 7 9 4 0 1 3 2` view save

correct output
`3` view save

user output
`3` view save

Test 15

Verdict: ACCEPTED

input
`10 9 8 1 6 0 1 3 9 3 10` view save

correct output
`3` view save

user output
`3` view save

Test 16

Verdict: ACCEPTED

input
`100 417 998 721 933 0 128 302 1000...` view save

correct output
`402` view save

user output
`402` view save

Test 17

Verdict: ACCEPTED

input
`100 436 185 25 932 550 948 435 485...` view save

correct output
`402` view save

user output
`402` view save

Test 18

Verdict: ACCEPTED

input
`100 551 70 708 840 291 121 511 569...` view save

correct output
`391` view save

user output
`391` view save

Test 19

Verdict: ACCEPTED

input
`100 967 901 547 172 973 856 715 60...` view save

correct output
`395` view save

user output
`395` view save

Test 20

Verdict: ACCEPTED

input
`100 222 55 871 832 206 364 919 980...` view save

correct output
`418` view save

user output
`418` view save

Test 21

Verdict: ACCEPTED

input
`100 180 68 19 665 463 194 725 927 ...` view save

correct output
`401` view save

user output
`401` view save

Test 22

Verdict: ACCEPTED

input
`100 154 446 740 874 263 86 534 724...` view save

correct output
`409` view save

user output
`409` view save

Test 23

Verdict: ACCEPTED

input
`100 778 607 237 860 825 893 966 17...` view save

correct output
`419` view save

user output
`419` view save

Test 24

Verdict: ACCEPTED

input
`100 514 922 773 659 871 366 8 149 ...` view save

correct output
`410` view save

user output
`410` view save

Test 25

Verdict: ACCEPTED

input
`100 849 814 179 591 54 111 361 819...` view save

correct output
`381` view save

user output
`381` view save

Test 26

Verdict: ACCEPTED

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

correct output
`446` view save

user output
`446` view save

Test 27

Verdict: ACCEPTED

input
`100 208 702 482 731 420 638 860 78...` view save

correct output
`431` view save

user output
`431` view save

Test 28

Verdict: ACCEPTED

input
`100 517 669 947 185 766 782 282 57...` view save

correct output
`417` view save

user output
`417` view save

Test 29

Verdict: ACCEPTED

input
`100 960 294 700 52 1000 317 220 98...` view save

correct output
`483` view save

user output
`483` view save

Test 30

Verdict: ACCEPTED

input
`100 870 696 582 433 279 98 186 181...` view save

correct output
`433` view save

user output
`433` view save

Test 31

Verdict: ACCEPTED

input
`1000 549 593 715 845 603 858 545 84...` view save

correct output
`417` view save

user output
`417` view save

Test 32

Verdict: ACCEPTED

input
`1000 417 998 721 933 0 128 302 1000...` view save

correct output
`409` view save

user output
`409` view save

Test 33

Verdict: ACCEPTED

input
`1000 436 185 25 932 550 948 435 485...` view save

correct output
`409` view save

user output
`409` view save

Test 34

Verdict: ACCEPTED

input
`1000 551 70 708 840 291 121 511 569...` view save

correct output
`416` view save

user output
`416` view save

Test 35

Verdict: ACCEPTED

input
`1000 967 901 547 172 973 856 715 60...` view save

correct output
`420` view save

user output
`420` view save

Test 36

Verdict: ACCEPTED

input
`2000 238363352 59249203 934941691 8...` view save

correct output
`408637955` view save

user output
`408637955` view save

Test 37

Verdict: ACCEPTED

input
`2000 958701282 356460600 224848373 ...` view save

correct output
`419252506` view save

user output
`419252506` view save

Test 38

Verdict: ACCEPTED

input
`2000 81935403 244103473 837431430 3...` view save

correct output
`416082617` view save

user output
`416082617` view save

Test 39

Verdict: ACCEPTED

input
`2000 937837680 11934037 257096282 9...` view save

correct output
`417515719` view save

user output
`417515719` view save

Test 40

Verdict: ACCEPTED

input
`2000 11139167 391337047 538883743 5...` view save

correct output
`409258945` view save

user output
`409258945` view save

Test 41

Verdict: ACCEPTED

input
`10000 589284011 636562059 767928733 ...` view save

correct output
`413957321` view save

user output
`413957321` view save

Test 42

Verdict: ACCEPTED

input
`20000 447773961 773442531 122815 137...` view save

correct output
`414852078` view save

user output
`414852078` view save

Test 43

Verdict: ACCEPTED

input
`30000 468145962 198730371 27838075 5...` view save

correct output
`410179075` view save

user output
`410179075` view save

Test 44

Verdict: ACCEPTED

input
`40000 591414746 75940262 760367934 9...` view save

correct output
`414505355` view save

user output
`414505355` view save

Test 45

Verdict: ACCEPTED

input
`50000 967034923 587586157 185430193 ...` view save

correct output
`412022071` view save

user output
`412022071` view save

Test 46

Verdict: ACCEPTED

input
`60000 238363352 59249203 934941691 8...` view save

correct output
`414871380` view save

user output
`414871380` view save

Test 47

Verdict: ACCEPTED

input
`70000 958701282 356460600 224848373 ...` view save

correct output
`413955399` view save

user output
`413955399` view save

Test 48

Verdict: ACCEPTED

input
`80000 81935403 244103473 837431430 3...` view save

correct output
`414719178` view save

user output
`414719178` view save

Test 49

Verdict: ACCEPTED

input
`90000 937837680 11934037 257096282 9...` view save

correct output
`412407588` view save

user output
`412407588` view save

Test 50

Verdict: ACCEPTED

input
`100000 11139167 391337047 538883743 5...` view save

correct output
`413339299` view save

user output
`413339299` view save

Test 51

Verdict: ACCEPTED

input
`200000 589284011 636562059 767928733 ...` view save

correct output
`414309243` view save

user output
`414309243` view save

Test 52

Verdict: ACCEPTED

input
`200000 447773961 773442531 122815 137...` view save

correct output
`413259631` view save

user output
`413259631` view save

Test 53

Verdict: ACCEPTED

input
`200000 468145962 198730371 27838075 5...` view save

correct output
`413293056` view save

user output
`413293056` view save

Test 54

Verdict: ACCEPTED

input
`200000 591414746 75940262 760367934 9...` view save

correct output
`414827553` view save

user output
`414827553` view save

Test 55

Verdict: ACCEPTED

input
`200000 967034923 587586157 185430193 ...` view save

correct output
`412998578` view save

user output
`412998578` view save

Aalto Competitive Programming 2026 - wk2 - Mon

Establish equality

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Test 40

Test 41

Test 42

Test 43

Test 44

Test 45

Test 46

Test 47

Test 48

Test 49

Test 50

Test 51

Test 52

Test 53

Test 54

Test 55

Tasks

Submissions (aalto26bm_042)