#include #define ADD(a, b) a = (a + ll(b)) % mod #define MUL(a, b) a = (a * ll(b)) % mod #define MAX(a, b) a = max(a, b) #define MIN(a, b) a = min(a, b) #define rep(i, a, b) for(int i = int(a); i < int(b); i++) #define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--) #define all(a) (a).begin(), (a).end() #define sz(v) (int)(v).size() #define pb push_back #define sec second #define fst first #define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__) using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair pi; typedef pair pl; typedef pair ppi; typedef vector vi; typedef vector vl; typedef vector mat; typedef complex comp; void Debug() {cerr << '\n'; } templatevoid Debug(FIRST arg, REST... rest){ cerr<ostream& operator<<(ostream& out,const vector& v) { out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<ostream& operator<<(ostream& out,const pair& v){ out<<"("<& b, int a) { b = b | (b << a); } void solve() { cin >> N >> K; rep(i, 0, N) cin >> A[i]; cin >> Q; rep(i, 0, Q) { cin >> X[i] >> V[i]; X[i]--; } int d = (Q + SB - 1) / SB; rep(q, 0, d) { int lv = q * SB, rv = min((q + 1) * SB, Q); // debug(q); memset(used, 0, sizeof(used)); vi vx; rep(i, lv, rv) { used[X[i]] = true; vx.pb(X[i]); } sort(all(vx)); vx.erase(unique(all(vx)), vx.end()); bitset<15010> bit; bit[0] = 1; rep(i, 0, N) { if(used[i]) continue; get(bit, A[i]); } rep(i, lv, rv) { A[i] = V[i]; auto tmp = bit; rep(j, 0, sz(vx)) { get(tmp, A[vx[j]]); } if(tmp[K]) cout << 1 << "\n"; else cout << 0 << "\n"; } } } uint32_t rd() { uint32_t res; #ifdef __MINGW32__ asm volatile("rdrand %0" :"=a"(res) ::"cc"); #else res = std::random_device()(); #endif return res; } int main() { #ifndef LOCAL ios::sync_with_stdio(false); cin.tie(0); #endif cout << fixed; cout.precision(20); cerr << fixed; cerr.precision(6); rng.seed(rd()); #ifdef LOCAL //freopen("in.txt", "wt", stdout); //for tester if(!freopen("in.txt", "rt", stdin)) return 1; #endif solve(); cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"; return 0; }