Cod sursa(job #2190935)

Utilizator bigmixerVictor Purice bigmixer Data 1 aprilie 2018 01:03:32
Problema Cautare binara Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.56 kb
#include <bits/stdc++.h>
#define ll long long
#define sz size
#define pb push_back
#define er erase
#define in insert
#define fr first
#define sc second
#define mp make_pair
#define pi pair
#define _ ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
#define rc(s) return cout<<s,0
const int mod=1e9+7;
const int inf=1e5;
using namespace std;
std::multiset<int>::iterator it;
std::multiset<int>::iterator it1;

int a[100005];
int n,t,m;
int x;

int func0(int st, int dr, int x){
    int mij;
    while(st<=dr){
        mij=(st+dr)/2;
        if(a[mij]<=x) st=mij+1;
        else dr=mij-1;
    }
    mij=(dr+st)/2;
    if(a[mij]>x)
        mij--;
    if(a[mij]==x)
        return mij;
    return -1;
}
int func1(int st, int dr, int x){
    int mij;
    while(st<dr){
        mij=(st+dr)/2;
        if(a[mij]<=x) st=mij+1;
        else
            dr=mij;
    }
    mij=(st+dr)/2;
    if(a[mij]>x) mij--;
    return mij;
}
int func2(int st, int dr, int x){
    int mij;
    while(st<dr){
        mij=(st+dr)/2;
        if(a[mij]<x) st=mij+1;
        else dr=mij;
    }
    mij=(dr+st)/2;
    if(a[mij]<x)
        mij++;
    return mij;
}
int main(){ _
    ifstream fin ("cautbin.in");
    ofstream fout("cautbin.out");
    fin >> n;
    for(int i=1;i<=n;i++) fin >> a[i];
    fin >> m;
    for(int i=1;i<=m;i++){
        fin >> t >>x;
        if(t==0){ fout<<func0(1,n,x)<<'\n';  continue; }
        if(t==1){ fout<<func1(1,n,x)<<'\n'; continue; }
        if(t==2){ fout<<func2(1,n,x)<<'\n'; continue; }
    }
}