# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
927867 | Unforgettablepl | Growing Vegetable is Fun 3 (JOI19_ho_t3) | C++17 | 1048 ms | 600 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 int long long
const int INF = 1e15;
int n;
int calc(vector<int> arr,int start,int mask){
vector<int> target = {start};
for(int bit=0;bit<n;bit++){
target.emplace_back(target.back()+1);
if(mask&(1<<bit))target.back()++;
target.back()%=3;
}
int ans = 0;
for(int i=0;i<arr.size();i++){
int idx = find(arr.begin()+i, arr.end(),target[i])-arr.begin();
if(idx==arr.size())return INF;
ans+=idx-i;
arr.erase(arr.begin()+idx);
arr.insert(arr.begin()+i,target[i]);
}
return ans;
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
vector<int> arr;
for(int i=1;i<=n;i++){
char a;
cin>>a;
if(a=='R') arr.emplace_back(0);
else if(a=='G') arr.emplace_back(1);
else arr.emplace_back(2);
}
int ans = INF;
n--;
for(int start=0;start<3;start++){
for(int mask=0;mask<(1<<n);mask++){
ans = min(ans,calc(arr,start,mask));
}
}
cout << (ans>=INF ? -1 : ans) << '\n';
}
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... |