| Task: | Card game |
| Sender: | ariadna.roga |
| Submission time: | 2025-09-12 18:56:18 +0300 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | WRONG ANSWER |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | details |
| #2 | ACCEPTED | 0.00 s | details |
| #3 | WRONG ANSWER | 0.00 s | details |
| #4 | WRONG ANSWER | 0.00 s | details |
| #5 | WRONG ANSWER | 0.00 s | details |
| #6 | WRONG ANSWER | 0.01 s | details |
| #7 | WRONG ANSWER | 0.02 s | details |
| #8 | WRONG ANSWER | 0.20 s | details |
| #9 | WRONG ANSWER | 0.20 s | details |
| #10 | WRONG ANSWER | 0.20 s | details |
| #11 | ACCEPTED | 0.00 s | details |
| #12 | ACCEPTED | 0.00 s | details |
| #13 | ACCEPTED | 0.00 s | details |
| #14 | ACCEPTED | 0.31 s | details |
| #15 | ACCEPTED | 0.19 s | details |
Code
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> cards(n);
vector<long long> dp(n, 0);
vector<long long> last(n);
for (long long i = 0; i < n; ++i) {
cin >> cards[i];
if (i < 2) {
dp[i] = 0;
}
else if (i == 2) {
dp[i] = cards[1];
last[i] = 1;
}
else if (last[i-1] < (i - 3)) { // If it does not overlap with the last one selected
dp[i] = dp[i - 1] + cards[i - 1];
last[i] = i - 1;
}
else { // If it overlaps with the last one selected
if (cards[i-1] <= cards[last[i - 1]]) // It is not worth it to take it
{
dp[i] = dp[i - 1];
last[i] = last[i - 1];
}
else { // It is worth it to take it
dp[i] = dp[i - 1] - cards[last[i - 1]] + cards[i-1];
last[i] = i;
}
}
}
cout << dp[n - 1] << endl;
}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: WRONG ANSWER
| input |
|---|
| 10 8 9 10 2 7 1 10 10 1 4 |
| correct output |
|---|
| 26 |
| user output |
|---|
| 24 |
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 |
|---|
| 185 |
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 |
|---|
| 1594 |
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 |
|---|
| 16672 |
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 |
|---|
| 166460 |
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 |
|---|
| 1670928 |
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 |
|---|
| 1668584 |
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 |
|---|
| 1670079 |
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 |
