Call an array of integers diverse if it has length at least 1 and it has at least distinct integers.
Given an array of integers and a parameter , compute the number of subarrays that are diverse.
Constraints
Input Specification
The first line contains two positive integers, and .
Each of the next lines contains a positive integer, . These integers in order comprise the array.
Output Specification
Output the number of subarrays that are diverse.
Sample Input
4 2
1
2
2
2
Sample Output
3
Comments
Don't use Python - nobody has passed yet.
PY3: https://dmoj.ca/problem/acc3p1/submissions/?status=AC&language=PY3
PY2: https://dmoj.ca/problem/acc3p1/submissions/?status=AC&language=PY2
Only PyPy 3 works (rarely).
So {1, 2, 2, 2} has subarrays with 2 or more elements:
{1, 2}
{2, 2}
{2, 2}
{1, 2, 2}
{1, 2, 2, 2}
but only {1, 2} is an array of distinct integers.... Am I missing something here? is distinct the wrong adjective or is the sample case wrong?
You are looking for subarrays with at least distinct integers
{1, 2}, {1, 2, 2}, {1, 2, 2, 2} all work because they contain integers 1 and 2
Makes sense, thanks.
Hate TLE :-(
same :)
Same :-(