Competitive_Programming/codeforces/1461/D.cpp at master · nishitsharma03/Competitive_Programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
//#pragma GCC optimize "trapv"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#define ll long long int
#define fab(a,b,i) for(int i=a;i<b;i++)
#define pb push_back
#define db double
#define mp make_pair
#define endl "\n"
#define f first
#define se second
#define all(x) x.begin(),x.end()
#define MOD 1000000007
#define vll vector<ll>
#define vi vector<int>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define quick ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
ll add(ll x, ll y) {ll res = x + y; return (res >= MOD ? res - MOD : res);}
ll mul(ll x, ll y) {ll res = x * y; return (res >= MOD ? res % MOD : res);}
ll sub(ll x, ll y) {ll res = x - y; return (res < 0 ? res + MOD : res);}
ll power(ll x, ll y) {ll res = 1; x %= MOD; while (y) {if (y & 1)res = mul(res, x); y >>= 1; x = mul(x, x);} return res;}
ll mod_inv(ll x) {return power(x, MOD - 2);}

using namespace std;

int main()
{	quick;
#ifndef ONLINE_JUDGE
	freopen("D:/sublime/input.txt", "r", stdin);
	freopen("D:/sublime/output.txt", "w", stdout);
#endif
	int t;
	cin >> t;
	while (t--)
	{
		int n, q;
		cin >> n >> q;
		vector<int> a(n);
		fab(0, n, i)
		cin >> a[i];
		map<ll, ll> m;

		ll sum = 0;
		sort(all(a));
		vector<ll> pref(n);
		pref[0] = a[0];
		fab(1, n, i)
		{
			pref[i] += pref[i - 1] + a[i];
		}

		m[pref[n - 1]]++;
		for (auto i : m)
		{
			sum += (i.f * i.se);
		}

		queue<pair<int, int> > p;
		p.push({0, n - 1});

		while (!p.empty())
		{
			auto k = p.front();
			p.pop();
			if ( k.f > k.se)
				continue;
			if (k.f == k.se)
			{
				m[a[k.f]]++;
			}

			int l = k.f, r = k.se;
			int mid = (a[l] + a[r]) / 2;
			//cout << "l:" << l << " " << r << " " << mid << endl;
			int ind = lower_bound(all(a), mid + 1) - a.begin();
			//cout << "ind:" << ind << endl;
			if (ind > r )
			{
				//cout << "aaa" << pref[r] - (l > 0 ? pref[l - 1] : 0) << endl;
				m[pref[r] - (l > 0 ? pref[l - 1] : 0)]++;
				continue;
			}
			ll left = (ind > 0 ? pref[ind - 1] : 0) - (l > 0 ? pref[l - 1] : 0);
			ll right = pref[r] - (ind > 0 ? pref[ind - 1] : 0);
			if (left > 0)
			{
				m[left]++;
				p.push({l, ind - 1});
			}
			if (right > 0)
			{
				m[right]++;
				p.push({ind, r});
			}
		}


		while (q--)
		{
			ll req;
			cin >> req;
			if (m.find(req) != m.end())
			{
				cout << "Yes" << endl;
			}
			else
				cout << "No" << endl;

		}


	}


	cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
	return 0;
}