Submission details
Task:Card game
Sender:rikachu
Submission time:2025-09-15 15:02:37 +0300
Language:C++ (C++11)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.01 sdetails
#6ACCEPTED0.30 sdetails
#70.39 sdetails
#80.54 sdetails
#90.54 sdetails
#100.53 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#140.64 sdetails
#150.53 sdetails

Code

#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i, a, b) for (int i = a; i < b; ++i)
#define REPI(i, a, b) for (int i = a; i <= b; ++i)
#define BR "\n"

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int, int> pi;

int main() {
  // freopen("card_game.txt", "r", stdin);
  int n;
  cin >> n;

  int cards[n] = {};
  REP(i, 0, n) { cin >> cards[i]; }

  int points[n * n] = {};
  points[0] = 0;
  points[1] = 0;

  REP(i, 2, n) {
    if (i - 3 >= 0) {
      points[i] =
          max(points[i - 3] + cards[i - 1], max(points[i - 2], points[i - 1]));
    } else {
      points[i] = cards[i - 1];
    }
  }

  // REP(i, 0, n) { cout << points[i] << " "; }
  // cout << BR;
  cout << points[n - 1] << BR;

  return EXIT_SUCCESS;
}

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:

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: 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:

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)