This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define endl "\n"
#define pii pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define pque priority_queue
#define pqueg priority_queue<ll,vector<ll>,greater<ll>>
#define que queue<ll>
#define FOR(m,i,n) for(int i=(m); i<=(n); i++)
#define FORM(m,i,n) for(int i=(m); i>=(n); i--)
#define all(v) sort(v.begin(),v.end())
ll n,ans,r,g;
string s;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> s;
s = '!' + s;
FOR(1,i,n) {
if(s[i] == 'R') r++;
else g++;
}
if(abs(r-g) > 1) {
cout << -1 << endl;
return 0;
}
FOR(2,i,n) {
if(s[i] == s[i-1]) {
FOR(i+1,j,n) {
if(s[j] != s[i]) {
FORM(j,k,i+1) {
swap(s[k],s[k-1]);
ans++;
}
break;
}
}
}
}
cout << ans << endl;
}
/*
5
GGGRR
*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |