nQzsb8 - Online C++0x Compiler & Debugging Tool

#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl
inline int power(int a, int b) {
    int x = 1;
    while (b) {
        if (b & 1) x *= a;
        a *= a;
        b >>= 1;
    }
    return x;
}


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

//_ ***************************** START Below *******************************

vector<int> a;
vector<int> h;

int consistency(int n, int k){

    if(n==1){
        if(a[0] > k) return 0;
        return 1;
    }

    int sum = 0;
    int ans = 0;

    int s = 0, e = 0;
    while(e<n){
        sum += a[e];

        while(s<=e && sum > k){
            sum -= a[s];
            s++;
        }

        if(e==0 || h[e-1] % h[e] == 0){
            ans = max(ans, e-s+1);
            e++;
        }
        else{
            //* if  x % y != 0
            //* [ a b c x y]  =>   a b c x [ y ]

            s = e;
            sum = a[e];
            if(sum <= k)    ans = max(ans, e-s+1);

            e++;
        }
    }

    return ans;
}

void solve() {

    int n, k;
    cin>>n >> k;

    a.resize(n);
    h.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    for(int i=0; i<n; i++) cin >> h[i];

    cout << consistency(n, k) << endl;


}


int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}