Submission #963377

#TimeUsernameProblemLanguageResultExecution timeMemory
963377Saul0906Growing Vegetable is Fun 3 (JOI19_ho_t3)C++17
0 / 100
0 ms348 KiB
#include <bits/stdc++.h> #define ll long long #define rep(a,b,c) for(ll a=b; a<c; a++) using namespace std; int main(){ ll n; string s, s2; cin>>n>>s; ll a[3]={n-1,n-1,n-1}, ans=1e9, sum; rep(i,0,n){ if(s[i]=='R') a[0]=min(a[0],i); if(s[i]=='G') a[1]=min(a[1],i); if(s[i]=='Y') a[2]=min(a[2],i); } s2=s; rep(k,0,3){ sum=0; sum+=a[k]; s=s2; swap(s[0],s[a[k]]); rep(i,0,n){ if(i && s[i]==s[i-1]){ rep(j,i,n){ if(s[i]!=s[j]){ swap(s[i],s[j]); sum+=j-i; break; } } if(s[i]==s[i-1]) sum=1e9; } } ans=min(ans,sum); } cout<<s<<endl; if(ans<1e9)cout<<ans<<endl; else cout<<-1<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...