█████████ ████ ███░░░░░███ ░░███ ███ ░░░ ██████ ███████ ██████ ██████ ░███ ███░░███ ███░░███ ███░░███ ███░░███ ░███ ░███ ░███░███ ░███ ░███████ ░███ ░███ ░░███ ███░███ ░███░███ ░███ ░███░░░ ░███ ░███ ░░█████████ ░░██████ ░░████████░░██████ ░░██████ ░░░░░░░░░ ░░░░░░ ░░░░░░░░ ░░░░░░ ░░░░░░

Envío 2561

Problema 0xde - Ordenar un arreglo grande

  • Autor: pipelin1010
  • Fecha: 2021-01-05 06:01:44 UTC (Hace alrededor de 4 años)
Caso # Resultado Tiempo Memoria
#1
Incorrecto
0.006 s 1 KBi
#2
Correcto
0.007 s 1 KBi
#3
Incorrecto
0.008 s 2 KBi
#4
Incorrecto
0.004 s 2 KBi
#5
Correcto
0.007 s 1 KBi
#6
Incorrecto
0.006 s 1 KBi
#7
Error en tiempo de ejecución (NZEC) 
Exited with error status 134
free(): invalid pointer
run: line 1:     3 Aborted                 (core dumped) ./a.out
0.014 s 1 KBi
#8
Error en tiempo de ejecución (NZEC) 
Exited with error status 134
free(): invalid pointer
run: line 1:     3 Aborted                 (core dumped) ./a.out
0.014 s 2 KBi
#9
Error en tiempo de ejecución (NZEC) 
Exited with error status 134
free(): invalid pointer
run: line 1:     3 Aborted                 (core dumped) ./a.out
0.019 s 1 KBi
#10
Error en tiempo de ejecución (NZEC) 
Exited with error status 134
free(): invalid pointer
run: line 1:     3 Aborted                 (core dumped) ./a.out
0.024 s 2 KBi
#11
Error en tiempo de ejecución (NZEC) 
Exited with error status 134
free(): invalid pointer
run: line 1:     3 Aborted                 (core dumped) ./a.out
0.027 s 2 KBi
#12
Error en tiempo de ejecución (NZEC) 
Exited with error status 134
double free or corruption (out)
run: line 1:     3 Aborted                 (core dumped) ./a.out
0.024 s 2 KBi
#13
Error en tiempo de ejecución (NZEC) 
Exited with error status 139
run: line 1:     3 Segmentation fault      (core dumped) ./a.out
0.024 s 2 KBi
#14
Error en tiempo de ejecución (NZEC) 
Exited with error status 134
free(): invalid size
run: line 1:     3 Aborted                 (core dumped) ./a.out
0.024 s 1 KBi
#15
Error en tiempo de ejecución (NZEC) 
Exited with error status 139
run: line 1:     3 Segmentation fault      (core dumped) ./a.out
0.026 s 2 KBi
#16
Error en tiempo de ejecución (NZEC) 
Exited with error status 134
free(): invalid pointer
run: line 1:     3 Aborted                 (core dumped) ./a.out
0.026 s 2 KBi
#17
Error en tiempo de ejecución (NZEC) 
Exited with error status 134
munmap_chunk(): invalid pointer
run: line 1:     3 Aborted                 (core dumped) ./a.out
0.026 s 2 KBi
#18
Error en tiempo de ejecución (NZEC) 
Exited with error status 134
munmap_chunk(): invalid pointer
run: line 1:     3 Aborted                 (core dumped) ./a.out
0.016 s 2 KBi
#19
Error en tiempo de ejecución (NZEC) 
Exited with error status 139
run: line 1:     3 Segmentation fault      (core dumped) ./a.out
0.015 s 2 KBi
#20
Error en tiempo de ejecución (NZEC) 
Exited with error status 134
munmap_chunk(): invalid pointer
run: line 1:     3 Aborted                 (core dumped) ./a.out
0.012 s 2 KBi
#21
Error en tiempo de ejecución (NZEC) 
Exited with error status 139
run: line 1:     3 Segmentation fault      (core dumped) ./a.out
0.018 s 2 KBi
#22
Error en tiempo de ejecución (NZEC) 
Exited with error status 134
free(): invalid size
run: line 1:     3 Aborted                 (core dumped) ./a.out
0.021 s 2 KBi
#23
Error en tiempo de ejecución (NZEC) 
Exited with error status 134
munmap_chunk(): invalid pointer
run: line 1:     3 Aborted                 (core dumped) ./a.out
0.022 s 2 KBi
#24
Error en tiempo de ejecución (NZEC) 
Exited with error status 134
a.out: malloc.c:2385: sysmalloc: Assertion `(old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)' failed.
run: line 1:     3 Aborted                 (core dumped) ./a.out
0.024 s 1 KBi
#25
Error en tiempo de ejecución (NZEC) 
Exited with error status 134
free(): invalid pointer
run: line 1:     3 Aborted                 (core dumped) ./a.out
0.019 s 2 KBi
#26
Error en tiempo de ejecución (NZEC) 
Exited with error status 134
free(): invalid pointer
run: line 1:     3 Aborted                 (core dumped) ./a.out
0.025 s 2 KBi
#27
Error en tiempo de ejecución (NZEC) 
Exited with error status 134
free(): invalid pointer
run: line 1:     3 Aborted                 (core dumped) ./a.out
0.016 s 2 KBi
Puntos totales: 8 / 100

Código

//
#include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define MOD 1000000007
#define PI 3.14159265
#define EPS 1e-9
#define Pi acos(-1.0)
typedef pair<int, int> ii;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
#define forr(i,a,b) for(int i=(a); i<(b); i++)
#define clean(arr,val) memset(arr,val,sizeof(arr))
#define forn(i,n) forr(i,0,n)
#define PB push_back
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<pll> vpll;

/*CODE START HERE*/

int n;
vi a;

//Quick sort
void quick(int l, int r){
    bool equal = true;
    forr(i,l,r){
        if(a[i] != a[i+1]){
            equal = false;
        }
    }
    if(equal) return;
    if(l >= r)
        return;
    int indPivot = (rand()%(r-l+1))+l;
    swap(a[l],a[indPivot]);
    int pivot = a[l];
    int p = l;
    for(int i = l+1; i <= r; i++){
        if(pivot >= a[i]){
            swap(a[++p],a[i]);
        }
    }
    swap(a[p],a[l]);
    quick(l,p-1);
    quick(p+1,r);
}

vi merge(int l, int r){
    // cout << "NOW ON L " << l << " R " << r << "\n"; 

    int mid = (l+r)/2;
    int size = (r-l+1);
    vi arrL, arrR, arr;
    if (l == r){
        arr.assign(1,a[l]);
        // cout << "AFTER MERGE L " << l << " R " << r << "\n";
        // forn(i,(int)arr.size()) cout << arr[i] << " ";
        // cout << "\n";
        return arr;
    }
    arrL = merge(l,mid);
    arrR = merge(mid+1,r);
    arr.assign(size,0);

    for(int i = 0, j = 0, k = 0; k <= size; k++){
        if(i > (int)arrL.size()){
            arr[k] = arrR[j];
            j++;
        }else if(j > (int)arrR.size()){
            arr[k] = arrL[i];
            i++;
        }else if(arrL[i] < arrR[j]){
            arr[k] = arrL[i];
            i++;
        }else{
            arr[k] = arrR[j];
            j++;
        }
    }

    // cout << "AFTER MERGE L " << l << " R " << r << "\n";
    // forn(i,(int)arr.size()) cout << arr[i] << " ";
    // cout << "\n";
    return arr;
}

int main(){
    //freopen("out","w",stdout);
    ios::sync_with_stdio(0);
    cin >> n;
    a.assign(n,0);
    forn(i,n) cin >> a[i];
    //quick(0,n-1);
    a = merge(0,n-1);
    cout << a[0];
    forr(i,1,n){
        cout << " " << a[i];
    }
    cout << "\n";
    return 0;
}