Submission #3045870

---

Source Code Expand

#include <algorithm>
#include <array>
#include <bitset>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#include <cassert>
using namespace std;

struct TSolver
{
    int N;
    vector<int> Colors;

    bool Setup()
    {
        if (!(cin >> N)) {
            return false;
        }
        Colors.resize(N);
        for (int i = 0; i < N; ++i) {
            cin >> Colors[i];
        }
        return true;
    }

    void Solve()
    {
        int result = 0;
        for (int l = 0; l < N; ) {
            int r = l;
            while (Colors[r] == Colors[l] && r < N) {
                ++r;
            }
            result += (r - l) / 2;
            l = r;
        }
        cout << result << endl;
    }

    void TearDown()
    {
        cout.flush();
    }
};

int main()
{
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    TSolver solver;
    while (solver.Setup()) {
        solver.Solve();
        solver.TearDown();
    }

    return 0;
}

Submission Info

Judge Result