1633.cpp

int solve(int idx, int b_cnt, int w_cnt){
    if(idx == N) return 0;
    if(b_cnt == 15 && w_cnt == 15) return 0;

    int &ret = cache[idx][b_cnt][w_cnt];
    if(ret != -1) return ret;
    
    // Skip
    ret = max(ret, solve(idx + 1, b_cnt, w_cnt));
    // White
    if(w_cnt < 15)
        ret = max(ret, solve(idx + 1, b_cnt, w_cnt + 1) + arr[idx][0]);
    // Black
    if(b_cnt < 15)
        ret = max(ret, solve(idx + 1, b_cnt + 1, w_cnt) + arr[idx][1]);
    return ret;
}