Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.008 s | 2 KBi |
#2 |
Correcto
|
0.006 s | 2 KBi |
#3 |
Correcto
|
0.005 s | 2 KBi |
#4 |
Correcto
|
0.006 s | 2 KBi |
#5 |
Correcto
|
0.004 s | 1 KBi |
#6 |
Correcto
|
0.004 s | 0 KBi |
#7 |
Correcto
|
0.006 s | 2 KBi |
#8 |
Correcto
|
0.002 s | 2 KBi |
#9 |
Correcto
|
0.005 s | 0 KBi |
#10 |
Correcto
|
0.008 s | 2 KBi |
#11 |
Correcto
|
0.007 s | 2 KBi |
#12 |
Correcto
|
0.007 s | 1 KBi |
#13 |
Correcto
|
0.008 s | 2 KBi |
#14 |
Correcto
|
0.007 s | 1 KBi |
#15 |
Correcto
|
0.006 s | 2 KBi |
#16 |
Correcto
|
0.006 s | 3 KBi |
#17 |
Correcto
|
0.006 s | 2 KBi |
#18 |
Correcto
|
0.008 s | 2 KBi |
#19 |
Correcto
|
0.008 s | 2 KBi |
#20 |
Correcto
|
0.004 s | 2 KBi |
#21 |
Correcto
|
0.008 s | 2 KBi |
#22 |
Correcto
|
0.01 s | 1 KBi |
#23 |
Correcto
|
0.006 s | 2 KBi |
#24 |
Correcto
|
0.005 s | 0 KBi |
#25 |
Correcto
|
0.006 s | 2 KBi |
#26 |
Correcto
|
0.007 s | 1 KBi |
#27 |
Correcto
|
0.006 s | 2 KBi |
#28 |
Correcto
|
0.011 s | 4 KBi |
#29 |
Correcto
|
0.006 s | 0 KBi |
#30 |
Correcto
|
0.006 s | 4 KBi |
#31 |
Correcto
|
0.005 s | 2 KBi |
#32 |
Correcto
|
0.01 s | 2 KBi |
#include <bits/stdc++.h> using namespace std; #define endl '\n' #define ll long long #define sz(x) int(x.size()) #define dbg(x) cout << #x << " = " << x << endl int main() { ios_base::sync_with_stdio(false); cin.tie(0); string s; int k; cin >> s >> k; int n = sz(s); int j, dif, ans, fre[26]; memset(fre, 0, sizeof fre); dif = 0; ans = INT_MAX; j = -1; for (int i = 0; i < n; ++i) { while (dif < k && ++j < n) { dif += !fre[s[j] - 'a']; fre[s[j] - 'a']++; } if (dif == k) ans = min(ans, j - i + 1); fre[s[i] - 'a']--; dif -= !fre[s[i] - 'a']; } cout << (ans == INT_MAX ? -1 : ans) << endl; return 0; }