Cod sursa(job #2852996)

Utilizator amcbnCiobanu Andrei Mihai amcbn Data 19 februarie 2022 19:27:18
Problema Cautare binara Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.18 kb
/// [A][M][C][B][N] ///
#include <bits/stdc++.h>
using namespace std;
const int mod = 9973;
const int inf = 0x3f3f3f3f;
const char sp = ' ', nl = '\n';
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");

int n, m, t, x;
vector<tuple<int, int, int>> v;

void updatecb(int& st, int& dr, int& ans) {
    int mid = (st + dr) / 2;
    if (t == 2)
        get<0>(v[mid]) >= x ? dr = mid - 1, ans = mid : st = mid + 1;
    else
        get<0>(v[mid]) <= x ? st = mid + 1, ans = mid : dr = mid - 1;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    fin >> n;
    for (int i = 1; i <= n; ++i) {
        fin >> x;
        if (v.empty() || get<0>(v.back()) != x)
            v.push_back(make_tuple(x, i, i));
        else
            get<2>(v.back())++;
    }
    fin >> m;
    while (m--) {
        fin >> t >> x;
        int st = 0, dr = v.size() - 1, ans = 0;
        while (st <= dr) {
            updatecb(st, dr, ans);
        }
        if (t == 0) {
            fout << (get<0>(v[ans]) != x ? -1 : get<2>(v[ans])) << nl;
        }
        else {
            fout << (t == 1 ? get<2>(v[ans]) : get<1>(v[ans])) << nl;
        }
    }
}