Zero Game

input/code.cpp: In function 'int main()':
input/code.cpp:49:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while (b < v.size() && p + v[b] <= k) {
                               ^

#include <bits/stdc++.h>

#define ll long long
#define N (1<<18)
using namespace std;

int main () {
    cin.sync_with_stdio(false);
    cin.tie(0);
    string s;
    cin>>s;
    int q;
    int n = s.length();
    vector<int> v;
    int x = 0;
    int t = 0;
    for (int i = 0; i < n; i++) {
        if (s[i] == '0') t++;
        if (i && s[i] != s[i - 1]) {
            if (!v.empty() || s[i] == '1') v.push_back(i - x);
            x = i;
        }
    }
    if (s.back() == '0') {
        v.push_back(s.length() - x);
    }
    v.push_back(10000000);
    
    cin>>q;
    n = v.size();
    v.push_back(0);
    while (q --> 0) {
        int k;
        cin>>k;
        if (!t) {
            cout<<0<<endl;
            continue;
        }
        int ans = v[0];
        int p = 0; // possible
        int g = 0; // gain
        int b = 1;
        int s = v[0];
        int u = 0; // used
        for (int a = 0; a < n; a += 2) {
            while (b < a) {
                b += 2;
            }
            while (b < v.size() && p + v[b] <= k) {
                p += v[b];
                g += v[b + 1] - v[b];
                if (g >= 0) {
                    s += (p - u) + g;
                    u = p;
                    g = 0;
                }
                b += 2;
            }
            ans = min(max(ans, s + k - u), t);
            s -= v[a];
            if (u) {
                u -= v[a + 1];
                p -= v[a + 1];
            } else if (p) {
                p -= v[a + 1];
                g += v[a + 1];
                g -= v[a + 2];
                s += v[a + 2];
            } else {
                s += v[a + 2];
            }
            if (g >= 0) {
                s += (p - u) + g;
                u = p;
                g = 0;
            }
            ans = min(max(ans, s + k - u), t);
        }
        cout<<ans<<endl;
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: WRONG ANSWER