Submission #63240541


Source Code Expand

Copy
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for(ll i=0; i<n; i++)
#define srep(i, s, n) for(ll i=s; (s<=n ? i<n : i>n); i+=(s<=n)*2-1)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define vout(v) {for(auto x: v){cout << x << " ";} cout << endl;}
ll INF = 9223372036800000000;
int inf = 1<<30;
template <typename A = string,
typename B = string,
typename C = string,
typename D = string,
typename E = string>
void dout(A a = "", B b = "", C c = "", D d = "", E e = ""){
cout << a << " " << b << " " << c << " " << d << " " << e << endl;
return;
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;

#define rep(i, n) for(ll i=0; i<n; i++)
#define srep(i, s, n) for(ll i=s; (s<=n ? i<n : i>n); i+=(s<=n)*2-1)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define vout(v) {for(auto x: v){cout << x << " ";} cout << endl;}
ll INF = 9223372036800000000;
int inf = 1<<30;

template <typename A = string,
typename B = string, 
typename C = string, 
typename D = string, 
typename E = string>
void dout(A a = "", B b = "", C c = "", D d = "", E e = ""){
    cout << a << " " << b << " " << c << " " << d << " " << e << endl;
    return;
}

int main(){
    ll n; cin >> n;
    vector<ll> arr(n); rep(i, n) cin >> arr[i];
    bool flag = true;
    rep(i, n-1){
        if(arr[i] >= arr[i+1]) flag = false;
    }
    if(flag) dout("Yes");
    else dout("No");
}








Submission Info

Submission Time
Task A - Strictly Increasing?
User Romilli
Language C++ 20 (gcc 12.2)
Score 100
Code Size 919 Byte
Status AC
Exec Time 1 ms
Memory 3608 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 30
Set Name Test Cases
Sample 00-sample-001.txt, 00-sample-002.txt, 00-sample-003.txt
All 00-sample-001.txt, 00-sample-002.txt, 00-sample-003.txt, 01-random-001.txt, 01-random-002.txt, 01-random-003.txt, 01-random-004.txt, 01-random-005.txt, 01-random-006.txt, 01-random-007.txt, 01-random-008.txt, 01-random-009.txt, 02-small-001.txt, 02-small-002.txt, 02-small-003.txt, 02-small-004.txt, 02-small-005.txt, 02-small-006.txt, 02-small-007.txt, 02-small-008.txt, 02-small-009.txt, 03-large-001.txt, 03-large-002.txt, 03-large-003.txt, 03-large-004.txt, 03-large-005.txt, 03-large-006.txt, 03-large-007.txt, 03-large-008.txt, 03-large-009.txt
Case Name Status Exec Time Memory
00-sample-001.txt AC 1 ms 3608 KB
00-sample-002.txt AC 1 ms 3476 KB
00-sample-003.txt AC 1 ms 3484 KB
01-random-001.txt AC 1 ms 3500 KB
01-random-002.txt AC 1 ms 3484 KB
01-random-003.txt AC 1 ms 3548 KB
01-random-004.txt AC 1 ms 3552 KB
01-random-005.txt AC 1 ms 3492 KB
01-random-006.txt AC 1 ms 3476 KB
01-random-007.txt AC 1 ms 3460 KB
01-random-008.txt AC 1 ms 3480 KB
01-random-009.txt AC 1 ms 3548 KB
02-small-001.txt AC 1 ms 3540 KB
02-small-002.txt AC 1 ms 3464 KB
02-small-003.txt AC 1 ms 3472 KB
02-small-004.txt AC 1 ms 3460 KB
02-small-005.txt AC 1 ms 3452 KB
02-small-006.txt AC 1 ms 3476 KB
02-small-007.txt AC 1 ms 3516 KB
02-small-008.txt AC 1 ms 3408 KB
02-small-009.txt AC 1 ms 3492 KB
03-large-001.txt AC 1 ms 3464 KB
03-large-002.txt AC 1 ms 3552 KB
03-large-003.txt AC 1 ms 3480 KB
03-large-004.txt AC 1 ms 3472 KB
03-large-005.txt AC 1 ms 3396 KB
03-large-006.txt AC 1 ms 3484 KB
03-large-007.txt AC 1 ms 3468 KB
03-large-008.txt AC 1 ms 3480 KB
03-large-009.txt AC 1 ms 3392 KB


2025-03-29 (Sat)
23:12:00 +00:00