Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.02 s | 3 KBi |
#2 |
Correcto
|
0.026 s | 4 KBi |
#3 |
Correcto
|
0.021 s | 4 KBi |
#4 |
Correcto
|
0.017 s | 3 KBi |
#5 |
Correcto
|
0.022 s | 3 KBi |
#6 |
Correcto
|
0.024 s | 3 KBi |
#7 |
Correcto
|
0.017 s | 3 KBi |
#8 |
Correcto
|
0.028 s | 7 KBi |
#9 |
Correcto
|
0.016 s | 3 KBi |
#10 |
Correcto
|
0.035 s | 3 KBi |
#11 |
Incorrecto
|
0.023 s | 7 KBi |
#12 |
Incorrecto
|
0.058 s | 8 KBi |
a =[] a_aux=[] N = int(input()) [a.append(x) for x in input().split(' ')] for i in range(N): if i < N-1: if a[i] > a[i + 1]: print('Desordenado') break else: a_aux.append(a[i]) a_aux.append(a[N-1]) if a==a_aux: print('Ordenado')