Taulukko

#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define IO ios_base::sync_with_stdio(0); cin.tie(0)
#define ff first
#define ss second
#define pb push_back
#define INF 2147483647
#define LINF (1LL<<61LL)
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define N 505050
ll n; int k;
int t[N];
map<int, int> pos;

struct Node {
	int l, r, v, sz;
} arr[N*38];

int c = 0;
int build(int a, int b) {
	if (b < a) return 0;
	int m = (a+b)/2;
	int j = ++c;
	Node p; p.v = m; 
	p.l = build(a, m-1);
	p.r = build(m+1, b);
	p.sz = 0;
	arr[j] = p;
	return j;
}

int upd(int i, int v, int x) {
	if (!i) return 0;
	int j = ++c;
	int a = arr[i].l, b = arr[i].r;
	if (v < arr[i].v) a = upd(a, v, x);
	if (v > arr[i].v) b = upd(b, v, x);
	Node p; p.v = arr[i].v;
	p.l = a; p.r = b;
	p.sz = arr[i].sz + x;
	arr[j] = p;
	return j;
}

int qr(int i, int v) {
	if (v < arr[i].v) return qr(arr[i].l, v)+arr[i].sz-arr[arr[i].l].sz;
	if (v > arr[i].v) return qr(arr[i].r, v);
	return arr[i].sz - arr[arr[i].l].sz;
}

bool ok(int a, int b) {
	return qr(t[b], a) <= k;
}

int main() {
	IO; cin>>n>>k;
	
	t[0] = build(1, n);
	FOR(i,1,n+1) {
		int v; cin>>v;
		int p = pos[v];
		if (p != 0) t[i] = upd(upd(t[i-1], p, -1), i, 1);
		else t[i] = upd(t[i-1],  i, 1);
		pos[v] = i;
	}
	
	ll r = 0;
	FOR(i,1,n+1) {
		int E = i;
		for (int z=(n-i+1)/2; z>=1; z/=2) {
			while(E+z<=n && ok(i,E+z)) E+=z;
		}
		// E+1 != ok
		ll d = E-i+1;
		r += d-1;
	}
	
	cout<<r+n<<"\n";
}

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: TIME LIMIT EXCEEDED

Test 31

Group: 3

Verdict: ACCEPTED

Test 32

Group: 3

Verdict: ACCEPTED

Test 33

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 34

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 35

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 36

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 37

Group: 4

Verdict: ACCEPTED

Test 38

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 39

Group: 4

Verdict: ACCEPTED

Test 40

Group: 4

Verdict: ACCEPTED

Test 41

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 42

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 43

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 44

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 45

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 46

Group: 4

Verdict: ACCEPTED

Test 47

Group: 4

Verdict: TIME LIMIT EXCEEDED

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