Cod sursa(job #2540414)

Utilizator DanutAldeaDanut Aldea DanutAldea Data 7 februarie 2020 09:53:46
Problema Sortare prin comparare Scor 80
Compilator cpp-32 Status done
Runda Arhiva educationala Marime 1.4 kb
#include <fstream>
#include <ctime>
#include <random>
using namespace std;

//ifstream fin("algsort.in");
//ofstream fout("algsort.out");

FILE * fin=fopen("algsort.in", "r");
FILE * fout=fopen("algsort.out", "w");

int n,v[500001],i;

char buff[100000];
int pp;

int numar(){
    int val=0;

    while(!(buff[pp]>='0' && buff[pp]<='9')){
        pp++;
        if(pp==100000){
            fread(buff,1,100000,fin);
            pp=0;
        }
    }

    while(buff[pp]>='0' && buff[pp]<='9'){
        val=val*10+buff[pp]-'0';

        pp++;
        if(pp==100000){
            fread(buff,1,100000,fin);
            pp=0;
        }
    }

    return val;
}

void quick(int st, int dr){
    if(st>=dr)
        return;

//    int x=st+rand()%(dr-st+1);
//    swap(v[st],v[x]);

    int i=st,j=dr,aux;
    int di=0;
    int dj=-1;
    while(i<j){
        if(v[i]>v[j]){
            swap(v[i],v[j]);

            aux=di;
            di=-dj;
            dj=-aux;
        }
        i+=di;
        j+=dj;
    }

    quick(st,i-1);
    quick(i+1,dr);
}

int main(){
    srand(time(0));
    fread(buff,1,100000,fin);

    n=numar();
    for(i=1;i<=n;i++)
        v[i]=numar();

    for(i=n;i;i--)
        swap(v[rand()*1LL*rand()%i+1],v[i]);

    quick(1,n);

    for(i=1;i<=n;i++)
//        fout<<v[i]<<" ";
        fprintf(fout,"%d ",v[i]);

    return 0;
}