【Atcoder K - Stones】dp

Atc K
意思是有 n 个石块 每个石块有 a[i]个东西 然后你初始体积是 K
从First 先选 谁不能从当前的块里继续选 谁就输了
输出赢的人
我们知道 设dp[k][t]代表当前有k个石头 t代表人 true则赢 false则输
那么dp[k][t] |= !dp[k-arr[i]][!t] 因为如果另一个人 k-arr[i] 必输 那么你只要取 arr[i] 让他达到这个状态 你就必赢了

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define