Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.006 s | 2 KBi |
#2 |
Correcto
|
0.006 s | 2 KBi |
#3 |
Correcto
|
0.005 s | 13 KBi |
#4 |
Correcto
|
0.006 s | 1 KBi |
#5 |
Correcto
|
0.006 s | 2 KBi |
#6 |
Incorrecto
|
0.005 s | 2 KBi |
#7 |
Incorrecto
|
0.007 s | 2 KBi |
#8 |
Incorrecto
|
0.008 s | 1 KBi |
#9 |
Correcto
|
0.006 s | 4 KBi |
#10 |
Correcto
|
0.008 s | 2 KBi |
#11 |
Correcto
|
0.006 s | 1 KBi |
#12 |
Correcto
|
0.005 s | 4 KBi |
// #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*/ bool ord; int n; int arr[1005]; int main(){ ios::sync_with_stdio(0); cin >> n; ord = true; cin >> arr[0]; forr(i,1,n){ cin >> arr[i]; if(arr[i] <= arr[i-1]) ord = false; } if(ord){ cout << "Ordenado\n"; }else{ cout << "Desordenado\n"; } return 0; }