Submission #818902

#TimeUsernameProblemLanguageResultExecution timeMemory
818902vjudge1Growing Vegetable is Fun 3 (JOI19_ho_t3)C++17
0 / 100
1 ms212 KiB
#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; string s; bool b; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> s; s = '!' + s; FOR(2,i,n) { if(s[i] == s[i-1]) { b = false; FOR(i+1,j,n) { if(s[j] != s[i]) { FORM(j,k,i+1) { swap(s[k],s[k-1]); ans++; } b = true; break; } } if(!b) { cout << -1 << endl; return 0; } } } cout << ans << endl; } /* 5 GGGRR */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...