Another Contest 3 Problem 1 - Diverse Arrays

View as PDF

Submit solution

Points: 7
Time limit: 1.0s
Memory limit: 256M

Problem type

Call an array of integers diverse if it has length at least 1 and it has at least K distinct integers.

Given an array of N integers and a parameter K, compute the number of subarrays that are diverse.


1 \le K \le N \le 10^6

1 \le a_i \le N

Input Specification

The first line contains two positive integers, N and K.

Each of the next N lines contains a positive integer, a_i. These integers in order comprise the array.

Output Specification

Output the number of subarrays that are diverse.

Sample Input

4 2

Sample Output



  • -1
    IanHu  commented on Dec. 24, 2018, 8:19 p.m. edited

    Hate TLE :-(

  • 14
    Plasmatic  commented on Nov. 27, 2018, 12:06 a.m.

    Noting that there's another problem that is worth 12p that is passable using the exact same code

    THICC '17 P5