Cod sursa(job #3334614)

Utilizator ioanxhIoan Budeanu ioanxh Data 18 ianuarie 2026 17:25:16
Problema Cautare binara Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.27 kb
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops,inline")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define setinf(x) memset(x,0x3f3f3f3f,sizeof(x));
#define set0(x) memset(x,0,sizeof(x));
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define INF 0x3f3f3f3f
#define vi vector<int>
#define ll long long
#define vll vector<ll>
#define pb push_back
#define fi first
#define se second
#define DD 100001
#define nl '\n'
using namespace std;
const string file="cautbin";
ifstream f(file+".in");
ofstream g(file+".out");
//#define f cin
//#define g cout
int n,m;
vi v;
int main(){
    f>>n;
    v.resize(n+1);
    for (int i=1; i<=n; ++i) {
        f>>v[i];
    }
    f>>m;
    while (m--) {
        int t,x;
        f>>t>>x;
        if (t==0) {
            auto it=upper_bound(v.begin(),v.end(),x)-v.begin();
            --it;
            if (v[it]==x) g<<it<<nl;
            else g<<-1<<nl;
        }
        else if (t==1){
            auto it=lower_bound(v.begin(),v.end(),x+1)-v.begin();
            --it;\
            g<<it<<nl;
        }
        else {
            auto it=upper_bound(v.begin(),v.end(),x-1)-v.begin();
            g<<it<<nl;
        }
    }
    system("pause");
    return 0;
}