/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 3ms 328.0 KiB
#2 Wrong Answer 6ms 580.0 KiB
#3 Wrong Answer 7ms 580.0 KiB

Code

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(NULL), cout.tie(NULL);
    
    int t;
    cin >> t;
    
    while (t--)
    {
        int n, k;
        string s;
        cin >> n >> k >> s;
        
        k++;
        vector<int> X;
        
        for (int i = 0; i < n; i++)
        {
            if (s[i] == '0')
                continue;
            
            int ptr = i;
            
            while (s[ptr] == '1')
                ptr++;
            
            X.push_back(ptr - i);
            i = ptr - 1;
        }
        
        int curr = 0;
        k = min(k, (int) X.size());
        
        for (int i = 0; i < k; i++)
            curr += X[i];
        
        int res = curr;
        
        for (int i = k; i < X.size(); i++)
        {
            curr += X[i] - X[i - k];
            res = max(res, curr);
        }
        
        cout << res << "\n";
    }
    
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1159 Binary String
Contest
Brain Booster #8
Language
C++17 (G++ 13.2.0)
Submit At
2025-02-17 14:40:39
Judged At
2025-02-17 14:40:39
Judged By
Score
0
Total Time
7ms
Peak Memory
580.0 KiB