Submission #1231293

#	Time	Username	Problem	Language	Result	Execution time	Memory
1231293		clemmy14	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++20	15 / 100	1 ms	328 KiB

joi2019_ho_t3

#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;
    }
    int ans=0;
    if(a.size() == b.size()) {
        int cur=0;
        for(int i=0; i<n; i++) {
            if(i%2 == 0) {
                cur+=max(a[i/2]-i, 0);
            } else {
                cur+=max(b[i/2]-i, 0);
            }
        }
        ans=cur;
        cur=0;
        for(int i=0; i<n; i++) {
            if(i%2 == 0) {
                cur+=max(b[i/2]-i, 0);
            } else {
                cur+=max(a[i/2]-i, 0);
            }
        }
        ans=min(ans, cur);
    } else {
        if(a.size() < b.size()) swap(a, b);
        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;
}

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