#include <bits/stdc++.h>
#define ll long long
#define rep(a,b,c) for(ll a=b; a<c; a++)
#define repr(a,b,c) for(ll a=b-1; a>c-1; a--)
using namespace std;
int main(){
ll n;
string s, s2, s3;
cin>>n>>s;
s2=s;
ll mn=1e9;
sort(s2.begin(),s2.end());
do{
bool ans=true;
rep(i,0,n-1){
if(s2[i]==s2[i+1]) ans=false;
}
if(ans){
s3=s;
ll sum=0;
rep(i,0,n){
if(s2[i]==s3[i]) continue;
rep(j,i,n){
if(s3[j]==s2[i]){
repr(k,j,i) swap(s3[k+1],s3[k]);
sum+=(j-i);
break;
}
}
}
mn=min(mn,sum);
}
}while(next_permutation(s2.begin(),s2.end()));
if(mn<1e9) cout<<mn<<endl;
else cout<<-1<<endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
5 ms |
436 KB |
Output is correct |
| 6 |
Correct |
8 ms |
348 KB |
Output is correct |
| 7 |
Correct |
6 ms |
348 KB |
Output is correct |
| 8 |
Correct |
8 ms |
344 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
5 ms |
348 KB |
Output is correct |
| 12 |
Correct |
11 ms |
348 KB |
Output is correct |
| 13 |
Correct |
2 ms |
348 KB |
Output is correct |
| 14 |
Correct |
3 ms |
344 KB |
Output is correct |
| 15 |
Correct |
8 ms |
348 KB |
Output is correct |
| 16 |
Correct |
0 ms |
348 KB |
Output is correct |
| 17 |
Correct |
0 ms |
352 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
5 ms |
436 KB |
Output is correct |
| 6 |
Correct |
8 ms |
348 KB |
Output is correct |
| 7 |
Correct |
6 ms |
348 KB |
Output is correct |
| 8 |
Correct |
8 ms |
344 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
5 ms |
348 KB |
Output is correct |
| 12 |
Correct |
11 ms |
348 KB |
Output is correct |
| 13 |
Correct |
2 ms |
348 KB |
Output is correct |
| 14 |
Correct |
3 ms |
344 KB |
Output is correct |
| 15 |
Correct |
8 ms |
348 KB |
Output is correct |
| 16 |
Correct |
0 ms |
348 KB |
Output is correct |
| 17 |
Correct |
0 ms |
352 KB |
Output is correct |
| 18 |
Execution timed out |
1054 ms |
500 KB |
Time limit exceeded |
| 19 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Execution timed out |
1088 ms |
352 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
5 ms |
436 KB |
Output is correct |
| 6 |
Correct |
8 ms |
348 KB |
Output is correct |
| 7 |
Correct |
6 ms |
348 KB |
Output is correct |
| 8 |
Correct |
8 ms |
344 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
5 ms |
348 KB |
Output is correct |
| 12 |
Correct |
11 ms |
348 KB |
Output is correct |
| 13 |
Correct |
2 ms |
348 KB |
Output is correct |
| 14 |
Correct |
3 ms |
344 KB |
Output is correct |
| 15 |
Correct |
8 ms |
348 KB |
Output is correct |
| 16 |
Correct |
0 ms |
348 KB |
Output is correct |
| 17 |
Correct |
0 ms |
352 KB |
Output is correct |
| 18 |
Execution timed out |
1054 ms |
500 KB |
Time limit exceeded |
| 19 |
Halted |
0 ms |
0 KB |
- |
