Submission #1089393

#	Time	Username	Problem	Language	Result	Execution time	Memory
1089393		vjudge1	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++17	15 / 100	1 ms	460 KiB

joi2019_ho_t3

#include <bits/stdc++.h>
//qwerty47924692
using namespace std;
using ll = long long;
#define f first
#define s second
const ll N=3e5+29;
ll cur1,cur2,cnt[3],n,ans=1e18;
vector<ll>pos[3];
string s;
void f(ll x,ll cntr,ll cnty,ll cntg,ll sum,char last){
    if(x==n-1){
        ans=min(ans,sum);
        return;
    }
    x++;
    if(last!='R'&&cntr+1<=cnt[0]){
        f(x,cntr+1,cnty,cntg,sum+abs(x-pos[0][cntr]),'R');
    }if(last!='Y'&&cnty+1<=cnt[1]){
        f(x,cntr,cnty+1,cntg,sum+abs(x-pos[1][cnty]),'Y');
    }if(last!='G'&&cntg+1<=cnt[2]){
        f(x,cntr,cnty,cntg+1,sum+abs(x-pos[2][cntg]),'G');
    }
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin>>n>>s;
    ll x=0;
    for(char i:s){
        if(i=='R'){
            cnt[0]++;
            pos[0].push_back(x++);
        }
        if(i=='Y'){
            cnt[1]++;
            pos[1].push_back(x++);

        }
        if(i=='G'){
            cnt[2]++;
            pos[2].push_back(x++);

        }
    }
    f(-1,0,0,0,0,'J');
    cout<<(ans==1e18 ? -1 : ans/2);
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 55
• Subtask 3: 15 / 15
• Subtask 4: 0 / 25