Cod sursa(job #2223100)

Utilizator inquisitorAnders inquisitor Data 19 iulie 2018 07:09:35
Problema Cautare binara Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.64 kb
#include <cstdio>

#define BUFFER_SIZE 4194304

char buffer[BUFFER_SIZE], *head = buffer;

bool isDigit[255];

void parseInit()
{
    buffer[fread(buffer, 1, BUFFER_SIZE, stdin)] = 0;

    for(int i = 47; i < 58; ++i) isDigit[i] = 1;
}

__attribute__((always_inline)) int get_number()
{
    int number = 0;

    for(; !isDigit[*head]; ++head);

    for(;  isDigit[*head]; ++head)

        number = number * 10 + (*head) - 48;

    return number;
}

int main()
{
    int N, M, v[100005], task, value, log2N, step, i;

    freopen("cautbin.in", "r", stdin);
    freopen("cautbin.out", "w", stdout);

    parseInit();

    N = get_number();

    for(i = 1; i <= N; ++i)
    {
        v[i] = get_number();
    }

    for(log2N = 1; log2N <= N; log2N <<= 1);

    M = get_number();

    for(; M; --M)
    {
        task = get_number();

        value = get_number();

        if(task < 2)
        {
            for(step = log2N, i = 0; step; step >>= 1)
            {
                if(i + step <= N && v[i + step] <= value)
                {
                    i += step;
                }
            }

            if(!task && v[i] != value)
            {
                printf("-1\n");
            }
            else
            {
                printf("%d\n", i);
            }
        }
        else
        {
            for(step = log2N, i = N; step; step >>= 1)
            {
                if(i - step > 0 && v[i - step] >= value)
                {
                    i -= step;
                }
            }

            printf("%d\n", i);
        }
    }

    return 0;
}