Taulukko

input/code.cpp: In function 'int main()':
input/code.cpp:25:18: warning: unused variable 'last' [-Wunused-variable]
     unsigned int last=d[0];
                  ^~~~
input/code.cpp:26:24: warning: unused variable 'len' [-Wunused-variable]
     unsigned long long len=0;
                        ^~~

#pragma GCC optimize ("03")
#include<iostream>
#include<unordered_map>

unsigned int d[500100];

// for(size_t i=0;i<n;i++){std::cout<<d[i]<<" ";}

// i could also try to solve this with
// rolling through the array in o(n)
// o(n) isn't probably possible

int main() {
    unsigned int n,k;
    unsigned long long res;
    std::cin>>n>>k;
    for(size_t i=0;i<n;i++){std::cin>>d[i];}
    // res = amount of subarrays to k
    res=n;//std::cout<<"res: "<<res<<"\n";
    for(size_t i=2;i<k+1;i++){
        res+=(n-i+1);//std::cout<<"res: "<<res<<"\n";
    }
    // now we have to compute all subarrays
    // with higher size than k
    unsigned int last=d[0];
    unsigned long long len=0;
    unsigned long long count=0;
    std::unordered_map<unsigned int,unsigned int> map;
    // if(last==d[i]){
    //         count++;
    //         if(count>=k){
    //             res+=(count-1);
    //         }
    //     }
    //     else{count=1;}
    //     last=d[i];
    for(size_t i=0;i<n-k+1;i++){
        count=1;
        map.clear();
        map[d[i]]++;
        for(size_t j=1;j<n-i;j++){
            
            if(!map[d[i+j]]){
                count++; // amount of different numbers
                map[d[i+j]]++;
            }
            if(count>k){break;}
            if(k<j+1){ // if subarray is larger than k
                if(count<1+k){
                    res++;
                    
                }
            }
        }
    }


    std::cout<<res;
}

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

Test 30

Group: 3

Verdict: ACCEPTED

Test 31

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 32

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 33

Group: 3

Verdict: ACCEPTED

Test 34

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 35

Group: 3

Verdict: ACCEPTED

Test 36

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 37

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 38

Group: 4

Verdict: ACCEPTED

Test 39

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 40

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 41

Group: 4

Verdict: ACCEPTED

Test 42

Group: 4

Verdict: ACCEPTED

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

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