Submission #1231290

#TimeUsernameProblemLanguageResultExecution timeMemory
1231290clemmy14Growing Vegetable is Fun 3 (JOI19_ho_t3)C++20
0 / 100
1 ms328 KiB
#include<bits/stdc++.h>
using namespace std;

signed main() {
    int n; cin >> n;
    string s; cin >> s;
    vector<int> a, b;
    for(int i=0; i<n; i++) {
        if(s[i] == s[0]) a.push_back(i);
        else b.push_back(i);
    }
    if(max(a.size(), b.size()) - min(a.size(),b.size()) > 1) {
        cout << "-1"; return 0;
    }
    if(a.size() < b.size()) swap(a, b);
    int ans=0;
    for(int i=0; i<n; i++) {
        if(i%2 == 0) {
            ans+=max(a[i/2]-i, 0);
        } else {
            ans+=max(b[i/2]-i, 0);
        }
    }
    cout << ans;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...