QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#271989#7880. Streak Manipulationucup-team1001#TL 1ms3480kbC++201.5kb2023-12-02 15:32:142023-12-02 15:32:15

Judging History

你现在查看的是最新测评结果

  • [2023-12-02 15:32:15]
  • 评测
  • 测评结果:TL
  • 用时:1ms
  • 内存:3480kb
  • [2023-12-02 15:32:14]
  • 提交

answer

//#pragma clang diagnostic push
//#pragma ide diagnostic ignored "misc-no-recursion"

#include<bits/stdc++.h>

using namespace std;


int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n, m, k;
    cin >> n >> m >> k;
    string s;
    cin >> s;
    vector<int> v(n + 1);
    for (int i = 0; i < n; ++i) {
        v[i + 1] = v[i] + (s[i] == '0');
    }
    auto cnt0 = [&](int l, int r) {
        return v[r + 1] - v[l];
    };
    auto check = [&](auto self, int k, int m, int start, int ans) -> bool {
        if (ans == 0)return true;
        for (int i = start; i + ans - 1 < n; ++i) {
            if (m >= cnt0(i, i + ans - 1)) {
                if (k == 1)return true;
                int t = i + ans;
                while (t < n && s[t] == '1')t++;
                t++;
                if (self(self, k - 1, m - cnt0(i, i + ans - 1), t, ans))return true;
            }
        }
        return false;
    };
    auto find = [&]() {
        int l = 0, r = n / k + 1;
        while (l + 1 < r) {
            int mid = (l + r) / 2;
            if (check(check, k, m, 0, mid)) {
                l = mid;
            } else {
                r = mid;
            }
        }
        return l;
    };
//    for (int i = 0; i <= n; ++i) {
//        cout << check(check, k, m, 0, i);
//    }
//    cout << endl;
    int ans = find();
    if (ans == 0)ans--;
    cout << ans << endl;
}

//#pragma clang diagnostic pop

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3424kb

input:

8 3 2
10110110

output:

3

result:

ok 1 number(s): "3"

Test #2:

score: 0
Accepted
time: 0ms
memory: 3480kb

input:

12 3 3
100100010011

output:

2

result:

ok 1 number(s): "2"

Test #3:

score: 0
Accepted
time: 1ms
memory: 3424kb

input:

4 4 4
0000

output:

-1

result:

ok 1 number(s): "-1"

Test #4:

score: -100
Time Limit Exceeded

input:

1000 200 5
0001001000101001110010011001101010110101101100010100111110111111010010001100100111100101011100011101011001110010111100100100011001010011000100011111010110100001101110101001110000001000111010000111110100111101100110011010011111000111101001010011000111010111010100101111100000100001011001010...

output:


result: