HDU-2141-Can you find it?（二分搜索）

Give you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three numbers Ai, Bj, Ck, which satisfy the formula Ai+Bj+Ck = X.

Input
There are many cases. Every data case is described as followed: In the first line there are three integers L, N, M, in the second line there are L integers represent the sequence A, in the third line there are N integers represent the sequences B, in the forth line there are M integers represent the sequence C. In the fifth line there is an integer S represents there are S integers X to be calculated. 1<=L, N, M<=500, 1<=S<=1000. all the integers are 32-integers.

Output
For each case, firstly you have to print the case number as the form “Case d:”, then for the S queries, you calculate if the formula can be satisfied or not. If satisfied, you print “YES”, otherwise print “NO”.

Sample Input
3 3 3
1 2 3
1 2 3
1 2 3
3
1
4
10

Sample Output
Case 1:
NO
YES
NO

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<iostream>
#include<algorithm>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<string>
#define ll long long
#define dd double
using namespace std;
ll a[505];
ll b[505];
ll c[505];
ll d[260000];
ll v;
bool flag1 = false;
bool erfen(ll p) {
	ll left = 0;
	ll mid;
	ll right = v - 1;
	while (left <= right) {
		mid = (left + right) / 2;
		if (d[mid] == p) {
			flag1 = true;
			break;
		}
		else if (d[mid] < p) {
			left = mid + 1;
		}
		else {
			right = mid - 1;
		}
	}
	return flag1;
}

int main() {
	ll n, m, k;
	ll T = 1;
	while (cin >> n >> m >> k) {
		v = 0;
		for (ll i = 0; i < n; i++) {
			cin >> a[i];
		}
		for (ll i = 0; i < m; i++) {
			cin >> b[i];
		}
		for (ll i = 0; i < k; i++) {
			cin >> c[i];
		}
		for (ll i = 0; i < n; i++) {
			for (ll j = 0; j < m; j++) {
				d[v++] = a[i] + b[j];
			}
		}
		ll q; cin >> q;
		sort(d, d + v);
		cout << "Case " << T++ << ":" << endl;
		while (q--) {
			ll x;
			cin >> x;
			flag1 = false;
			bool flag = false;
			for (ll i = 0; i < k; i++) {
				if (erfen(x - c[i])) {
					flag = true;
					break;
				}
			}
			if (flag) {
				cout << "YES" << endl;
			}
			else {
				cout << "NO" << endl;
			}
		}
	}
}