제출 #534752

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
534752		RaresFelix	Monochrome Points (JOI20_monochrome)	C++17	100 / 100	46 ms	5352 KiB

monochrome

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll n, st, dr, mij;
vector<ll> A, B;
ll re(ll k) {
    ll r = 0;
    for(ll i = 0, d; i < n; ++i)
        d = abs(A[i] - B[(i + k) % n]), r += min(d, 2 * n - d) - 1;
    return r;
}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    string C;
    cin >> n >> C;
    for(ll i = 0; i < 2 * n; ++i) (C[i] != C[0] ? B : A).push_back(i);
    st = 0, dr = 2 * n - 1;
    while(st < dr) {
        mij = (st + dr + 1) / 2;
        if(re(mij) < re(mij + 1)) st = mij;
        else dr = mij - 1;
    }
    cout << max({re(st), re((st - 1 + 2 * n) % (2 * n)), re((st + 1) % (2 * n))}) / 2 << "\n";
    return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 21 / 21
• Subtask 3: 10 / 10
• Subtask 4: 65 / 65