#include "bits/stdc++.h" using namespace std; vector <int> d; int o[500007]= {0}; vector <int> p; int main() { int n, k, a; int w = 0; ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; cin >> k; d.reserve(n+7); p.reserve(n+7); d.push_back(0); for (int i = 0; i < n; i++) { cin >> a; d.push_back(a); } o[d[1]]++; for (int i = 2; i <= n; i++) { if (o[d[i]] == 0) { o[d[i]]++; p.push_back(i); } } int j = 1; for (int i = 0; i < p.size(); i++) { j++; w+=(abs(p[i]-j)); } if (k == 1) cout << "0"; else if (p.size() < k-1) cout << "-1"; else cout << w; exit(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 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 | #include "bits/stdc++.h" using namespace std; vector <int> d; int o[500007]= {0}; vector <int> p; int main() { int n, k, a; int w = 0; ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; cin >> k; d.reserve(n+7); p.reserve(n+7); d.push_back(0); for (int i = 0; i < n; i++) { cin >> a; d.push_back(a); } o[d[1]]++; for (int i = 2; i <= n; i++) { if (o[d[i]] == 0) { o[d[i]]++; p.push_back(i); } } int j = 1; for (int i = 0; i < p.size(); i++) { j++; w+=(abs(p[i]-j)); } if (k == 1) cout << "0"; else if (p.size() < k-1) cout << "-1"; else cout << w; exit(0); } |