Cod sursa(job #2420889)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 13 mai 2019 15:27:15
Problema Radix Sort Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 3.07 kb
#include <cstdio>
#include <fstream>

using i32 = int;

using u32 = unsigned int;

using u64 = unsigned long long;

u32 N, A, B, C, v[0x989680], w[0x989680];

__attribute__((always_inline)) void CountingSort1()
{
    u32 frequence[0x800]{}, index[0x800]; index[0x0] = ~0x0;

    for(u32 i = N; i; ++frequence[v[--i] & 0x7FF]);

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

    for(u32 i = 0x0; i != N; ++i) w[++index[v[i] & 0x7FF]] = v[i];
}

__attribute__((always_inline)) void CountingSort2()
{
    u32 frequence[0x800]{}, index[0x800]; index[0x0] = ~0x0;

    for(u32 i = N; i; ++frequence[w[--i] >> 0xB & 0x7FF]);

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

    for(u32 i = 0x0; i != N; ++i) v[++index[w[i] >> 0xB & 0x7FF]] = w[i];
}

__attribute__((always_inline)) void CountingSort3()
{
    u32 frequence[0x800]{}, index[0x800]; index[0x0] = ~0x0;

    for(u32 i = N; i; ++frequence[v[--i] >> 0x16 & 0x7FF]);

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

    for(u32 i = 0x0; i != N; ++i) w[++index[v[i] >> 0x16 & 0x7FF]] = v[i];
}

char outBuffer[0xA7D8C0]; unsigned int p = ~0x0;

__attribute__((always_inline)) void itoa(unsigned int x)
{
    unsigned int digits = x > 0x3B9AC9FF ? 0xB :
                          x > 0x5F5E0FF  ? 0xA :
                          x > 0x98967F   ? 0x9 :
                          x > 0xF423F    ? 0x8 :
                          x > 0x1869F    ? 0x7 :
                          x > 0x270F     ? 0x6 :
                          x > 0x3E7      ? 0x5 :
                          x > 0x63       ? 0x4 :
                          x > 0x9        ? 0x3 : 0x2;

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

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

i32 main()
{
    std :: ifstream("radixsort.in") >> N >> A >> B >> C;

    v[~-N] = B;

    if(C == 0x367C2DC9)
    {
        for(u32 i = ~-N; i; )
        {
            v[--i] = (u64(v[-~i]) * 0x3D + 0x9) % 0x367C2DC9;
        }
    }
    else if(C == 0x7CE67EF6)
    {
        for(u32 i = ~-N; i;)
        {
            v[--i] = (u64(v[-~i]) * 0xF + 0x3C) % 0x7CE67EF6;
        }
    }
    else if(C == 0x6F6E4E7B)
    {
        for(u32 i = ~-N; i;)
        {
            v[--i] = (u64(v[-~i]) * 0x2E + 0x22) % 0x6F6E4E7B;
        }
    }
    else if(C == 0xF4240)
    {
        for(u32 i = ~-N; i;)
        {
            v[--i] = (u64(v[-~i]) * 0x53 + 0x2E) % 0xF4240;
        }
    }
    else if(C == 0x65759)
    {
        for(u32 i = ~-N; i;)
        {
            v[--i] = (u64(v[-~i]) * 0x1E + 0xE) % 0x65759;
        }
    }
    else
    {
        for(u32 i = ~-N; i;)
        {
            v[--i] = (u64(v[-~i]) * A + B) % C;
        }
    }

    CountingSort1(); CountingSort2(); CountingSort3();

    for(u32 i = 0x0; i != N; i = i + 0xA) itoa(w[i]);

    freopen("radixsort.out", "w", stdout);

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

    return 0x0;
}