Taulukko

input/code.cpp: In function 'int main()':
input/code.cpp:42:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(nn.size() <= k)
     ~~~~~~~~~~^~~~
input/code.cpp:61:7: warning: unused variable 'lastWasted' [-Wunused-variable]
  bool lastWasted = false;
       ^~~~~~~~~~
input/code.cpp:28:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &k);
  ~~~~~^~~~~~~~~~~~~~~~~
input/code.cpp:35:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",(nums + i));
   ~~~~~^~~~~~~~~~~~~~~~~

#include <iostream>
#include <stdio.h>
#include <unordered_set>
#include <map>
#include <string>
#define USETI unordered_set<int>
#define CNT(c, val) c.count(val)
#define NSRT(c, val) c.insert(val)
#define PRTI(i) printf("%d", i)
#define PRT(s) printf(s)
#define LBRK printf("\n")
#define PAUSE getchar();getchar()
#define FORS(num, val, n) for(int num = val; num < n; num++)
#define FOR(num, n) for(int num = 0; num < n; num++)
#define SITUATION LBRK; PRT("dNumbers = "); PRTI(dNumbers); LBRK; PRT("Start and end = "); PRTI(start); PRT(" "); PRTI(end); LBRK; PRT("Ans = "); PRTI(ans); LBRK; PAUSE; PAUSE

typedef long long ll;

using namespace std;

int main() {

	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int n, k;
	ll ans = 0;
	scanf("%d %d", &n, &k);

	int* nums = (int*)malloc(4*n);
	USETI nn;

	FOR(i, n)
	{ 
		scanf("%d",(nums + i));
		NSRT(nn, *(nums + i));
		
		//if(nn.size() <= k)
		//{ ans++; }
	}

	if(nn.size() <= k)
	{
		ll f = n;
		ans = f * ((f + 1) / 2.0);
		printf("%lld", ans);
		free(nums);
		return 0;
	}

	nn.clear();
	map<int, int> m;

	int start = 0;
	int end = -1;
	int* endP = nums + end;
	int* startP = nums + start;
	int dNumbers = 0;

	//ll waste = 0;
	bool lastWasted = false;
	bool wasteFlag = false;
	int endPrev;

	while (dNumbers <= k)
	{
		end++;
		endP++;
		if (m[*endP] == 0)
		{ dNumbers++; }

		//LBRK;
		//PRT("add number "); PRTI(*(nums + end));
		//LBRK;

		m[*endP] += 1;
	}

	ans += (ll)(end - start);

	//SITUATION;

	while (start < n - k)
	{
		//LBRK;
		//PRT("remove number "); PRTI(*(nums + start));
		//LBRK;
		m[*startP] -= 1;
		if (m[*startP] == 0)
		{
			dNumbers--;
			wasteFlag = false;
		}
		start++;
		if (start >= n - k)
		{
			break;
		}
		startP++;

		if(!wasteFlag)
		{
			endPrev = end;
			end++;
			endP++;

			if (end >= n)
			{
				end = n;
				endP = nums + n;
			}

			else
			{
				//LBRK;
				//PRT("add number "); PRTI(*(nums + end));
				//LBRK;
				if (m[*endP] == 0)
				{
					dNumbers++;
				}
				m[*endP] += 1;
			}


			if (dNumbers > k)
			{
				while (end - start >= k + 1)
				{
					//LBRK;
					//PRT("remove number "); PRTI(*(nums + end));
					//LBRK;
					m[*endP] -= 1;
					if (m[*endP] == 0)
					{
						if (dNumbers == k + 1)
						{
							m[*endP] += 1;
							break;
						}
						dNumbers--;
					}
					end--;
					endP--;
					/*
					if (dNumbers <= k)
					{
					end++;
					endP++;
					if (m[*endP] == 0)
					{
					dNumbers++;
					}

					else
					{
					PRT("x"); return 0;
					}

					//LBRK;
					//PRT("add number "); PRTI(*(nums + end));
					//LBRK;

					m[*endP] += 1;
					break;
					}
					*/
				}
			}



			while (dNumbers <= k)
			{
				end++;
				endP++;

				if (end >= n)
				{
					end = n;
					break;
				}

				if (m[*endP] == 0)
				{
					dNumbers++;
				}

				m[*endP] += 1;
			}
		}
		
		if(!wasteFlag && endPrev == end)
		{ wasteFlag = true; }
		
		ans += (ll)(end - start);

		//SITUATION;
	}

	ll lk = k;
	ans += lk * ((lk + 1) / 2.0);
	printf("%lld", ans);

	free(nums);
	/*
	LBRK;
	PRT("Wasted move "); printf("%lld", waste);
	PAUSE;
	*/

	return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 1

Verdict: ACCEPTED

Test 7

Group: 1

Verdict: ACCEPTED

Test 8

Group: 1

Verdict: ACCEPTED

Test 9

Group: 1

Verdict: ACCEPTED

Test 10

Group: 1

Verdict: ACCEPTED

Test 11

Group: 1

Verdict: ACCEPTED

Test 12

Group: 1

Verdict: ACCEPTED

Test 13

Group: 1

Verdict: ACCEPTED

Test 14

Group: 1

Verdict: ACCEPTED

Test 15

Group: 2

Verdict: ACCEPTED

Test 16

Group: 2

Verdict: ACCEPTED

Test 17

Group: 2

Verdict: ACCEPTED

Test 18

Group: 2

Verdict: ACCEPTED

Test 19

Group: 2

Verdict: ACCEPTED

Test 20

Group: 2

Verdict: ACCEPTED

Test 21

Group: 2

Verdict: ACCEPTED

Test 22

Group: 2

Verdict: ACCEPTED

Test 23

Group: 2

Verdict: ACCEPTED

Test 24

Group: 2

Verdict: ACCEPTED

Test 25

Group: 2

Verdict: ACCEPTED

Test 26

Group: 2

Verdict: ACCEPTED

Test 27

Group: 2

Verdict: ACCEPTED

Test 28

Group: 2

Verdict: ACCEPTED

Test 29

Group: 3

Verdict: ACCEPTED

Test 30

Group: 3

Verdict: ACCEPTED

Test 31

Group: 3

Verdict: ACCEPTED

Test 32

Group: 3

Verdict: ACCEPTED

Test 33

Group: 3

Verdict: ACCEPTED

Test 34

Group: 3

Verdict: ACCEPTED

Test 35

Group: 3

Verdict: ACCEPTED

Test 36

Group: 3

Verdict: ACCEPTED

Test 37

Group: 4

Verdict: ACCEPTED

Test 38

Group: 4

Verdict: ACCEPTED

Test 39

Group: 4

Verdict: ACCEPTED

Test 40

Group: 4

Verdict: ACCEPTED

Test 41

Group: 4

Verdict: ACCEPTED

Test 42

Group: 4

Verdict: ACCEPTED

Test 43

Group: 4

Verdict: ACCEPTED

Test 44

Group: 4

Verdict: ACCEPTED

Test 45

Group: 4

Verdict: ACCEPTED

Test 46

Group: 4

Verdict: ACCEPTED

Test 47

Group: 4

Verdict: ACCEPTED

Test 48

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 49

Group: 4

Verdict: ACCEPTED

Test 50

Group: 4

Verdict: ACCEPTED

Test 51

Group: 4

Verdict: ACCEPTED

Test 52

Group: 4

Verdict: ACCEPTED