Task: | Card game |
Sender: | kakuro |
Submission time: | 2018-09-22 15:51:53 +0300 |
Language: | C++ |
Status: | READY |
Result: | ACCEPTED |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.01 s | details |
#2 | ACCEPTED | 0.02 s | details |
#3 | ACCEPTED | 0.02 s | details |
#4 | ACCEPTED | 0.01 s | details |
#5 | ACCEPTED | 0.01 s | details |
#6 | ACCEPTED | 0.02 s | details |
#7 | ACCEPTED | 0.05 s | details |
#8 | ACCEPTED | 0.16 s | details |
#9 | ACCEPTED | 0.16 s | details |
#10 | ACCEPTED | 0.17 s | details |
#11 | ACCEPTED | 0.01 s | details |
#12 | ACCEPTED | 0.01 s | details |
#13 | ACCEPTED | 0.01 s | details |
#14 | UNKNOWN | -- | details |
#15 | UNKNOWN | -- | details |
Code
#include <iostream> #include <deque> #include <algorithm> typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef std::string str; using namespace std; int main() { ll n; cin >> n; //deque<ll> costs; ll first, second, third; if (n<=2) { cout << 0 << endl; return 0; } cin >> first >> second >> third; ll open0 = second; ll open1 = 0; ll open2 = 0; ll lastCard = third; for (ll i=3; i<n; i++) { ll cur; cin >> cur; ll nextOpen0 = open2 + lastCard; ll nextOpen1 = max(open0, max(open1, open2)); ll nextOpen2 = max(open1, open2); open0 = nextOpen0; open1 = nextOpen1; open2 = nextOpen2; lastCard = cur; } cout << max(open0, max(open1, open2)) << 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: 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: UNKNOWN
input |
---|
1000000 1000 1000 1000 1000 1000 1000 ... |
correct output |
---|
333333000 |
user output |
---|
(not available) |
Test 15
Verdict: UNKNOWN
input |
---|
1000000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
333333 |
user output |
---|
(not available) |