Cod sursa(job #3241202)

Utilizator Gabriel_DaescuDaescu Gabriel Florin Gabriel_Daescu Data 27 august 2024 16:08:35
Problema Sortare prin comparare Scor 80
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 3.56 kb
#include <bits/stdc++.h>
using namespace std;
int n,i,v[500009];

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;
    }
};

int Divide(int st, int dr)
{
    int poz,pivot;

    poz=st+rand()%(dr-st+1);
    swap(v[st],v[poz]);
    pivot=v[st];

    while(st<dr)
    {
        while(st<dr && v[dr]>=pivot)
        {
            dr--;
        }
        v[st]=v[dr];

        while(st<dr && v[st]<=pivot)
        {
            st++;
        }
        v[dr]=v[st];
    }

    v[st]=pivot;

    return st;
}

void Quick_Sort(int st, int dr)
{
    int poz;
    if(st<dr)
    {
        poz=Divide(st,dr);
        Quick_Sort(st,poz-1);
        Quick_Sort(poz+1,dr);
    }
}

int main()
{
    InParser  fin("algsort.in");
    OutParser fout("algsort.out");
    srand(time(NULL));

    fin>>n;

    for(i=1; i<=n; i++)
    {
        fin>>v[i];
    }

    Quick_Sort(1,n);

    for(i=1; i<=n; i++)
    {
        fout<< v[i] << " ";
    }

    return 0;
}