binary_search.cpp

/*Author : Abdallah Hemdan */
/***********************************************/
/* Dear online judge:
* I've read the problem, and tried to solve it.
* Even if you don't accept my solution, you should respect my effort.
* I hope my code compiles and gets accepted.
* ___ __
* |\ \|\ \
* \ \ \_\ \
* \ \ ___ \emdan
* \ \ \\ \ \
* \ \__\\ \_\
* \|__| \|__|
*/

#include<iostream>
#defineall(v) v.begin(),v.end()
#definemp make_pair
#definepb push_back
#defineendl'\n'

typedeflonglongint ll;

//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);


usingnamespacestd;

intBinarySearch(vector<int> Arr, int n, int Target) {
int l = 0, r = n - 1;
while (l <= r) {
int mid = (l + r) / 2;
if (Arr[mid] == Target)
return mid;
elseif (Arr[mid] < Target) {
 l = mid + 1; 
 }
elseif (Arr[mid] > Target) {
 r = mid - 1;
 }
 }
return -1; 
}
voidFindinFirst(vector<int> First, int n, vector<int> Second, int k) {
for (int i = 0; i < k; i++)
 cout << BinarySearch(First,n, Second[i]) << "";
}
intmain() {
int n; 
 cin >> n;
 vector<int> First(n); 
for (size_t i = 0; i < n; i++)
 cin >> First[i];

int k;
 cin >> k;
 vector<int> Second(k);
for (size_t i = 0; i < k; i++)
 cin >> Second[i];

FindinFirst(First, n, Second, k);
}