Envío 4103

Código

//
#include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define MOD 1000000007
#define PI 3.14159265
#define EPS 1e-9
#define Pi acos(-1.0)
typedef pair<int, int> ii;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
#define forr(i,a,b) for(int i=(a); i<(b); i++)
#define clean(arr,val) memset(arr,val,sizeof(arr))
#define forn(i,n) forr(i,0,n)
#define PB push_back
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<pll> vpll;

/*CODE START HERE*/

int visited[30];
int ans, k, aS, pivot, different;
string s;

int main(){
    ios::sync_with_stdio(0);
    clean(visited,0);
    cin >> s;
    cin >> k;

    ans = INF;
    aS = 0;
    pivot = 0;
    different = 0;

    forn(i,(int)s.size()){
        // cout << "NOW ON " << s[i] << " AS " << aS << " PIVOT " << pivot << " DIFFERENT " << different << "\n";

        if(visited[s[i]-'a']){
            cout << "YA HA APARECIDO\n";
            for(int j = pivot; j < i; j++){
                aS--;
                visited[s[j]-'a']--;
                if(visited[s[j]-'a'] == 0){
                    pivot = j+1;
                    different--;
                    break;
                }
            }
        }

        visited[s[i]-'a']++;
        if(visited[s[i]-'a'] == 1){
            different++;
        }

        if(different > k){
            cout << "IN\n";
            for(int j = pivot; j <= i; j++){
                aS--;
                visited[s[j]-'a']--;
                if(visited[s[j]-'a'] == 0){
                    different--;
                }

                if(different < k){
                    pivot = j;
                    different++;
                    visited[s[j]-'a']++;
                    aS++;
                    break;
                }

                
            }
        }

        aS++;
        // cout << "NOW ON " << s[i] << " AS " << aS << " PIVOT " << pivot << " DIFFERENT " << different << "\n";
        if(different==k)
            ans = min(ans,aS);

        char temp = s[i];
        while(true){
            i++;
            if(i >= (int)s.size()){
                break;
            }

            if(s[i] != temp){
                i--;
                break;
            }

            visited[s[i]-'a']++;

            aS++;
            if(different==k)
                ans = min(ans,aS);
        }
        // cout << "NOW ON " << s[i] << " AS " << aS << " PIVOT " << pivot << " DIFFERENT " << different << "\n";
    }
    if(ans == INF) ans = -1;
    cout << ans << "\n";
    return 0;
}