Coffee shops

#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;
    cin >> first;
    ll preOcc00 = 0;
    ll preOcc01 = first;
    ll preOcc10 = 1000000;
    ll preOcc11 = first;
    for (ll i=1; i<n; i++) {
      ll cur;
      cin >> cur;
      //costs.push_back(cur);
      //cout << preOcc00 << " " << preOcc10 << " " << preOcc01 << " " << preOcc11 << endl;
      ll nextPreOcc00 = preOcc10;
      ll nextPreOcc01 = min(preOcc00, preOcc10) + cur;
      ll nextPreOcc10 = min(preOcc01, preOcc11);
      ll nextPreOcc11 = min(preOcc01, preOcc11) + cur;
      preOcc00 = nextPreOcc00;
      preOcc01 = nextPreOcc01;
      preOcc10 = nextPreOcc10;
      preOcc11 = nextPreOcc11;
    }
    cout << min(preOcc01, preOcc10) << endl;
}

Test 1

Verdict: UNKNOWN

Test 2

Verdict: UNKNOWN

Test 3

Verdict: UNKNOWN

Test 4

Verdict: UNKNOWN

Test 5

Verdict: UNKNOWN

Test 6

Verdict: UNKNOWN

Test 7

Verdict: UNKNOWN

Test 8

Verdict: UNKNOWN

Test 9

Verdict: UNKNOWN

Test 10

Verdict: UNKNOWN

Test 11

Verdict: UNKNOWN

Test 12

Verdict: UNKNOWN

Test 13

Verdict: UNKNOWN

Test 14

Verdict: UNKNOWN

Test 15

Verdict: UNKNOWN

Test 16

Verdict: UNKNOWN

Test 17

Verdict: UNKNOWN

Test 18

Verdict: UNKNOWN