Submission #51043485

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define fio ios::sync_with_stdio(0);cin.tie(0)
#define For(i,n) for (int i=1;i<=(int)(n);i++)
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define all(x) (x).begin(),(x).end()
#define clr(i) memset(i,0,sizeof(i))
#define Max(a,b,c) max(a,max(b,c))
#define Min(a,b,c) min(a,min(b,c))
#define fore(i,x) for (auto &i:x)
#define pii pair <int,int>
#define vi vector <int>
#define pb push_back
#define ll long long
#define endl '\n'
#define re return
#define se second
#define fi first

const int INF=0x7fffffff;
const int MAXN=+3;

int main(){
	unordered_set <ll> s;
	vi a, b, c;
	int na, nb, nc;
	cin >> na;
	a.resize(na);
	fore(i, a) cin >> i;

	cin >> nb;
	b.resize(nb);
	fore(i, b) cin >> i;

	cin >> nc;
	c.resize(nc);
	fore(i, c) cin >> i;

	fore(i, a) {
		fore(j, b) {
			fore(k, c) {
				s.insert(1ll * i + j + k);
			}
		}
	}

	int nq;
	cin >> nq;
	while (nq--) {
		ll x;
		cin >> x;
		if (s.count(x)) {
			cout << "Yes" << endl;
		} else {
			cout << "No" << endl;
		}
	}
	return 0;
}

Submission Info

Judge Result