Cod sursa(job #1316855)

Utilizator thinkphpAdrian Statescu thinkphp Data 14 ianuarie 2015 11:28:39
Problema Sortare prin comparare Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.8 kb
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#define FIN "algsort.in"
#define FOUT "algsort.out"
#define push push_back

typedef unsigned int uint;

class Container {

      public:

      Container(uint _N, std::vector<uint> _vec)
                       :
                       N( _N ), vec( _vec ) {};

      ~Container(){};

      void sort() {

           _qsort(0, N - 1); 
      };

      friend std::ostream &operator << (std::ostream &stream, const Container &obj) {

             std::vector<uint> v = obj.vec;

             for(std::vector<uint>::iterator it = v.begin(); it != v.end(); ++it) stream<<*it<<" "; 

             return stream;
      };

      private:

      std::vector<uint> vec;
      uint N;

      void _s(int x, int y) {

           int aux;

               aux = vec[ x ] ^ vec[ y ];

               vec[ x ] = aux ^ vec[ x ];

               vec[ y ] = aux ^ vec[ y ]; 
      };

      void _qsort(int low, int high) {

           int i = low,

               j = high,

               piv = vec[ (low + high) >> 1 ];

               while(i <= j) {

                     while(vec[ i ] < piv) i++;

                     while(vec[ j ] > piv) j--;

                     if( i <= j ) {_s(i, j); i++; j--;}
               }

               if(low < j) _qsort(low, j); 

               if(i < high) _qsort(i, high);
      };
};

int main() {

    std::vector<uint> vec; 
    uint N;

    freopen(FIN, "r", stdin);

    scanf("%d\n",&N); 

    for(int i = 0, elem; i < N; ++i) scanf("%d", &elem), vec.push( elem );

    fclose( stdin );

    Container obj( N, vec );            

    obj.sort();

    std::ofstream fout( FOUT );

    fout<<obj;

    fout.close();
 
  return(0); 
};