Coffee shops

#include <algorithm>
#include <iostream>
#include <vector>

using std::cin;
using std::cout;
using std::endl;
using std::ios;
using std::min;
using std::vector;


int main() {
    ios::sync_with_stdio(false);
    uint32_t n;
    cin >> n;

    vector<uint32_t> cost_built(n, 0);
    vector<uint32_t> cost_not_built(n + 1, 0);
    cost_not_built[0] = -1;
    cost_not_built[1] = -1;

    cin >> cost_built[0];

    for (uint32_t i = 1; i < n; i++) {
        uint32_t cost;
        cin >> cost;

        cost_built[i] = cost + min(
            cost_built[i - 1], min(cost_not_built[i], cost_not_built[i - 1]));
        cost_not_built[i + 1] = cost_built[i - 1];
    }

    cout << min(cost_built[n - 1], cost_not_built[n]) << endl;

    return 0;
}

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