Submission details
Task:Card game
Sender:Aurelien
Submission time:2025-09-12 15:48:03 +0300
Language:C++ (C++17)
Status:READY
Result:
Test results
testverdicttime
#10.00 sdetails
#20.00 sdetails
#30.00 sdetails
#40.00 sdetails
#50.00 sdetails
#60.07 sdetails
#7--details
#8--details
#9--details
#10--details
#110.00 sdetails
#120.00 sdetails
#13ACCEPTED0.00 sdetails
#14--details
#15--details

Code

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const ll N = 1000000;

ll game[N];

ll best = 0;
bool computed[N];
ll value[N];

ll card_game(ll n, ll first) {
    if(computed[first]) return value[first];
    ll count = 0;

    for(ll i = first; i<n-1; i++) {
        if(computed[i]) {
            count = max(count, value[i]);
        } else {
            // cout << n << " " << first << endl;
            // cout << "We found game: ";
            // cout << game[i+1] << endl;
            count = max(count, (card_game(n, i+4) + game[i]));
        }
    }
    //cout << endl;
    computed[first] = true;
    value[first] = count;

    return count;
}


int main() {
    ll n;
    cin >> n;

    for(ll i = 0; i<n; i++) {
        cin >> game[i];
    }
    // for(ll i = 0; i<n; i++) {
    //     cout << game[i] << " ";
    // }
    // cout << endl;

    ll b = card_game(n, 0);
    cout << b << endl;
}

Test details

Test 1

Verdict:

input
5
9 4 1 6 6

correct output
6

user output
9

Test 2

Verdict:

input
6
5 6 2 4 10 1

correct output
16

user output
15

Test 3

Verdict:

input
10
8 9 10 2 7 1 10 10 1 4

correct output
26

user output
20

Test 4

Verdict:

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

correct output
243

user output
196

Test 5

Verdict:

input
1000
10 7 5 6 5 2 5 3 2 2 1 6 8 7 8...

correct output
2230

user output
1752

Test 6

Verdict:

input
10000
9 1 8 2 6 5 1 3 3 10 6 3 9 3 1...

correct output
22363

user output
17579

Test 7

Verdict:

input
100000
5 5 4 6 8 7 9 6 3 2 5 8 7 3 5 ...

correct output
226636

user output
(empty)

Test 8

Verdict:

input
1000000
5 8 5 7 9 1 9 10 3 6 1 8 3 9 7...

correct output
2259395

user output
(empty)

Test 9

Verdict:

input
1000000
4 5 3 5 4 3 6 7 10 6 3 9 7 9 1...

correct output
2260761

user output
(empty)

Test 10

Verdict:

input
1000000
10 3 6 7 7 10 4 4 5 2 9 4 6 10...

correct output
2260407

user output
(empty)

Test 11

Verdict:

input
3
87 3 123

correct output
3

user output
87

Test 12

Verdict:

input
2
175 95

correct output
0

user output
175

Test 13

Verdict: ACCEPTED

input
1
42

correct output
0

user output
0

Test 14

Verdict:

input
1000000
1000 1000 1000 1000 1000 1000 ...

correct output
333333000

user output
(empty)

Test 15

Verdict:

input
1000000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
333333

user output
(empty)