#include <bits/stdc++.h> using namespace std; #define ALL(x) (x).begin(), (x).end() template<class C> void mini(C &a5, C b5) { a5 = min(a5, b5); } template<class C> void maxi(C &a5, C b5) { a5 = max(a5, b5); } #ifdef LOCAL const bool debug = true; #else const bool debug = false; #define cerr if (true) {} else cout #endif #define int long long #define double long double const int INF = 1e18; const int mod = 1e9 + 7; const int nax = 1000010; bool is_present[nax]; int ones_count; int res; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, k; cin >> n >> k; for (int i = 1; i <= n; i++) { int a; cin >> a; if (!is_present[a]) { // 0 res += ones_count; } else { // 1 ones_count++; } is_present[a] = true; if (i - ones_count == k) { // there is k zeros cout << res << "\n"; return 0; } } cout << "-1\n"; return 0; }/* 5 3 3 3 3 1 2 3 2 1 1 1 */
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 | #include <bits/stdc++.h> using namespace std; #define ALL(x) (x).begin(), (x).end() template<class C> void mini(C &a5, C b5) { a5 = min(a5, b5); } template<class C> void maxi(C &a5, C b5) { a5 = max(a5, b5); } #ifdef LOCAL const bool debug = true; #else const bool debug = false; #define cerr if (true) {} else cout #endif #define int long long #define double long double const int INF = 1e18; const int mod = 1e9 + 7; const int nax = 1000010; bool is_present[nax]; int ones_count; int res; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, k; cin >> n >> k; for (int i = 1; i <= n; i++) { int a; cin >> a; if (!is_present[a]) { // 0 res += ones_count; } else { // 1 ones_count++; } is_present[a] = true; if (i - ones_count == k) { // there is k zeros cout << res << "\n"; return 0; } } cout << "-1\n"; return 0; }/* 5 3 3 3 3 1 2 3 2 1 1 1 */ |