Envío 5554

Código

#include <bits/stdc++.h>
#define REP(i,n) for(int i=0; i<n;i++)
#define pb push_back
#define ff first
#define ss second
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define lli long long int
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
ostream& operator<<(ostream& os, const vector<int> &v){
    for(auto const &i: v){
        os<<i<<" ";
    }
    os<<endl;
    return os;
}
const lli mod=(1e9)+7;
const int N = 1e4+1;
int main(){
    fast_io;
    string s;cin>>s;
    int n = s.size();
    int k;cin>>k;
    int l = 0; int r = 0;
    int ans = 1e9;
    map<char,int> m;
    while(r<n){ 
        while(m.size() < k && r<n){//mientras no tengo k distintos
            m[s[r]]++;
            r++;
        }
        if(m.size()>=k)ans = min(ans,r-l);
        while(m.size() >= k){
            m[s[l]]--;
            if (m[s[l]] <= 0)m.erase(s[l]);
            l++;
            if(m.size()>=k)ans = min(ans,r-l);
        }
    }
    (ans == 1e9 ? cout<<-1<<endl : cout<<ans<<endl);
    return 0;
}