Dice Roll Sequence

    1#include <bits/stdc++.h>
    2using namespace std;
    3using ll = long long;
    4const int inf = 1e9;
    5const long long INF = 1e17; //❄️
    6void solve() {
    7    int n; cin >> n;
    8    vector<int> v(n + 1);
    9    for (int i = 1; i <= n; i++) {
    10        cin >> v[i];
    11    }
    12    bool adj[7][7] = {};
    13    for (int i = 1; i <= 6; i++) {
    14        for (int j = 1; j <= 6; j++) {
    15            if (i != j && 7 - i != j) adj[i][j] = 1;
    16        }
    17    }
    18    vector<int> dp(7, inf), ndp(7, inf);
    19    for (int i = 1; i <= 6; i++) {
    20        dp[i] = (v[1] == i ? 0 : 1);
    21    }
    22    for (int i = 2; i <= n; i++) {
    23        fill(ndp.begin(), ndp.end(), inf);
    24        for (int j = 1; j <= 6; j++) {
    25            int best = inf;
    26            for (int k = 1; k <= 6; k++) {
    27                if (adj[j][k]) {
    28                    best = min(best, dp[k]);
    29                } 
    30            }
    31            ndp[j] = best + (v[i] == j ? 0 : 1);
    32        }
    33        swap(dp, ndp);
    34    }
    35    int ans = inf;
    36    for (int i = 1; i <= 6; i++) {
    37        ans = min(ans, dp[i]);
    38    }
    39    cout << ans << '\n';
    40}
    41int main() {
    42    ios::sync_with_stdio(0); cin.tie(0); 
    43    int t; cin >> t;
    44    while (t--) {
    45        solve();
    46    }
    47    return 0;
    48}