제출 #1149106

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1149106		_8_8_	Chorus (JOI23_chorus)	C++17	0 / 100	1 ms	328 KiB

chorus

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int  N = (int)1e6 + 10, MOD = 998244353, inf = (int)1e9;

#define int ll

int n, k, a[N], b[N], px[N * 2], py[N * 2], f[N * 2];
string s;

ll dop = 0;
void make() {
    int bal = 0;
    string ret;
    for(int i = 0, col = 0; i < n + n; ++i) {
        if(s[i] == 'A') {
            ret += s[i];
            dop += col;
            bal++;
        } else {
            if(bal) {
                bal--;
                ret += s[i];
            } else {
                col++;
            }
        }
        while(col && bal) {
            ret += 'B';
            bal--;
            col--;
        }
    }
    s = ret;
}
ll dp[N], col[N], pr[N];
int nxt[N];
struct line{
    ll k, b;
    int id;
    ll get(ll x) {
        return k * x + b;
    }
};

vector<line> st;
void add(line nv) {
    st.push_back(nv);
}
pair<ll, int> calc(ll x) {
    ll ret = (ll)1e18;
    ll _;
    for(line i : st) {
        if(ret > i.get(x)) {
            _ = col[i.id] + 1;
        }
        ret = min(ret, i.get(x));
    }
    return {ret, _};
}
line w[N];
pair<ll, int> solve(ll pen) {
    dp[0] = 0;
    col[0] = 0;
    for(int i = 1; i <= n; i++) {
        dp[i] = (ll)1e18;
        col[i] = 0;
    }
    w[0].k=0;w[0].b=0;w[0].id=0;
    int it = 0;
    for(int r = 1; r <= n; r++) {
        while(nxt[it] <= r) {
            add(w[it]);
            it++;
        }
        auto [d, c] = calc(r);
        dp[r] = d + pr[r] + pen;col[r] = c;
        w[r].k = -r;w[r].b = dp[r] - pr[nxt[r] - 1] + r * (nxt[r] - 1);
        w[r].id = r;
        // for(int j = 0; j < it; j++) {
        //     ll u = dp[j] + pen + (pr[r] - pr[nxt[j] - 1]) - j * (r - nxt[j] + 1);
        //     if(dp[r] > u) {
        //         dp[r] = u;
        //         col[r] = col[j] + 1;
        //     }
        // }
    }
    return {dp[n], col[n]};
}
void test() {
    cin >> n >> k;
    cin >> s;
    make();
    int fx = 1, fy = 1;
    for(int i = 1; i <= n + n; i++) {
        if(s[i - 1] == 'A') {
            a[fx++] = i;
        } else {
            b[fy++] = i;
            f[i]++;
        }
    }
    for(int i = 1; i <= n + n; i++) {
        f[i] += f[i - 1];
    }
    for(int i = 1; i <= n; i++) {
        pr[i] = pr[i - 1] + f[a[i]];
    }
    for(int i = 0; i <= n; i++) {
        if(i) {
            nxt[i] = max(i + 1, nxt[i - 1]);
        } else {
            nxt[i] = i + 1;
        }
        while(nxt[i] <= n && f[a[nxt[i]]] < i) {
            nxt[i]++;
        }
    }
    // auto [x, y] = solve(0);
    // cout << x << ' ' << y;
    // return;
    ll l = -1, r = (ll)1e14, res;
    while(r - l > 1) {
        ll mid = (l + r) >> 1;
        auto [val, t] = solve(mid);
        if(t <= k) {
            r = mid;
            res = val - k * 1ll * mid;
        } else {
            l = mid;
        }
    }
    cout << res + dop << '\n';
}
int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    // cin >> t;

    while(t--) {
        test();
    }
}

• Subtask 1: 0 / 16
• Subtask 2: 0 / 24
• Subtask 3: 0 / 21
• Subtask 4: 0 / 26
• Subtask 5: 0 / 13