224B - Array - CodeForces Solution

bitmasks implementation two pointers *1500

Please click on ads to support us..

Python Code: 

n,k=map(int,input().split())
a=list(map(int,input().split()))
b={}
for i in range(n):
    b[a[i]]=i+1
    if len(b)==k:break
if len(b)==k:
    print(min(b.values()),max(b.values()))
else:
    print(-1,-1)

C++ Code: 

#include <cstdio>
#include <vector>
#include <map>

int main(){

    long n, k; scanf("%ld %ld", &n, &k);
    std::vector<long> a(n); for(long p = 0; p < n; p++){scanf("%ld", &a[p]);}

    std::map<long, long> m;
    long r(0);
    for(r = 0; r < n; r++){
        if(m.count(a[r])){++m[a[r]];}
        else{m[a[r]] = 1;}
        if(m.size() >= k){break;}
    }

    long l(0);
    while(l <= r){
        if(m.count(a[l]) && m[a[l]] > 1){--m[a[l]]; ++l;}
        else{break;}
    }

    if(m.size() < k){l = r = -2;}
    printf("%ld %ld\n", l + 1, r + 1);

    return 0;
}


Comments

Submit
0 Comments
More Questions

768A - Oath of the Night's Watch
156C - Cipher
545D - Queue
459B - Pashmak and Flowers
1538A - Stone Game
1454C - Sequence Transformation
165B - Burning Midnight Oil
17A - Noldbach problem
1350A - Orac and Factors
1373A - Donut Shops
26A - Almost Prime
1656E - Equal Tree Sums
1656B - Subtract Operation
1656A - Good Pairs
1367A - Short Substrings
87A - Trains
664A - Complicated GCD
1635D - Infinite Set
1462A - Favorite Sequence
1445B - Elimination
1656C - Make Equal With Mod
567A - Lineland Mail
1553A - Digits Sum
1359B - New Theatre Square
766A - Mahmoud and Longest Uncommon Subsequence
701B - Cells Not Under Attack
702A - Maximum Increase
1656D - K-good
1426A - Floor Number
876A - Trip For Meal