Cod sursa(job #2701900)

Utilizator ssenseEsanu Mihai ssense Data 2 februarie 2021 09:11:51
Problema Cautare binara Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.36 kb
#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
typedef unsigned long long ull;
typedef long long  ll;
using namespace std;
#define FOR(n) for(int i=0;i<n;i++)
#define vt vector
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define sz(a) (int)a.size()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define nax 100005
#define MXL 1000000000000000000
#define PI 3.14159265
#define pb push_back
#define pf push_front
#define sc second
#define fr first
#define int ll
#define endl '\n'
#define ld long double

vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}

int32_t main(){
	startt;
	freopen("cautbin.in", "r", stdin);
	freopen("cautbin.out", "w", stdout);
	int n;
	cin >> n;
	vint a = read(n);
	int m;
	cin >> m;
	for(int i = 0; i < m; i++)
	{
		int c, x;
		cin >> c >> x;
		if(c == 0)
		{
			int u = upper_bound(all(a), x)- a.begin();
			int l =lower_bound(all(a), x)- a.begin();
			if(u == l)
			{
				cout << -1 << endl;
			}
			else
			{
				cout << u << endl;
			}
		}
		if(c == 1)
		{
			int u = upper_bound(all(a), x)- a.begin();
			cout << u << endl;
		}
		if(c == 2)
		{
			int l =lower_bound(all(a), x)- a.begin();
			cout << l+1 << endl;
		}
	}
}