CSES - Aalto Competitive Programming 2024 - wk3 - Homework - Results
Submission details
Task:Card game
Sender:hungdojan
Submission time:2024-09-13 18:59:20 +0300
Language:C++ (C++11)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.01 sdetails
#8ACCEPTED0.08 sdetails
#9ACCEPTED0.08 sdetails
#10ACCEPTED0.08 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.10 sdetails
#15ACCEPTED0.08 sdetails

Code

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

#define N 10000001

typedef long long ll;
ll sum[N];
void debug_print(int n) {
  for (int i = 0; i < n; i++) {
    cout << sum[i] << " ";
  }
  cout << "\n";
}

ll get_max(int *arr, int n, int i) {
  if (sum[i]) {
    return sum[i];
  }
  if (i == n - 1) {
    sum[i] = 0;
    return sum[i];
  }

  if (i >= n - 4) {
    sum[i] = arr[i];
    return sum[i];
  }

  for (int j = i + 3; j < n; j++) {
    sum[i] = max(sum[i], get_max(arr, n, j));
  }
  sum[i] += arr[i];
  return sum[i];
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);

  int n;
  cin >> n;
  int arr[n];

  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }

  ll m = 0;
  for (int i = 1; i < n - 1; i++) {
    if (i <= 3) {
      sum[n - i - 1] = arr[n - i - 1];
    } else {
      sum[n - i - 1] =
          arr[n - i - 1] +
          max(
              max(sum[n - i - 1 + 3], sum[n - i - 1 + 4]),
              sum[n - i - 1 + 5]
          );
    }
    if (m < sum[n - i - 1]) {
      m = sum[n - i - 1];
    }
  }

  cout << m << endl;
  return 0;
}

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