DMOJ · acc3p1

Diverse Arrays

This C++ solution uses two pointers for DMOJ acc3p1 Diverse Arrays. Read the reasoning, inspect the code, or try your own test case below.

acc3p1Graphs & treesTwo pointersC++24 lines
Solution078of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Two pointers

Diverse Arrays defines a diverse subarray as one with at least K distinct values and asks for the count; the code uses the matching sliding window complement.

Graphs & trees

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

Open official problem ↗View exact source file ↗
Implementation

Problem_1_Diverse_Arrays.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    const int inf = 1e9;
    const long long INF = 1e17; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int n, k; cin >> n >> k;
        vector<int> a(n);
        for (int i = 0; i < n; i++) cin >> a[i];
        vector<int> f(n + 1);
        int cnt = 0;
        ll ans = 0;
        for (int l = 0, r = 0; l < n; l++) {
            while (r < n && cnt < k) {
                if (f[a[r]]++ == 0) cnt++;
                r++;
            } 
            if (cnt == k) ans += n - r + 1;
            if (--f[a[l]] == 0) cnt--;
        }
        cout << ans << '\n';
        return 0;
    }
        

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Full trace, comparison & stress testing ↗
StatusReady
Output
No run yet.
Diagnostics
No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.