| Task: | Card game |
| Sender: | Aurelien |
| Submission time: | 2025-09-12 18:05:22 +0300 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | WRONG ANSWER |
| test | verdict | time | |
|---|---|---|---|
| #1 | WRONG ANSWER | 0.00 s | details |
| #2 | WRONG ANSWER | 0.00 s | details |
| #3 | WRONG ANSWER | 0.01 s | details |
| #4 | WRONG ANSWER | 0.01 s | details |
| #5 | WRONG ANSWER | 0.00 s | details |
| #6 | WRONG ANSWER | 0.01 s | details |
| #7 | WRONG ANSWER | 0.03 s | details |
| #8 | WRONG ANSWER | 0.30 s | details |
| #9 | WRONG ANSWER | 0.30 s | details |
| #10 | WRONG ANSWER | 0.30 s | details |
| #11 | WRONG ANSWER | 0.00 s | details |
| #12 | WRONG ANSWER | 0.00 s | details |
| #13 | WRONG ANSWER | 0.00 s | details |
| #14 | WRONG ANSWER | 0.43 s | details |
| #15 | WRONG ANSWER | 0.30 s | details |
Code
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1000000;
ll game[N];
ll value[N] = {0};
ll best = 0;
int main() {
ll n;
cin >> n;
for(ll i = 0; i<n; i++) {
cin >> game[i];
}
for (ll i = n-2; i>0; i--) {
value[i] = value[i+3] + game[i];
value[i+4] = best;
for(ll j = 1; j<=4 && i+j<n ; j++) {
value[i] = max(value[i], value[j+i]);
}
best = max(best, value[i]);
}
for(ll i = 0; i<n; i++) {
cout << value[i] << " ";
}
cout << endl;
cout << best << endl;
}Test details
Test 1
Verdict: WRONG ANSWER
| input |
|---|
| 5 9 4 1 6 6 |
| correct output |
|---|
| 6 |
| user output |
|---|
| 0 6 6 6 0 6 |
Test 2
Verdict: WRONG ANSWER
| input |
|---|
| 6 5 6 2 4 10 1 |
| correct output |
|---|
| 16 |
| user output |
|---|
| 0 16 10 10 10 10 16 |
Test 3
Verdict: WRONG ANSWER
| input |
|---|
| 10 8 9 10 2 7 1 10 10 1 4 |
| correct output |
|---|
| 26 |
| user output |
|---|
| 0 26 20 17 17 20 17 17 10 10 26 |
Test 4
Verdict: WRONG ANSWER
| input |
|---|
| 100 1 8 8 5 7 10 9 4 8 10 6 3 8 7 ... |
| correct output |
|---|
| 243 |
| user output |
|---|
| 0 243 243 239 235 243 239 235 ... Truncated |
Test 5
Verdict: WRONG ANSWER
| input |
|---|
| 1000 10 7 5 6 5 2 5 3 2 2 1 6 8 7 8... |
| correct output |
|---|
| 2230 |
| user output |
|---|
| 0 2230 2226 2226 2223 2226 222... Truncated |
Test 6
Verdict: WRONG ANSWER
| input |
|---|
| 10000 9 1 8 2 6 5 1 3 3 10 6 3 9 3 1... |
| correct output |
|---|
| 22363 |
| user output |
|---|
| 0 22363 22363 22356 22356 2236... Truncated |
Test 7
Verdict: WRONG ANSWER
| input |
|---|
| 100000 5 5 4 6 8 7 9 6 3 2 5 8 7 3 5 ... |
| correct output |
|---|
| 226636 |
| user output |
|---|
| 0 226636 226632 226632 226631 ... Truncated |
Test 8
Verdict: WRONG ANSWER
| input |
|---|
| 1000000 5 8 5 7 9 1 9 10 3 6 1 8 3 9 7... |
| correct output |
|---|
| 2259395 |
| user output |
|---|
| 0 2259411 2259395 2259395 2259... Truncated |
Test 9
Verdict: WRONG ANSWER
| input |
|---|
| 1000000 4 5 3 5 4 3 6 7 10 6 3 9 7 9 1... |
| correct output |
|---|
| 2260761 |
| user output |
|---|
| 0 2260766 2260761 2260761 2260... Truncated |
Test 10
Verdict: WRONG ANSWER
| input |
|---|
| 1000000 10 3 6 7 7 10 4 4 5 2 9 4 6 10... |
| correct output |
|---|
| 2260407 |
| user output |
|---|
| 0 2260420 2260412 2260412 2260... Truncated |
Test 11
Verdict: WRONG ANSWER
| input |
|---|
| 3 87 3 123 |
| correct output |
|---|
| 3 |
| user output |
|---|
| 0 3 0 3 |
Test 12
Verdict: WRONG ANSWER
| input |
|---|
| 2 175 95 |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 0 0 |
Test 13
Verdict: WRONG ANSWER
| input |
|---|
| 1 42 |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 0 |
Test 14
Verdict: WRONG ANSWER
| input |
|---|
| 1000000 1000 1000 1000 1000 1000 1000 ... |
| correct output |
|---|
| 333333000 |
| user output |
|---|
| 0 333335000 333333000 33333300... Truncated |
Test 15
Verdict: WRONG ANSWER
| input |
|---|
| 1000000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 333333 |
| user output |
|---|
| 0 333335 333333 333333 333333 ... Truncated |
