Cod sursa(job #3254098)

Utilizator Robert_MitriRobert Mitri Robert_Mitri Data 6 noiembrie 2024 09:14:30
Problema Sortare prin comparare Scor 80
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 3.62 kb
#include <bits/stdc++.h>
using namespace std;

class InParser
{
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch()
    {
        ++sp;
        if (sp == 4096)
        {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume)
    {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n)
    {
        char c;
        while (!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if (c == '-')
        {
            n = 0;
            sgn = -1;
        }
        else
        {
            n = c - '0';
        }
        while (isdigit(c = read_ch()))
        {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }

    InParser& operator >> (long long &n)
    {
        char c;
        n = 0;
        while (!isdigit(c = read_ch()) && c != '-');
        long long sgn = 1;
        if (c == '-')
        {
            n = 0;
            sgn = -1;
        }
        else
        {
            n = c - '0';
        }
        while (isdigit(c = read_ch()))
        {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
};
class OutParser
{
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch)
    {
        if (sp == 50000)
        {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        }
        else
        {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name)
    {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser()
    {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32)
    {
        if (vu32 <= 9)
        {
            write_ch(vu32 + '0');
        }
        else
        {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (long long vu64)
    {
        if (vu64 <= 9)
        {
            write_ch(vu64 + '0');
        }
        else
        {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch)
    {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch)
    {
        while (*ch)
        {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};
const int nmax = 500000;

long long v[nmax + 5];
int n;
int val;

int pivot(int st,int dr)
{
    int trv = 1;
    while(st<dr)
    {
        if(v[st] > v[dr])
            swap(v[st],v[dr]),trv = 1-trv;
        st+=1-trv;
        dr-=trv;
    }
    return st;
}
void quick_sort(int st,int dr)
{
    if( st >= dr)
        return;
    ++val;
    int p = pivot(st,dr);
    quick_sort(st,p-1);
    quick_sort(p+1,dr);
}
void full_sort(long long * v,int l)
{
    unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();
    shuffle(v+1,v+l+1,default_random_engine(seed));
    //for(int i = 1; i < l/2; i ++){
    //   swap(v[i],v[l-i/2]);
    //}
    quick_sort(1,l);
}



int main()
{
    InParser fin("algsort.in");
    OutParser fout("algsort.out");
    fin>>n;
    for(int i=1; i<=n; i++) fin>>v[i];
    full_sort(v,n);
    //fout<<val<<'\n';
    for(int i=1; i<=n; i++) fout<<v[i]<<' ';

}