CSES - Aalto Competitive Programming 2024 - wk3 - Mon

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

Submission details
Task:	Wheel of fortune
Sender:	bubu2006
Submission time:	2024-09-16 16:41:06 +0300
Language:	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.01 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.00 s	details
#43	ACCEPTED	0.00 s	details
#44	ACCEPTED	0.00 s	details
#45	ACCEPTED	0.00 s	details
#46	ACCEPTED	0.00 s	details
#47	ACCEPTED	0.00 s	details
#48	ACCEPTED	0.00 s	details
#49	ACCEPTED	0.00 s	details
#50	ACCEPTED	0.00 s	details
#51	ACCEPTED	0.00 s	details
#52	ACCEPTED	0.00 s	details
#53	ACCEPTED	0.00 s	details
#54	ACCEPTED	0.00 s	details
#55	ACCEPTED	0.00 s	details
#56	ACCEPTED	0.00 s	details
#57	ACCEPTED	0.00 s	details
#58	ACCEPTED	0.00 s	details
#59	ACCEPTED	0.00 s	details
#60	ACCEPTED	0.00 s	details
#61	ACCEPTED	0.00 s	details
#62	ACCEPTED	0.00 s	details
#63	ACCEPTED	0.00 s	details
#64	ACCEPTED	0.00 s	details
#65	ACCEPTED	0.00 s	details
#66	ACCEPTED	0.00 s	details
#67	ACCEPTED	0.00 s	details
#68	ACCEPTED	0.00 s	details
#69	ACCEPTED	0.00 s	details
#70	ACCEPTED	0.00 s	details
#71	ACCEPTED	0.00 s	details
#72	ACCEPTED	0.00 s	details
#73	ACCEPTED	0.00 s	details
#74	ACCEPTED	0.00 s	details
#75	ACCEPTED	0.00 s	details
#76	ACCEPTED	0.00 s	details
#77	ACCEPTED	0.00 s	details
#78	ACCEPTED	0.00 s	details
#79	ACCEPTED	0.00 s	details
#80	ACCEPTED	0.00 s	details
#81	ACCEPTED	0.00 s	details
#82	ACCEPTED	0.00 s	details
#83	ACCEPTED	0.00 s	details
#84	ACCEPTED	0.00 s	details
#85	ACCEPTED	0.00 s	details
#86	ACCEPTED	0.01 s	details
#87	ACCEPTED	0.03 s	details
#88	ACCEPTED	0.03 s	details
#89	ACCEPTED	0.03 s	details
#90	ACCEPTED	0.00 s	details
#91	ACCEPTED	0.00 s	details
#92	ACCEPTED	0.00 s	details
#93	ACCEPTED	0.00 s	details
#94	ACCEPTED	0.00 s	details
#95	ACCEPTED	0.00 s	details
#96	ACCEPTED	0.00 s	details
#97	ACCEPTED	0.00 s	details
#98	ACCEPTED	0.01 s	details
#99	ACCEPTED	0.03 s	details
#100	ACCEPTED	0.00 s	details

Code

#include <bits/stdc++.h>
using namespace std;
#define int long long
 
const int N = 1e5 + 5;
const int MOD = 1e9 + 7;
const int INF = 1e18;

int n, c[N];
int dp1[N][3], dp2[N][3], dp3[N][3];
// black, red, green

signed main() {
    cin.tie(0)->sync_with_stdio(0);
 
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> c[i];
    }    

    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < 3; j++) {
            dp1[i][j] = -INF;
            dp2[i][j] = -INF;
            dp3[i][j] = -INF;
        }
    }

    dp1[1][0] = c[1];
    for (int i = 2; i <= n; i++) {
        if (i == n) {
            for (int j = 0; j < 3; j++) {
                if (j == 0) continue;
                for (int jj = 0; jj < 3; jj++) {
                    if (j == jj) continue;
                    if (j == 0) dp1[i][j] = max(dp1[i][j], dp1[i - 1][jj] + c[i]);
                    else if (j == 1) dp1[i][j] = max(dp1[i][j], dp1[i - 1][jj] - c[i]);
                    else dp1[i][j] = max(dp1[i][j], dp1[i - 1][jj]);
                }
            }
        } else {
            for (int j = 0; j < 3; j++) {
                for (int jj = 0; jj < 3; jj++) {
                    if (j == jj) continue;
                    if (j == 0) dp1[i][j] = max(dp1[i][j], dp1[i - 1][jj] + c[i]);
                    else if (j == 1) dp1[i][j] = max(dp1[i][j], dp1[i - 1][jj] - c[i]);
                    else dp1[i][j] = max(dp1[i][j], dp1[i - 1][jj]);
                }
            }
        }
    }

    dp2[1][1] = -c[1];
    for (int i = 2; i <= n; i++) {
        if (i == n) {
            for (int j = 0; j < 3; j++) {
                if (j == 1) continue;
                for (int jj = 0; jj < 3; jj++) {
                    if (j == jj) continue;
                    if (j == 0) dp2[i][j] = max(dp2[i][j], dp2[i - 1][jj] + c[i]);
                    else if (j == 1) dp2[i][j] = max(dp2[i][j], dp2[i - 1][jj] - c[i]);
                    else dp2[i][j] = max(dp2[i][j], dp2[i - 1][jj]);
                }
            }
        } else {
            for (int j = 0; j < 3; j++) {
                for (int jj = 0; jj < 3; jj++) {
                    if (j == jj) continue;
                    if (j == 0) dp2[i][j] = max(dp2[i][j], dp2[i - 1][jj] + c[i]);
                    else if (j == 1) dp2[i][j] = max(dp2[i][j], dp2[i - 1][jj] - c[i]);
                    else dp2[i][j] = max(dp2[i][j], dp2[i - 1][jj]);
                }
            }
        }
    }

    dp3[1][2] = 0;
    for (int i = 2; i <= n; i++) {
        if (i == n) {
            for (int j = 0; j < 3; j++) {
                if (j == 2) continue;
                for (int jj = 0; jj < 3; jj++) {
                    if (j == jj) continue;
                    if (j == 0) dp3[i][j] = max(dp3[i][j], dp3[i - 1][jj] + c[i]);
                    else if (j == 1) dp3[i][j] = max(dp3[i][j], dp3[i - 1][jj] - c[i]);
                    else dp3[i][j] = max(dp3[i][j], dp3[i - 1][jj]);
                }
            }
        } else {
            for (int j = 0; j < 3; j++) {
                for (int jj = 0; jj < 3; jj++) {
                    if (j == jj) continue;
                    if (j == 0) dp3[i][j] = max(dp3[i][j], dp3[i - 1][jj] + c[i]);
                    else if (j == 1) dp3[i][j] = max(dp3[i][j], dp3[i - 1][jj] - c[i]);
                    else dp3[i][j] = max(dp3[i][j], dp3[i - 1][jj]);
                }
            }
        }
    }

    int ans = -INF;
    for (int j = 0; j < 3; j++) {
        ans = max(ans, dp1[n][j]);
        ans = max(ans, dp2[n][j]);
        ans = max(ans, dp3[n][j]);
    }
    cout << ans << '\n';
}

Test details

Test 1

Verdict: ACCEPTED

input
`3 41702 99720 72033` view save

correct output
`58018` view save

user output
`58018` view save

Test 2

Verdict: ACCEPTED

input
`4 41702 99720 72033 93257` view save

correct output
`192977` view save

user output
`192977` view save

Test 3

Verdict: ACCEPTED

input
`5 41702 99720 72033 93257 11` view save

correct output
`192966` view save

user output
`192966` view save

Test 4

Verdict: ACCEPTED

input
`6 41702 99720 72033 93257 11 128...` view save

correct output
`205789` view save

user output
`205789` view save

Test 5

Verdict: ACCEPTED

input
`7 41702 99720 72033 93257 11 128...` view save

correct output
`223199` view save

user output
`223199` view save

Test 6

Verdict: ACCEPTED

input
`10 41702 99720 72033 93257 11 128...` view save

correct output
`329303` view save

user output
`329303` view save

Test 7

Verdict: ACCEPTED

input
`3 43600 18508 2592` view save

correct output
`41008` view save

user output
`41008` view save

Test 8

Verdict: ACCEPTED

input
`4 43600 18508 2592 93155` view save

correct output
`111663` view save

user output
`111663` view save

Test 9

Verdict: ACCEPTED

input
`5 43600 18508 2592 93155 54967` view save

correct output
`134163` view save

user output
`134163` view save

Test 10

Verdict: ACCEPTED

input
`6 43600 18508 2592 93155 54967 9...` view save

correct output
`206437` view save

user output
`206437` view save

Test 11

Verdict: ACCEPTED

input
`7 43600 18508 2592 93155 54967 9...` view save

correct output
`228937` view save

user output
`228937` view save

Test 12

Verdict: ACCEPTED

input
`10 43600 18508 2592 93155 54967 9...` view save

correct output
`286966` view save

user output
`286966` view save

Test 13

Verdict: ACCEPTED

input
`3 55080 7072 70815` view save

correct output
`63743` view save

user output
`63743` view save

Test 14

Verdict: ACCEPTED

input
`4 55080 7072 70815 83996` view save

correct output
`125895` view save

user output
`125895` view save

Test 15

Verdict: ACCEPTED

input
`5 55080 7072 70815 83996 29090` view save

correct output
`132004` view save

user output
`132004` view save

Test 16

Verdict: ACCEPTED

input
`6 55080 7072 70815 83996 29090 1...` view save

correct output
`154985` view save

user output
`154985` view save

Test 17

Verdict: ACCEPTED

input
`7 55080 7072 70815 83996 29090 1...` view save

correct output
`144137` view save

user output
`144137` view save

Test 18

Verdict: ACCEPTED

input
`10 96704 90063 54724 17269 97269 ...` view save

correct output
`389952` view save

user output
`389952` view save

Test 19

Verdict: ACCEPTED

input
`3 96704 90063 54724` view save

correct output
`41980` view save

user output
`41980` view save

Test 20

Verdict: ACCEPTED

input
`4 96704 90063 54724 17269` view save

correct output
`151428` view save

user output
`151428` view save

Test 21

Verdict: ACCEPTED

input
`5 96704 90063 54724 17269 97269` view save

correct output
`170063` view save

user output
`170063` view save

Test 22

Verdict: ACCEPTED

input
`6 96704 90063 54724 17269 97269 ...` view save

correct output
`248697` view save

user output
`248697` view save

Test 23

Verdict: ACCEPTED

input
`7 96704 90063 54724 17269 97269 ...` view save

correct output
`241545` view save

user output
`241545` view save

Test 24

Verdict: ACCEPTED

input
`10 96704 90063 54724 17269 97269 ...` view save

correct output
`389952` view save

user output
`389952` view save

Test 25

Verdict: ACCEPTED

input
`50 41702 99720 72033 93257 11 128...` view save

correct output
`1508857` view save

user output
`1508857` view save

Test 26

Verdict: ACCEPTED

input
`50 43600 18508 2592 93155 54967 9...` view save

correct output
`1261022` view save

user output
`1261022` view save

Test 27

Verdict: ACCEPTED

input
`50 55080 7072 70815 83996 29090 1...` view save

correct output
`1204485` view save

user output
`1204485` view save

Test 28

Verdict: ACCEPTED

input
`50 96704 90063 54724 17269 97269 ...` view save

correct output
`1548881` view save

user output
`1548881` view save

Test 29

Verdict: ACCEPTED

input
`250 41702 99720 72033 93257 11 128...` view save

correct output
`7048856` view save

user output
`7048856` view save

Test 30

Verdict: ACCEPTED

input
`250 43600 18508 2592 93155 54967 9...` view save

correct output
`7355456` view save

user output
`7355456` view save

Test 31

Verdict: ACCEPTED

input
`250 55080 7072 70815 83996 29090 1...` view save

correct output
`6879335` view save

user output
`6879335` view save

Test 32

Verdict: ACCEPTED

input
`250 96704 90063 54724 17269 97269 ...` view save

correct output
`7241700` view save

user output
`7241700` view save

Test 33

Verdict: ACCEPTED

input
`900 41702 99720 72033 93257 11 128...` view save

correct output
`25585084` view save

user output
`25585084` view save

Test 34

Verdict: ACCEPTED

input
`900 43600 18508 2592 93155 54967 9...` view save

correct output
`25559325` view save

user output
`25559325` view save

Test 35

Verdict: ACCEPTED

input
`900 55080 7072 70815 83996 29090 1...` view save

correct output
`25395388` view save

user output
`25395388` view save

Test 36

Verdict: ACCEPTED

input
`900 96704 90063 54724 17269 97269 ...` view save

correct output
`25722421` view save

user output
`25722421` view save

Test 37

Verdict: ACCEPTED

input
`10000 41702 99720 72033 93257 11 128...` view save

correct output
`286456959` view save

user output
`286456959` view save

Test 38

Verdict: ACCEPTED

input
`3 2 3 3` view save

correct output
`1` view save

user output
`1` view save

Test 39

Verdict: ACCEPTED

input
`4 2 4 3 4` view save

correct output
`8` view save

user output
`8` view save

Test 40

Verdict: ACCEPTED

input
`5 3 5 4 5 1` view save

correct output
`9` view save

user output
`9` view save

Test 41

Verdict: ACCEPTED

input
`6 3 6 5 6 1 1` view save

correct output
`13` view save

user output
`13` view save

Test 42

Verdict: ACCEPTED

input
`7 3 7 6 7 1 1 3` view save

correct output
`16` view save

user output
`16` view save

Test 43

Verdict: ACCEPTED

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

correct output
`35` view save

user output
`35` view save

Test 44

Verdict: ACCEPTED

input
`3 2 1 1` view save

correct output
`1` view save

user output
`1` view save

Test 45

Verdict: ACCEPTED

input
`4 2 1 1 4` view save

correct output
`5` view save

user output
`5` view save

Test 46

Verdict: ACCEPTED

input
`5 3 1 1 5 3` view save

correct output
`7` view save

user output
`7` view save

Test 47

Verdict: ACCEPTED

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

correct output
`14` view save

user output
`14` view save

Test 48

Verdict: ACCEPTED

input
`7 4 2 1 7 4 7 4` view save

correct output
`17` view save

user output
`17` view save

Test 49

Verdict: ACCEPTED

input
`10 5 2 1 10 6 10 5 5 5 4` view save

correct output
`31` view save

user output
`31` view save

Test 50

Verdict: ACCEPTED

input
`3 2 3 3` view save

correct output
`1` view save

user output
`1` view save

Test 51

Verdict: ACCEPTED

input
`4 2 4 3 4` view save

correct output
`8` view save

user output
`8` view save

Test 52

Verdict: ACCEPTED

input
`5 3 5 4 5 1` view save

correct output
`9` view save

user output
`9` view save

Test 53

Verdict: ACCEPTED

input
`6 3 6 5 6 1 1` view save

correct output
`13` view save

user output
`13` view save

Test 54

Verdict: ACCEPTED

input
`7 3 7 6 7 1 1 3` view save

correct output
`16` view save

user output
`16` view save

Test 55

Verdict: ACCEPTED

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

correct output
`35` view save

user output
`35` view save

Test 56

Verdict: ACCEPTED

input
`3 2 1 1` view save

correct output
`1` view save

user output
`1` view save

Test 57

Verdict: ACCEPTED

input
`4 2 1 1 4` view save

correct output
`5` view save

user output
`5` view save

Test 58

Verdict: ACCEPTED

input
`5 3 1 1 5 3` view save

correct output
`7` view save

user output
`7` view save

Test 59

Verdict: ACCEPTED

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

correct output
`14` view save

user output
`14` view save

Test 60

Verdict: ACCEPTED

input
`7 4 2 1 7 4 7 4` view save

correct output
`17` view save

user output
`17` view save

Test 61

Verdict: ACCEPTED

input
`10 5 2 1 10 6 10 5 5 5 4` view save

correct output
`31` view save

user output
`31` view save

Test 62

Verdict: ACCEPTED

input
`3 2 1 3` view save

correct output
`2` view save

user output
`2` view save

Test 63

Verdict: ACCEPTED

input
`4 3 1 3 4` view save

correct output
`6` view save

user output
`6` view save

Test 64

Verdict: ACCEPTED

input
`5 3 1 4 5 2` view save

correct output
`7` view save

user output
`7` view save

Test 65

Verdict: ACCEPTED

input
`6 4 1 5 6 2 1` view save

correct output
`11` view save

user output
`11` view save

Test 66

Verdict: ACCEPTED

input
`7 4 1 5 6 3 1 4` view save

correct output
`11` view save

user output
`11` view save

Test 67

Verdict: ACCEPTED

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

correct output
`41` view save

user output
`41` view save

Test 68

Verdict: ACCEPTED

input
`3 3 3 2` view save

correct output
`1` view save

user output
`1` view save

Test 69

Verdict: ACCEPTED

input
`4 4 4 3 1` view save

correct output
`7` view save

user output
`7` view save

Test 70

Verdict: ACCEPTED

input
`5 5 5 3 1 5` view save

correct output
`9` view save

user output
`9` view save

Test 71

Verdict: ACCEPTED

input
`6 6 6 4 2 6 6` view save

correct output
`16` view save

user output
`16` view save

Test 72

Verdict: ACCEPTED

input
`7 7 7 4 2 7 6 6` view save

correct output
`18` view save

user output
`18` view save

Test 73

Verdict: ACCEPTED

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

correct output
`41` view save

user output
`41` view save

Test 74

Verdict: ACCEPTED

input
`50 21 50 37 47 1 7 16 50 8 12 5 2...` view save

correct output
`764` view save

user output
`764` view save

Test 75

Verdict: ACCEPTED

input
`50 22 10 2 47 28 48 22 25 22 17 1...` view save

correct output
`641` view save

user output
`641` view save

Test 76

Verdict: ACCEPTED

input
`50 28 4 36 42 15 7 26 29 45 22 45...` view save

correct output
`610` view save

user output
`610` view save

Test 77

Verdict: ACCEPTED

input
`50 49 46 28 9 49 43 36 31 35 30 1...` view save

correct output
`783` view save

user output
`783` view save

Test 78

Verdict: ACCEPTED

input
`250 105 250 181 234 1 33 76 250 37...` view save

correct output
`17676` view save

user output
`17676` view save

Test 79

Verdict: ACCEPTED

input
`250 109 47 7 233 138 237 109 122 1...` view save

correct output
`18449` view save

user output
`18449` view save

Test 80

Verdict: ACCEPTED

input
`250 138 18 178 210 73 31 128 143 2...` view save

correct output
`17250` view save

user output
`17250` view save

Test 81

Verdict: ACCEPTED

input
`250 242 226 137 44 244 214 179 153...` view save

correct output
`18157` view save

user output
`18157` view save

Test 82

Verdict: ACCEPTED

input
`900 376 898 649 840 1 116 273 900 ...` view save

correct output
`230450` view save

user output
`230450` view save

Test 83

Verdict: ACCEPTED

input
`900 393 167 24 839 495 853 392 437...` view save

correct output
`230221` view save

user output
`230221` view save

Test 84

Verdict: ACCEPTED

input
`900 496 64 638 756 262 110 460 513...` view save

correct output
`228745` view save

user output
`228745` view save

Test 85

Verdict: ACCEPTED

input
`900 871 811 493 156 876 771 644 54...` view save

correct output
`231686` view save

user output
`231686` view save

Test 86

Verdict: ACCEPTED

input
`10000 4171 9972 7204 9326 2 1282 302...` view save

correct output
`28647603` view save

user output
`28647603` view save

Test 87

Verdict: ACCEPTED

input
`100000 41703 99721 72034 93258 12 128...` view save

correct output
`2838931183` view save

user output
`2838931183` view save

Test 88

Verdict: ACCEPTED

input
`100000 43601 18509 2593 93156 54968 9...` view save

correct output
`2842573127` view save

user output
`2842573127` view save

Test 89

Verdict: ACCEPTED

input
`100000 55081 7073 70816 83997 29091 1...` view save

correct output
`2839271262` view save

user output
`2839271262` view save

Test 90

Verdict: ACCEPTED

input
`4 100000 100000 100000 100000` view save

correct output
`200000` view save

user output
`200000` view save

Test 91

Verdict: ACCEPTED

input
`5 100000 100000 100000 100000 10...` view save

correct output
`100000` view save

user output
`100000` view save

Test 92

Verdict: ACCEPTED

input
`6 100000 100000 100000 100000 10...` view save

correct output
`300000` view save

user output
`300000` view save

Test 93

Verdict: ACCEPTED

input
`7 100000 100000 100000 100000 10...` view save

correct output
`200000` view save

user output
`200000` view save

Test 94

Verdict: ACCEPTED

input
`10 100000 100000 100000 100000 10...` view save

correct output
`500000` view save

user output
`500000` view save

Test 95

Verdict: ACCEPTED

input
`50 100000 100000 100000 100000 10...` view save

correct output
`2500000` view save

user output
`2500000` view save

Test 96

Verdict: ACCEPTED

input
`250 100000 100000 100000 100000 10...` view save

correct output
`12500000` view save

user output
`12500000` view save

Test 97

Verdict: ACCEPTED

input
`900 100000 100000 100000 100000 10...` view save

correct output
`45000000` view save

user output
`45000000` view save

Test 98

Verdict: ACCEPTED

input
`10000 100000 100000 100000 100000 10...` view save

correct output
`500000000` view save

user output
`500000000` view save

Test 99

Verdict: ACCEPTED

input
`100000 100000 100000 100000 100000 10...` view save

correct output
`5000000000` view save

user output
`5000000000` view save

Test 100

Verdict: ACCEPTED

input
`3 100000 100000 100000` view save

correct output
`0` view save

user output
`0` view save

Aalto Competitive Programming 2024 - wk3 - Mon

Wheel of fortune

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