#include <bits/stdc++.h> #define endl '\n' #define LL long long #define fi first #define sc second using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int N, K; cin >> N >> K; long long Result = 0; int d = 0; vector<bool> Seen(N); for(int i = 0; i < N; i++){ int a; cin >> a; a--; if(i < K){ if(Seen[a]){ Result -= i; //Result += K - i; d++; } else{ Seen[a] = true; } } else{ if(!Seen[a] && d != 0){ Seen[a] = true; Result += i; //Result += i - K; d--; } } } if(d != 0){ cout << -1 << endl; } else{ cout << Result << endl; } 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 35 36 37 38 39 40 41 42 43 44 45 | #include <bits/stdc++.h> #define endl '\n' #define LL long long #define fi first #define sc second using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int N, K; cin >> N >> K; long long Result = 0; int d = 0; vector<bool> Seen(N); for(int i = 0; i < N; i++){ int a; cin >> a; a--; if(i < K){ if(Seen[a]){ Result -= i; //Result += K - i; d++; } else{ Seen[a] = true; } } else{ if(!Seen[a] && d != 0){ Seen[a] = true; Result += i; //Result += i - K; d--; } } } if(d != 0){ cout << -1 << endl; } else{ cout << Result << endl; } return 0; } |