#include <bits/stdc++.h> using namespace std; using ll = long long; bool used[500009]; int arr[500009]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; for(int i = 0; i < n; i++) { cin >> arr[i]; } ll sum = 0; int pos = 0, x = 0; while(x < k and pos < n) { if(not used[arr[pos]]) { used[arr[pos]] = true; sum += (pos-x); x++; } pos++; } if(pos >= n and x < k) cout << "-1\n"; else cout << sum << "\n"; return 0; }
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 | #include <bits/stdc++.h> using namespace std; using ll = long long; bool used[500009]; int arr[500009]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; for(int i = 0; i < n; i++) { cin >> arr[i]; } ll sum = 0; int pos = 0, x = 0; while(x < k and pos < n) { if(not used[arr[pos]]) { used[arr[pos]] = true; sum += (pos-x); x++; } pos++; } if(pos >= n and x < k) cout << "-1\n"; else cout << sum << "\n"; return 0; } |