# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
978928 | irmuun | Growing Vegetable is Fun 3 (JOI19_ho_t3) | C++17 | 1078 ms | 348 KiB |
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 pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n;
cin>>n;
string s;
cin>>s;
string t=s;
sort(all(t));
vector<char>ch={'R','G','Y'};
int ans=1e9;
do{
bool ok=true;
for(int i=1;i<n;i++){
if(t[i-1]==t[i]){
ok=false;
}
}
if(!ok) continue;
int cur=0;
for(char c:ch){
vector<int>v,u;
for(int i=0;i<n;i++){
if(s[i]==c) v.pb(i);
if(t[i]==c) u.pb(i);
}
for(int i=0;i<v.size();i++){
cur+=abs(v[i]-u[i]);
}
}
ans=min(ans,cur/2);
}while(next_permutation(all(t)));
if(ans==1e9) ans=-1;
cout<<ans;
}
Compilation message (stderr)
# | 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... |