Envío 4961

Código

/// Write by Daniel Perez .PERAPRO
#include<bits/stdc++.h>

using namespace std;
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pb push_back
#define ff first
#define ss second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using vi=vector<int>;
using vl=vector<ll>;
using pii=pair<int,int>;
char el = '\n';
char esp = ' ';

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ostream& operator<<(ostream& os, const vector<int> &v){
    for(auto const &i: v){
        os<<i<<" ";
    }
    os<<'\n';
    return os;
}
string yes="YES";
string no="NO";

const int N=105;

ll mx[N][N];

ll sums[N][N];

ll oo = 1e15;

int main(){
    fast_io;
    /*
     freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    */
    string s;
    cin>>s;
    int n=s.size();
    int k;
    cin>>k;

    int l=0,r=0;
    map<char,int> m;

    int ans=10000000;
    while(r < n){
        m[s[r]]++;
        while(m.size() >= k){
            m[s[l]]--;
            if(!m[s[l]]) m.erase(s[l]);
            ckmin(ans, r - l + 1);
            l++;
        }

        r++;
    }

    cout<<(ans == 10000000 ? -1 : ans)<<el;

}

/*

*/