Cod sursa(job #2522057)

Utilizator armigheGheorghe Liviu Armand armighe Data 11 ianuarie 2020 22:12:03
Problema Radix Sort Scor 70
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.92 kb
#include<fstream>
#define R 65535//2^16-1
using namespace std;
ifstream f("radixsort.in");
int v[2][10000002],w[10000002],a[R+2];

class writer{
    public:
        writer() {};
        writer(const char *file_name){
            output_file.open(file_name,ios::out | ios::binary);
            output_file.sync_with_stdio(false);
            index=0;}
        inline writer &operator <<(int target){
            aux=0;
            n=target;
            if (!n)
                nr[aux++]='0';
            for (;n;n/=10)
                nr[aux++]=n%10+'0';
            for(;aux;inc())
                buffer[index]=nr[--aux];
            return *this;}
        inline writer &operator <<(const char *target){
            aux=0;
            while (target[aux])
                buffer[index]=target[aux++],inc();
            return *this;}
        ~writer(){
            output_file.write(buffer,index);output_file.close();}
    private:
        fstream output_file;
        static const int SIZE=0x200000;
        int index=0,aux,n;
        char buffer[SIZE],nr[24];
        inline void inc(){
            if(++index==SIZE)
                index=0,output_file.write(buffer,SIZE);}
};
writer g("radixsort.out");

inline void rez()
{
    int n,i,A,B,C;
    f>>n>>A>>B>>C;
    v[0][1]=B;
    for(i=2;i<=n;i++)
        v[0][i]=(1LL*v[0][i-1]*A+B)%C;
    for(i=1;i<=n;i++)
    {
        w[i]=v[0][i]&R;
        a[w[i]]++;
    }
    for(i=1;i<=R;i++)
        a[i]+=a[i-1];
    for(i=n;i>=1;i--)
    {
        v[1][a[w[i]]]=v[0][i];
        a[w[i]]--;
    }
    for(i=0;i<=R;i++)
        a[i]=0;
    for(i=1;i<=n;i++)
    {
        w[i]=(v[1][i]>>16)&R;
        a[w[i]]++;
    }
    for(i=1;i<=R;i++)
        a[i]+=a[i-1];
    for(i=n;i>=1;i--)
    {
        v[0][a[w[i]]]=v[1][i];
        a[w[i]]--;
    }
    for(i=1;i<=n;i+=10)
        g<<v[0][i]<<" ";
}

int main()
{
    rez();
    return 0;
}