CP-Templates/Miscellaneous/binary_search.cpp at main · Islam-Imad/CP-Templates · 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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include <bits/stdc++.h>
using namespace std;

#define ll long long int
#define X first
#define Y second

struct BinarySearch
{

	bool Fx(ll x)
	{
		return false;
	}

	ll search_false_true(ll l, ll r)
	{
		ll ans = -1;
		while (l <= r)
		{
			ll mid = (l + r) >> 1;
			if (Fx(mid))
			{
				ans = mid;
				r = mid - 1;
			}
			else
			{
				l = mid + 1;
			}
		}
		return ans;
	}

	ll search_true_false(ll l, ll r)
	{
		ll ans = -1;
		while (l <= r)
		{
			ll mid = (l + r) >> 1;
			if (Fx(mid))
			{
				l = mid + 1;
			}
			else
			{
				ans = mid;
				r = mid - 1;
			}
		}
		return ans;
	}
};

void solve()
{
}

int main()
{
	ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#ifdef LOCAL_IO
	freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
	int tc = 1;
	// cin>>tc;
	for (int i = 1; i <= tc; ++i)
	{
		solve();
	}
}