CSES - Aalto Competitive Programming 2024 - wk3 - Mon

CSES - Aalto Competitive Programming 2024 - wk3 - Mon - Results

Submission details
Task:	Particle accelerator
Sender:	AleksandrPolitov
Submission time:	2024-09-16 17:23:37 +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.00 s	details
#33	ACCEPTED	0.00 s	details
#34	ACCEPTED	0.00 s	details
#35	ACCEPTED	0.00 s	details
#36	ACCEPTED	0.00 s	details
#37	ACCEPTED	0.00 s	details
#38	ACCEPTED	0.00 s	details
#39	ACCEPTED	0.00 s	details
#40	ACCEPTED	0.00 s	details
#41	ACCEPTED	0.00 s	details
#42	ACCEPTED	0.01 s	details
#43	ACCEPTED	0.01 s	details
#44	ACCEPTED	0.01 s	details
#45	ACCEPTED	0.01 s	details
#46	ACCEPTED	0.01 s	details
#47	ACCEPTED	0.01 s	details
#48	ACCEPTED	0.01 s	details
#49	ACCEPTED	0.01 s	details
#50	ACCEPTED	0.01 s	details
#51	ACCEPTED	0.01 s	details
#52	ACCEPTED	0.01 s	details
#53	ACCEPTED	0.01 s	details
#54	ACCEPTED	0.01 s	details
#55	ACCEPTED	0.01 s	details
#56	ACCEPTED	0.01 s	details
#57	ACCEPTED	0.01 s	details
#58	ACCEPTED	0.01 s	details
#59	ACCEPTED	0.01 s	details
#60	ACCEPTED	0.01 s	details
#61	ACCEPTED	0.01 s	details
#62	ACCEPTED	0.01 s	details
#63	ACCEPTED	0.01 s	details
#64	ACCEPTED	0.01 s	details
#65	ACCEPTED	0.01 s	details
#66	ACCEPTED	0.01 s	details
#67	ACCEPTED	0.01 s	details
#68	ACCEPTED	0.01 s	details
#69	ACCEPTED	0.01 s	details
#70	ACCEPTED	0.01 s	details
#71	ACCEPTED	0.01 s	details
#72	ACCEPTED	0.06 s	details
#73	ACCEPTED	0.06 s	details
#74	ACCEPTED	0.06 s	details
#75	ACCEPTED	0.06 s	details
#76	ACCEPTED	0.06 s	details
#77	ACCEPTED	0.06 s	details
#78	ACCEPTED	0.06 s	details
#79	ACCEPTED	0.06 s	details
#80	ACCEPTED	0.06 s	details
#81	ACCEPTED	0.06 s	details
#82	ACCEPTED	0.06 s	details
#83	ACCEPTED	0.06 s	details
#84	ACCEPTED	0.06 s	details
#85	ACCEPTED	0.06 s	details
#86	ACCEPTED	0.06 s	details
#87	ACCEPTED	0.06 s	details
#88	ACCEPTED	0.06 s	details
#89	ACCEPTED	0.06 s	details
#90	ACCEPTED	0.06 s	details
#91	ACCEPTED	0.06 s	details

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;

const int N=550;
ll v[N];
ll dp[N][N];
ll pref[N];

int solve() {
    int n; std::cin >> n;
    for (int i = 1; i <= n; i++) {
        std::cin >> v[i];
    }

    pref[0]=pref[1]=0;
    for (int i = 1; i <= n; i++) {
        pref[i+1]=pref[i]+v[i];
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            dp[i][j]=LLINF;
        }
    }

    for (int i = 1; i <= n; i++) {
        dp[i][i]=0;
    }

    

    for (int i = 1; i <= n-1; i++) {
        dp[i][i+1]=v[i]*v[i+1]-min(v[i], v[i+1])*min(v[i], v[i+1]);
    }



    for (int len = 2; len <= n; len++) {
        for (int st = 1; st <= n-len; st++) {
            //std::cout << st << " " << st+len << std::endl;
            //std::cout << len << ": " << std::endl;
            for (int j = 0; j <= len-1; j++) {
                //std::cout << "lol: " << std::endl;
                //std::cout << "x: " <<st << " " << st+j << std::endl;
                //std::cout << "y: " << st+j+1 << " " << st+len << std::endl;
                ll x=pref[st+j+1]-pref[st];
                //dp[st][st+j];
                ll y=pref[st+len+1]-pref[st+j+1];
                dp[st][st+len]=min(dp[st][st+len], dp[st][st+j]+dp[st+j+1][st+len] + x*y-min(x,y)*min(x,y));
                
                //if(j==0) x=v[st];
                //else x=dp[st][st+j];
                
                //if(j==len-1) y=v[st+j+1];
                //else y=dp[st+j+1][st+len];
                //std::cout << "actual: " << x << " " << y << std::endl;
                //ll y=dp[st+j+1][st+len];
                //std::cout << x << " " << y << std::endl;
                //std::cout << x << " " << y << std::endl;
                

                //dp[st][st+len]=min(dp[st][st+len], dp[st][st+j]+dp[st+j+1][st+len] + x*y-min(x,y)*min(x,y));
                
                //dp[st][st+len]=min(dp[st][st+len], dp[st][st+j]*dp[st+j+1][st+len]-min(dp[st][mid], dp[mid][st+len])*min(dp[st][mid], dp[mid+1][st+len]));
                //std::cout << j << std::endl;
            }
            //for (int mid = st+1; mid <= st+len-1; mid++) {
                //dp[st][st+len]=min(dp[st][st+len], dp[st][mid]*dp[mid+1][st+len]-min(dp[st][mid], dp[mid][st+len])*min(dp[st][mid], dp[mid+1][st+len]));
            //}
            //std::cout << st << " " << st+len << std::endl;
        }
    }
    //std::cout << dp[1][3] << std::endl;

    std::cout << dp[1][n] << 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 373` view save

correct output
`0` view save

user output
`0` view save

Test 2

Verdict: ACCEPTED

input
`1 10` view save

correct output
`0` view save

user output
`0` view save

Test 3

Verdict: ACCEPTED

input
`2 1 7` view save

correct output
`6` view save

user output
`6` view save

Test 4

Verdict: ACCEPTED

input
`2 798 810` view save

correct output
`9576` view save

user output
`9576` view save

Test 5

Verdict: ACCEPTED

input
`3 2 7 9` view save

correct output
`10` view save

user output
`10` view save

Test 6

Verdict: ACCEPTED

input
`3 43371 770816 582162` view save

correct output
`166626155145` view save

user output
`166626155145` view save

Test 7

Verdict: ACCEPTED

input
`3 255995 678296 258159` view save

correct output
`282656505483` view save

user output
`282656505483` view save

Test 8

Verdict: ACCEPTED

input
`4 2 4 5 10` view save

correct output
`19` view save

user output
`19` view save

Test 9

Verdict: ACCEPTED

input
`4 10 1 10 5` view save

correct output
`78` view save

user output
`78` view save

Test 10

Verdict: ACCEPTED

input
`4 4 10 10 8` view save

correct output
`96` view save

user output
`96` view save

Test 11

Verdict: ACCEPTED

input
`4 635350 99359 612245 308607` view save

correct output
`283721279422` view save

user output
`283721279422` view save

Test 12

Verdict: ACCEPTED

input
`5 8 9 7 9 6` view save

correct output
`167` view save

user output
`167` view save

Test 13

Verdict: ACCEPTED

input
`5 8 10 1 2 4` view save

correct output
`97` view save

user output
`97` view save

Test 14

Verdict: ACCEPTED

input
`5 25933 931751 549787 947945 435...` view save

correct output
`642593396167` view save

user output
`642593396167` view save

Test 15

Verdict: ACCEPTED

input
`5 709 840 291 122 511` view save

correct output
`731471` view save

user output
`731471` view save

Test 16

Verdict: ACCEPTED

input
`5 6 2 10 9 8` view save

correct output
`49` view save

user output
`49` view save

Test 17

Verdict: ACCEPTED

input
`5 870929 831516 206766 363819 91...` view save

correct output
`581247680937` view save

user output
`581247680937` view save

Test 18

Verdict: ACCEPTED

input
`5 4 3 9 1 1` view save

correct output
`45` view save

user output
`45` view save

Test 19

Verdict: ACCEPTED

input
`5 780095 319045 438508 978444 72...` view save

correct output
`492410128596` view save

user output
`492410128596` view save

Test 20

Verdict: ACCEPTED

input
`5 969 240 870 378 531` view save

correct output
`955854` view save

user output
`955854` view save

Test 21

Verdict: ACCEPTED

input
`5 501988 499243 495885 7545 1338...` view save

correct output
`284384673000` view save

user output
`284384673000` view save

Test 22

Verdict: ACCEPTED

input
`10 8 9 7 9 6 9 5 7 7 4` view save

correct output
`347` view save

user output
`347` view save

Test 23

Verdict: ACCEPTED

input
`10 8 10 1 2 4 10 2 3 1 4` view save

correct output
`194` view save

user output
`194` view save

Test 24

Verdict: ACCEPTED

input
`10 25933 931751 549787 947945 435...` view save

correct output
`1909421677160` view save

user output
`1909421677160` view save

Test 25

Verdict: ACCEPTED

input
`10 709 840 291 122 511 570 893 43...` view save

correct output
`2139925` view save

user output
`2139925` view save

Test 26

Verdict: ACCEPTED

input
`10 6 2 10 9 8 7 7 6 3 2` view save

correct output
`339` view save

user output
`339` view save

Test 27

Verdict: ACCEPTED

input
`10 870929 831516 206766 363819 91...` view save

correct output
`2999634317613` view save

user output
`2999634317613` view save

Test 28

Verdict: ACCEPTED

input
`10 4 3 9 1 1 4 2 10 6 1` view save

correct output
`194` view save

user output
`194` view save

Test 29

Verdict: ACCEPTED

input
`10 780095 319045 438508 978444 72...` view save

correct output
`3083316036349` view save

user output
`3083316036349` view save

Test 30

Verdict: ACCEPTED

input
`10 969 240 870 378 531 817 233 42...` view save

correct output
`1139241` view save

user output
`1139241` view save

Test 31

Verdict: ACCEPTED

input
`10 501988 499243 495885 7545 1338...` view save

correct output
`554211450134` view save

user output
`554211450134` view save

Test 32

Verdict: ACCEPTED

input
`100 8 9 7 9 6 9 5 7 7 4 5 3 9 1 10...` view save

correct output
`6396` view save

user output
`6396` view save

Test 33

Verdict: ACCEPTED

input
`100 8 10 1 2 4 10 2 3 1 4 2 4 4 7 ...` view save

correct output
`3542` view save

user output
`3542` view save

Test 34

Verdict: ACCEPTED

input
`100 25933 931751 549787 947945 435...` view save

correct output
`45440863225859` view save

user output
`45440863225859` view save

Test 35

Verdict: ACCEPTED

input
`100 709 840 291 122 511 570 893 43...` view save

correct output
`45958697` view save

user output
`45958697` view save

Test 36

Verdict: ACCEPTED

input
`100 6 2 10 9 8 7 7 6 3 2 10 3 1 7 ...` view save

correct output
`3828` view save

user output
`3828` view save

Test 37

Verdict: ACCEPTED

input
`100 870929 831516 206766 363819 91...` view save

correct output
`38360827705542` view save

user output
`38360827705542` view save

Test 38

Verdict: ACCEPTED

input
`100 4 3 9 1 1 4 2 10 6 1 6 7 5 6 4...` view save

correct output
`5967` view save

user output
`5967` view save

Test 39

Verdict: ACCEPTED

input
`100 780095 319045 438508 978444 72...` view save

correct output
`42394120248428` view save

user output
`42394120248428` view save

Test 40

Verdict: ACCEPTED

input
`100 969 240 870 378 531 817 233 42...` view save

correct output
`43869305` view save

user output
`43869305` view save

Test 41

Verdict: ACCEPTED

input
`100 501988 499243 495885 7545 1338...` view save

correct output
`51929619520205` view save

user output
`51929619520205` view save

Test 42

Verdict: ACCEPTED

input
`200 21 495 634 444 749 832 499 584...` view save

correct output
`94150203` view save

user output
`94150203` view save

Test 43

Verdict: ACCEPTED

input
`200 19480 664871 463323 194160 725...` view save

correct output
`109172696765966` view save

user output
`109172696765966` view save

Test 44

Verdict: ACCEPTED

input
`200 740217 873584 263375 86454 533...` view save

correct output
`91609970771011` view save

user output
`91609970771011` view save

Test 45

Verdict: ACCEPTED

input
`200 3 9 9 9 10 2 10 8 5 8 7 7 8 8 ...` view save

correct output
`12594` view save

user output
`12594` view save

Test 46

Verdict: ACCEPTED

input
`200 8 7 9 4 1 2 4 3 10 3 6 4 4 4 6...` view save

correct output
`11434` view save

user output
`11434` view save

Test 47

Verdict: ACCEPTED

input
`200 2 6 1 2 4 9 3 10 6 1 4 9 4 8 2...` view save

correct output
`10973` view save

user output
`10973` view save

Test 48

Verdict: ACCEPTED

input
`200 523282 55700 550826 308687 456...` view save

correct output
`92752119769026` view save

user output
`92752119769026` view save

Test 49

Verdict: ACCEPTED

input
`200 530707 844425 191564 889066 67...` view save

correct output
`99915887908116` view save

user output
`99915887908116` view save

Test 50

Verdict: ACCEPTED

input
`200 506 433 879 245 182 909 853 20...` view save

correct output
`100894725` view save

user output
`100894725` view save

Test 51

Verdict: ACCEPTED

input
`200 761422 412836 246994 715471 13...` view save

correct output
`91724968917854` view save

user output
`91724968917854` view save

Test 52

Verdict: ACCEPTED

input
`200 9 10 9 10 9 7 1 7 7 10 4 7 6 1...` view save

correct output
`9260` view save

user output
`9260` view save

Test 53

Verdict: ACCEPTED

input
`200 3 7 8 1 1 10 3 7 1 2 4 9 7 4 4...` view save

correct output
`13944` view save

user output
`13944` view save

Test 54

Verdict: ACCEPTED

input
`200 5 8 5 7 9 8 2 9 4 9 3 3 7 1 3 ...` view save

correct output
`15692` view save

user output
`15692` view save

Test 55

Verdict: ACCEPTED

input
`200 10 2 8 8 3 6 3 5 7 2 2 1 4 3 7...` view save

correct output
`12255` view save

user output
`12255` view save

Test 56

Verdict: ACCEPTED

input
`200 700 53 1000 318 221 984 362 51...` view save

correct output
`126087673` view save

user output
`126087673` view save

Test 57

Verdict: ACCEPTED

input
`200 6 5 3 1 2 2 5 2 2 3 7 7 5 2 6 ...` view save

correct output
`11199` view save

user output
`11199` view save

Test 58

Verdict: ACCEPTED

input
`200 6 3 8 6 8 1 9 2 2 3 3 8 5 9 8 ...` view save

correct output
`13071` view save

user output
`13071` view save

Test 59

Verdict: ACCEPTED

input
`200 814768 915127 735563 468064 86...` view save

correct output
`98792356012408` view save

user output
`98792356012408` view save

Test 60

Verdict: ACCEPTED

input
`200 562 289 125 165 398 398 782 31...` view save

correct output
`94162582` view save

user output
`94162582` view save

Test 61

Verdict: ACCEPTED

input
`200 3 4 1 10 8 5 5 4 6 4 8 9 9 9 8...` view save

correct output
`11090` view save

user output
`11090` view save

Test 62

Verdict: ACCEPTED

input
`200 4 3 7 5 2 7 10 8 4 7 10 10 3 7...` view save

correct output
`11655` view save

user output
`11655` view save

Test 63

Verdict: ACCEPTED

input
`200 958322 322406 770487 611574 98...` view save

correct output
`81490639470393` view save

user output
`81490639470393` view save

Test 64

Verdict: ACCEPTED

input
`200 373 422 556 331 956 754 737 73...` view save

correct output
`88581726` view save

user output
`88581726` view save

Test 65

Verdict: ACCEPTED

input
`200 5 7 5 10 3 2 9 8 2 7 1 9 10 9 ...` view save

correct output
`13948` view save

user output
`13948` view save

Test 66

Verdict: ACCEPTED

input
`200 780277 423471 92725 418110 633...` view save

correct output
`136105358146422` view save

user output
`136105358146422` view save

Test 67

Verdict: ACCEPTED

input
`200 308420 676676 231540 246163 27...` view save

correct output
`104365913260031` view save

user output
`104365913260031` view save

Test 68

Verdict: ACCEPTED

input
`200 602 717 953 825 144 864 808 92...` view save

correct output
`82761699` view save

user output
`82761699` view save

Test 69

Verdict: ACCEPTED

input
`200 465 525 193 757 582 310 621 85...` view save

correct output
`101145827` view save

user output
`101145827` view save

Test 70

Verdict: ACCEPTED

input
`200 9 10 10 9 8 5 7 10 7 6 3 2 4 2...` view save

correct output
`9822` view save

user output
`9822` view save

Test 71

Verdict: ACCEPTED

input
`200 798 810 821 367 123 829 603 60...` view save

correct output
`111853493` view save

user output
`111853493` view save

Test 72

Verdict: ACCEPTED

input
`500 21 495 634 444 749 832 499 584...` view save

correct output
`320652082` view save

user output
`320652082` view save

Test 73

Verdict: ACCEPTED

input
`500 19480 664871 463323 194160 725...` view save

correct output
`255800779186420` view save

user output
`255800779186420` view save

Test 74

Verdict: ACCEPTED

input
`500 740217 873584 263375 86454 533...` view save

correct output
`282774432682654` view save

user output
`282774432682654` view save

Test 75

Verdict: ACCEPTED

input
`500 3 9 9 9 10 2 10 8 5 8 7 7 8 8 ...` view save

correct output
`30727` view save

user output
`30727` view save

Test 76

Verdict: ACCEPTED

input
`500 8 7 9 4 1 2 4 3 10 3 6 4 4 4 6...` view save

correct output
`28929` view save

user output
`28929` view save

Test 77

Verdict: ACCEPTED

input
`500 2 6 1 2 4 9 3 10 6 1 4 9 4 8 2...` view save

correct output
`39800` view save

user output
`39800` view save

Test 78

Verdict: ACCEPTED

input
`500 523282 55700 550826 308687 456...` view save

correct output
`367458083034844` view save

user output
`367458083034844` view save

Test 79

Verdict: ACCEPTED

input
`500 530707 844425 191564 889066 67...` view save

correct output
`276567810216590` view save

user output
`276567810216590` view save

Test 80

Verdict: ACCEPTED

input
`500 506 433 879 245 182 909 853 20...` view save

correct output
`357098617` view save

user output
`357098617` view save

Test 81

Verdict: ACCEPTED

input
`500 761422 412836 246994 715471 13...` view save

correct output
`345118298392748` view save

user output
`345118298392748` view save

Test 82

Verdict: ACCEPTED

input
`500 9 10 9 10 9 7 1 7 7 10 4 7 6 1...` view save

correct output
`37385` view save

user output
`37385` view save

Test 83

Verdict: ACCEPTED

input
`500 3 7 8 1 1 10 3 7 1 2 4 9 7 4 4...` view save

correct output
`45054` view save

user output
`45054` view save

Test 84

Verdict: ACCEPTED

input
`500 5 8 5 7 9 8 2 9 4 9 3 3 7 1 3 ...` view save

correct output
`48480` view save

user output
`48480` view save

Test 85

Verdict: ACCEPTED

input
`500 10 2 8 8 3 6 3 5 7 2 2 1 4 3 7...` view save

correct output
`35867` view save

user output
`35867` view save

Test 86

Verdict: ACCEPTED

input
`500 700 53 1000 318 221 984 362 51...` view save

correct output
`344007358` view save

user output
`344007358` view save

Test 87

Verdict: ACCEPTED

input
`500 6 5 3 1 2 2 5 2 2 3 7 7 5 2 6 ...` view save

correct output
`32937` view save

user output
`32937` view save

Test 88

Verdict: ACCEPTED

input
`500 6 3 8 6 8 1 9 2 2 3 3 8 5 9 8 ...` view save

correct output
`33083` view save

user output
`33083` view save

Test 89

Verdict: ACCEPTED

input
`500 814768 915127 735563 468064 86...` view save

correct output
`352570895811941` view save

user output
`352570895811941` view save

Test 90

Verdict: ACCEPTED

input
`500 562 289 125 165 398 398 782 31...` view save

correct output
`349500395` view save

user output
`349500395` view save

Test 91

Verdict: ACCEPTED

input
`500 3 4 1 10 8 5 5 4 6 4 8 9 9 9 8...` view save

correct output
`35153` view save

user output
`35153` view save

Aalto Competitive Programming 2024 - wk3 - Mon

Particle accelerator

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

Test 56

Test 57

Test 58

Test 59

Test 60

Test 61

Test 62

Test 63

Test 64

Test 65

Test 66

Test 67

Test 68

Test 69

Test 70

Test 71

Test 72

Test 73

Test 74

Test 75

Test 76