| Task: | Card game |
| Sender: | usvafe |
| Submission time: | 2025-09-11 15:36:30 +0300 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | RUNTIME ERROR |
| 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 | RUNTIME ERROR | 0.00 s | details |
| #7 | RUNTIME ERROR | 0.01 s | details |
| #8 | RUNTIME ERROR | 0.01 s | details |
| #9 | RUNTIME ERROR | 0.01 s | details |
| #10 | RUNTIME ERROR | 0.01 s | details |
| #11 | ACCEPTED | 0.00 s | details |
| #12 | ACCEPTED | 0.00 s | details |
| #13 | ACCEPTED | 0.00 s | details |
| #14 | RUNTIME ERROR | 0.01 s | details |
| #15 | RUNTIME ERROR | 0.01 s | details |
Code
#include <bits/stdc++.h>
using namespace std;
int main() {
const int D = 5;
constexpr int N = 1000 + D;
vector<int> a(N);
vector<int> d(N);
int n;
cin >> n;
for (int i=D; i<n+D; i++) cin >> a[i];
d[1+D] = a[1+D];
for (int i=D+2; i<n+D; i++) {
d[i] = max(d[i-1], a[i] + d[i-3]);
}
cout << d[n+D-2];
}
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: RUNTIME ERROR
| input |
|---|
| 10000 9 1 8 2 6 5 1 3 3 10 6 3 9 3 1... |
| correct output |
|---|
| 22363 |
| user output |
|---|
| (empty) |
Error:
malloc(): corrupted top size
Test 7
Verdict: RUNTIME ERROR
| 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: RUNTIME ERROR
| 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: RUNTIME ERROR
| 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: RUNTIME ERROR
| 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: RUNTIME ERROR
| input |
|---|
| 1000000 1000 1000 1000 1000 1000 1000 ... |
| correct output |
|---|
| 333333000 |
| user output |
|---|
| (empty) |
Test 15
Verdict: RUNTIME ERROR
| input |
|---|
| 1000000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 333333 |
| user output |
|---|
| (empty) |