algorithm/10815.cpp at master · taxijjang/algorithm · 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
#include <iostream>
#include <algorithm>

using namespace std;

int arr[500001];
int ass[500001];

int main(void) {
	int N;
	scanf("%d", &N);

	for (int i = 0; i < N; i++) {
		scanf("%d", &arr[i]);
	}

	sort(arr, arr + N);

	int M;
	scanf("%d", &M);

	for (int i = 0; i < M; i++) {
		scanf("%d", &ass[i]);
	}

	for (int i = 0; i < M; i++) {
		int start=0, end=N-1, mid;
		bool correct = false;

		while (start <= end) {
			mid = (start + end) / 2;
			if (arr[mid] < ass[i]) {
				start = mid + 1;
			}
			else if (arr[mid] > ass[i]) {
				end = mid - 1;
			}
			else {
				correct = true;
				break;
			}
		}
		if (correct) {
			printf("%d ", 1);
		}
		else {
			printf("%d ", 0);
		}
	}

}