传送门
题意
分析
没见过这么暴力的2D。。。
因为是按照大小关系加入左边或者右边,所以我们不用考虑顺序关系,首先排序,处理前缀和,快速处理前缀和
然后就是往下
d
f
s
dfs
dfs,标记出现过的和
太暴力了。。。
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
ll a[N], b[N];
map<ll, int> M;
int n, m;
void dfs(int l, int r) {
if (l > r) return;
M[b[r] - b[l - 1]] = 1;
int mid = a[l] + a[r] >> 1;
int L = l, R = r;
if (a[r] <= mid) return;
int x = upper_bound(a + l, a + 1 + r, mid) - a;
dfs(l, x - 1), dfs(x, r);
}
int main() {
int T;
read(T);
while (T--) {
M.clear();
read(n), read(m);
for (int i = 1; i <= n; i++) read(a[i]);
sort(a + 1, a + 1 + n);
for (int i = 1; i <= n; i++) b[i] = b[i - 1] + a[i];
dfs(1, n);
while (m--) {
ll x;
read(x);
if (M[x]) puts("Yes");
else puts("No");
}
}
return 0;
}