Submission details
Task:Card game
Sender:aalto26ch_012
Submission time:2026-09-16 07:39:11 +0300
Language:C++ (C++20)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.01 sdetails
#7ACCEPTED0.02 sdetails
#8ACCEPTED0.20 sdetails
#9ACCEPTED0.20 sdetails
#10ACCEPTED0.20 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.32 sdetails
#15ACCEPTED0.19 sdetails

Code

#include <iostream>
#include <vector>

using std::cout;
using std::endl;
#define DEBUG std::cout<<"LINE"<<__LINE__;
#define IN(A) int A;std::cin>>A;

template<typename T> T printV(std::vector<T> V) {
    for (int i=0;i<V.size-1;i++) {
        std::cout<<V[i]<<" ";
    }
    std::cout<<V[V.size-1];
    std::cout<<endl;
}
int64_t max3(int64_t a,int64_t b,int64_t c) {
    return std::max(a,std::max(b,c));
}


struct compute {
    std::vector<int> data;
    std::vector<int64_t> memo;
    bool start() {
        IN(n);
        data.assign(n,0);
        memo.assign(n,0);
        readV(n);
        int last=data.size()-2;
        for (int i=0;i<last;i++) {
            solve(i);
        }
        int64_t value=0;
        for (int i=last;i>=0&&i>=last-3;i--) {
            value=std::max(memo[i],value);
        }
        std::cout<<value;
        return true;
    }

    int64_t solve(int n) {
        if (n<0) {
            return 0;
        }
        if (memo[n]) {
            return memo[n];
        }
        auto var=data[n+1];
        memo[n]=max3(solve(n-5)+var,solve(n-4)+var,solve(n-3)+var);
        return memo[n];
    }
    void readV(int n) {
          for (int i=0;i<n;i++) std::cin>>data[i];

    }

};

int main() {
    compute comp;
    comp.start();


}

Test details

Test 1

Verdict: ACCEPTED

input
5
9 4 1 6 6

correct output
6

user output
6

Test 2

Verdict: ACCEPTED

input
6
5 6 2 4 10 1

correct output
16

user output
16

Test 3

Verdict: ACCEPTED

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

correct output
26

user output
26

Test 4

Verdict: ACCEPTED

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

correct output
243

user output
243

Test 5

Verdict: ACCEPTED

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

correct output
2230

user output
2230

Test 6

Verdict: ACCEPTED

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

correct output
22363

user output
22363

Test 7

Verdict: ACCEPTED

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

correct output
226636

user output
226636

Test 8

Verdict: ACCEPTED

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

correct output
2259395

user output
2259395

Test 9

Verdict: ACCEPTED

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

correct output
2260761

user output
2260761

Test 10

Verdict: ACCEPTED

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

correct output
2260407

user output
2260407

Test 11

Verdict: ACCEPTED

input
3
87 3 123

correct output
3

user output
3

Test 12

Verdict: ACCEPTED

input
2
175 95

correct output
0

user output
0

Test 13

Verdict: ACCEPTED

input
1
42

correct output
0

user output
0

Test 14

Verdict: ACCEPTED

input
1000000
1000 1000 1000 1000 1000 1000 ...

correct output
333333000

user output
333333000

Test 15

Verdict: ACCEPTED

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

correct output
333333

user output
333333