Cod sursa(job #2228461)

Utilizator inquisitorAnders inquisitor Data 3 august 2018 20:39:08
Problema Sortare prin comparare Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.71 kb
#include <cstdio>

__attribute__((always_inline)) void CountingSort(size_t N, size_t A[], size_t B[], size_t digit)
{
    size_t frequence[0x800]{}, index[0x800]; index[0x0] = ~0x0;

    for(size_t i = N; i; ++frequence[A[--i] >> digit & 0x7FF]);

    for(size_t i = 0x0; i != 0x7FF; index[++i] = index[~-i] + frequence[~-i]);

    for(size_t i = 0x0; i != N; ++i) B[++index[A[i] >> digit & 0x7FF]] = A[i];
}

__attribute__((always_inline)) size_t get_number()
{
    static char inBuffer[0x20000];

    static size_t p = 0x1FFFF; register size_t number = 0x0;

    inBuffer[p] > '/' || ++p ^ 0x20000 || (fread(inBuffer, 0x1, 0x20000, stdin), p = 0x0);

    for(;;)
    {
        number = number * 0xA + inBuffer[p] - 0x30;

        ++p ^ 0x20000 || (fread(inBuffer, 0x1, 0x20000, stdin), p = 0x0);

        if(inBuffer[p] < '0') break;
    }

    return number;
}

char outBuffer[0x4C4B40]; size_t p = 0x4C4B3F;

__attribute__((always_inline)) void put_number(size_t x)
{
    do
    {
        outBuffer[--p] = x % 10 + 48;

        x /= 10;
    }
    while(x);

    outBuffer[--p] = ' ';
}

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

    size_t N, v[0x80000], w[0x80000]; ///declara vectorii global daca iei (0xC00000FD)

    N = get_number();

    for(size_t i = N; --i;)
    {
        v[i] = get_number();
    }

    v[0x0] = get_number();

    CountingSort(N, v, w, 0x0);
    CountingSort(N, w, v, 0xB);
    CountingSort(N, v, w, 0x16);
//p = ~0x0;
    for(size_t i = N; --i;)
    {
        put_number(w[i]);
    }

    put_number(w[0x0]);

    ++p; fwrite(outBuffer + p, 0x1, 0x4C4B40 - p, stdout);

    return 0x0;
}