Task: | Card game |
Sender: | bubu2006 |
Submission time: | 2024-09-11 20:43:36 +0300 |
Language: | C++ (C++20) |
Status: | READY |
Result: | WRONG ANSWER |
test | verdict | time | |
---|---|---|---|
#1 | WRONG ANSWER | 0.01 s | details |
#2 | ACCEPTED | 0.01 s | details |
#3 | ACCEPTED | 0.01 s | details |
#4 | ACCEPTED | 0.01 s | details |
#5 | ACCEPTED | 0.01 s | details |
#6 | WRONG ANSWER | 0.01 s | details |
#7 | ACCEPTED | 0.02 s | details |
#8 | ACCEPTED | 0.09 s | details |
#9 | ACCEPTED | 0.09 s | details |
#10 | WRONG ANSWER | 0.08 s | details |
#11 | ACCEPTED | 0.01 s | details |
#12 | WRONG ANSWER | 0.01 s | details |
#13 | WRONG ANSWER | 0.01 s | details |
#14 | ACCEPTED | 0.10 s | details |
#15 | ACCEPTED | 0.08 s | details |
Code
#include <bits/stdc++.h> using namespace std; #define int long long const int N = 1e6 + 5; const int MOD = 1e9 + 7; int n; int x[N]; int dp[N]; signed main() { cin.tie(0)->sync_with_stdio(0); cin >> n; for (int i = 1; i <= n; i++) cin >> x[i]; memset(dp, -1, sizeof dp); dp[0] = 0; for (int i = 3; i <= n; i++) { // take dp[i] = max(dp[i], dp[i - 3] + x[i - 1]); // don't take dp[i] = max(dp[i], dp[i - 1]); } cout << dp[n] << '\n'; }
Test details
Test 1
Verdict: WRONG ANSWER
input |
---|
5 9 4 1 6 6 |
correct output |
---|
6 |
user output |
---|
5 |
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: WRONG ANSWER
input |
---|
10000 9 1 8 2 6 5 1 3 3 10 6 3 9 3 1... |
correct output |
---|
22363 |
user output |
---|
22362 |
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: WRONG ANSWER
input |
---|
1000000 10 3 6 7 7 10 4 4 5 2 9 4 6 10... |
correct output |
---|
2260407 |
user output |
---|
2260406 |
Test 11
Verdict: ACCEPTED
input |
---|
3 87 3 123 |
correct output |
---|
3 |
user output |
---|
3 |
Test 12
Verdict: WRONG ANSWER
input |
---|
2 175 95 |
correct output |
---|
0 |
user output |
---|
-1 |
Test 13
Verdict: WRONG ANSWER
input |
---|
1 42 |
correct output |
---|
0 |
user output |
---|
-1 |
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 |