Cod sursa(job #2226348)

Utilizator inquisitorAnders inquisitor Data 30 iulie 2018 02:42:05
Problema Range minimum query Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.62 kb
#include <stdio.h>

#define min(x, y) y ^ ((x ^ y) & -(x < y))

#define IN_BUFFER_SIZE 0xBEBC20

char inBuffer[IN_BUFFER_SIZE];

__attribute__((always_inline)) int get_number()
{
    static int p = 0x0; int number = 0x0;

    for(inBuffer[p] > 0x2F || ++p; inBuffer[p] > 0x2F; ++p)

        number = number * 0xA + inBuffer[p] - 0x30;

    return number;
}

char outBuffer[0x7A1]; ///WTF??

int p = ~0x0;

__attribute__((always_inline)) void put_number(int x)
{
    int digits =  x > 0x1869F    ? 0x7 :
                  x > 0x270F     ? 0x6 :
                  x > 0x3E7      ? 0x5 :
                  x > 0x63       ? 0x4 :
                  x > 0x9        ? 0x3 : 0x2;

    for(int i = digits; --i; x /= 0xA)
    {
        outBuffer[p + i] = x % 0xA + 0x30;
    }

    outBuffer[p = p + digits] = 0xA;
}

int RMQ[0x11][0x186A1];

int main()
{
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);

    fread(inBuffer, 0x1, IN_BUFFER_SIZE, stdin);

    int n = get_number(), m = get_number() + 0x1;

    for(int i = 0x1; i <= n; ++i)

        RMQ[0x0][i] = get_number();

    for(int i = 0x0; i < 0x10; ++i)

        for(int j = 0x1; j < n - i; ++j)
        {
            int A = RMQ[i][j], B = RMQ[i][j + (0x1 << i)];

            RMQ[i + 0x1][j] = min(A, B);
        }

    for(int x, y, z, msb, A, B; --m; put_number(min(A, B)))
    {
        x = get_number(), y = get_number(), z = y - x + 0x1, msb;

        asm("bsrl %1, %0" : "=r"(msb) : "r"(z));

        A = RMQ[msb][x], B = RMQ[msb][y + 0x1 - (0x1 << msb)];
    }

    fwrite(outBuffer, 0x1, p, stdout);
}