/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 588.0 KiB
#2 Accepted 1ms 540.0 KiB
#3 Wrong Answer 8ms 584.0 KiB
#4 Wrong Answer 8ms 540.0 KiB

Code

#ifndef LOCAL
#include <bits/stdc++.h>
#define debug(...)
#endif

using namespace std;
#define int long long
#define cinv(v) for (auto &it:v) cin>>it;
#define coutv(v) for (auto &it:v) cout<< it<<' '; cout<<'\n';

void shelby() {
    int n, k;
    string s;
    cin >> n >> k >> s;
    vector<int> id;
    for (int i = 0; i < n; ++i) {
        if (s[i] == '?') {
            id.push_back(i);
            if (id.size() == k) break;
        }
    }
    auto calc = [&](int x)-> int {
        string tmp = s;
        int a = 0, b = 0, ret = 0;
        for (int i = 0; i < n; ++i) {
            if (tmp[i] == '?') tmp[i] = (x == id.size() || i < id[x] ? 'A' : 'B');
            if (tmp[i] == 'A') a++;
            else if (tmp[i] == 'B') b++;
        }
        for (int i = 0; i < n; ++i) {
            if (tmp[i] == 'A') ret += b;
            else if (tmp[i] == 'B') b--;
            if (tmp == "ABA")
                debug(i, a, b, ret);
        }
        return ret;
    };
    debug(id);
    int l = 0, r = id.size(), ans = 0;
    while (l <= r) {
        int m1 = l + (r - l) / 3, m2 = r - (r - l) / 3;
        int calc1 = calc(m1), calc2 = calc(m2);
        if (calc1 >= calc2) ans = max(ans, calc1), r = m2 - 1;
        else ans = max(ans, calc2), l = m1 + 1;
    }
    cout << ans << '\n';
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
    cin >> t;
    for (int _ = 1; _ <= t; ++_) {
        // cout << "Case " << _ << ": ";
        shelby();
    }
}

Information

Submit By
Type
Submission
Problem
P1110 Subsequence of AB
Language
C++17 (G++ 13.2.0)
Submit At
2024-11-06 16:58:34
Judged At
2024-11-06 16:58:34
Judged By
Score
3
Total Time
8ms
Peak Memory
588.0 KiB