CSES - E4590 2018 2 - Results
Submission details
Task:Card game
Sender:natalia
Submission time:2018-09-22 15:00:42 +0300
Language:C++
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.02 sdetails
#2ACCEPTED0.02 sdetails
#3ACCEPTED0.01 sdetails
#4ACCEPTED0.01 sdetails
#5ACCEPTED0.02 sdetails
#6ACCEPTED0.02 sdetails
#7ACCEPTED0.04 sdetails
#8ACCEPTED0.19 sdetails
#9ACCEPTED0.19 sdetails
#10ACCEPTED0.18 sdetails
#11ACCEPTED0.01 sdetails
#12ACCEPTED0.01 sdetails
#13ACCEPTED0.01 sdetails
#14UNKNOWN--details
#15UNKNOWN--details

Compiler report

input/code.cpp: In function 'int main(int, const char**)':
input/code.cpp:12:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < n; i++)
                    ~~^~~
input/code.cpp:42:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 4; i < n; i++){
                    ~~^~~

Code

#include <iostream>
#include <string>
#include <limits.h>

int main(int argc, const char * argv[]) {
    
    unsigned long n;
    std::cin >> n;
    
    int* data = (int*)malloc(n * sizeof(int));
    
    for(int i = 0; i < n; i++)
        std::cin >> data[i];
    
    
    if(n < 3){
        std::cout << 0 << "\n";
        return 0;
    }
    
    if(n == 3){
        std::cout << std::min(data[1], data[1]) << "\n";
        return 0;
    }
    
    int* op_0_0_0_0 = (int*)malloc(n * sizeof(int));
    int* op_1_0_0_0 = (int*)malloc(n * sizeof(int));
    int* op_0_0_1_0 = (int*)malloc(n * sizeof(int));
    int* op_0_1_0_0 = (int*)malloc(n * sizeof(int));
    
    int* op_1_0_0_1 = (int*)malloc(n * sizeof(int));
    int* op_0_0_0_1 = (int*)malloc(n * sizeof(int));
    
    op_0_0_0_0[3] = 0;
    op_1_0_0_0[3] = 0;
    op_0_0_1_0[3] = data[2];
    op_0_1_0_0[3] = data[1];
    op_1_0_0_1[3] = data[3];
    op_0_0_0_1[3] = data[3];
    
    
    for(int i = 4; i < n; i++){
        op_0_0_0_0[i] = op_1_0_0_0[i - 1];
        op_1_0_0_0[i] = op_0_1_0_0[i - 1];
        op_0_0_1_0[i] = std::max(op_1_0_0_1[i - 1], op_0_0_0_1[i - 1]);
        op_0_1_0_0[i] = op_0_0_1_0[i - 1];
        
        op_1_0_0_1[i] = op_0_1_0_0[i - 1] + data[i];
        op_0_0_0_1[i] = std::max(op_0_0_0_0[i - 1], op_1_0_0_0[i - 1]) + data[i];
    }
    
    op_1_0_0_1[n - 1] -= data[n - 1];
    op_0_0_0_1[n - 1] -= data[n - 1];
    
    /*
    std::cout << "op_0_0_0_0\n";
    for(int i = 0; i < n; i++)
        std::cout << op_0_0_0_0[i] << "\t";
    std::cout << "\n";
    
    std::cout << "op_1_0_0_0\n";
    for(int i = 0; i < n; i++)
        std::cout << op_1_0_0_0[i] << "\t";
    std::cout << "\n";
    
    std::cout << "op_0_0_1_0\n";
    for(int i = 0; i < n; i++)
        std::cout << op_0_0_1_0[i] << "\t";
    std::cout << "\n";
    
    std::cout << "op_0_1_0_0\n";
    for(int i = 0; i < n; i++)
        std::cout << op_0_1_0_0[i] << "\t";
    std::cout << "\n";
    
    std::cout << "op_1_0_0_1\n";
    for(int i = 0; i < n; i++)
        std::cout << op_1_0_0_1[i] << "\t";
    std::cout << "\n";
    
    std::cout << "op_0_0_0_1\n";
    for(int i = 0; i < n; i++)
        std::cout << op_0_0_0_1[i] << "\t";
    std::cout << "\n";
    */
    
    int max1 = std::max(op_0_0_0_0[n - 1], op_1_0_0_0[n - 1]);
    int max2 = std::max(op_0_0_1_0[n - 1], op_0_1_0_0[n - 1]);
    int max3 = std::max(op_1_0_0_1[n - 1], op_0_0_0_1[n - 1]);
    
    int result = std::max(max1, std::max(max2, max3));
    
    std::cout << result << "\n";
    
    
    return 0;
}

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)