Submission #6687560


Source Code Expand

Copy
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<unordered_set>
#include<unordered_map>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define mad(a,b) a=(a+b)%mod;
ll n,h[100010];
int main(){
  cin>>n;
  for(int i=0;i<n;i++)cin>>h[i];
  h[0]--;
  for(int i=1;i<n;i++){
    if(h[i-1]>h[i]){
      cout<<"No"<<endl;
      return 0;
    }
    if(h[i-1]==h[i])continue;
    h[i]--;
  }
  cout<<"Yes"<<endl;
  return 0;
}

Submission Info

Submission Time
Task C - Build Stairs
User ynymxiaolongbao
Language C++14 (GCC 5.4.1)
Score 300
Code Size 497 Byte
Status AC
Exec Time 46 ms
Memory 1024 KB

Judge Result

Set Name All Sample
Score / Max Score 300 / 300 0 / 0
Status
AC × 17
AC × 4
Set Name Test Cases
All sample_01, sample_02, sample_03, sample_04, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10, testcase_11, testcase_12, testcase_13
Sample sample_01, sample_02, sample_03, sample_04
Case Name Status Exec Time Memory
sample_01 AC 1 ms 256 KB
sample_02 AC 1 ms 256 KB
sample_03 AC 1 ms 256 KB
sample_04 AC 1 ms 256 KB
testcase_01 AC 25 ms 768 KB
testcase_02 AC 40 ms 1024 KB
testcase_03 AC 39 ms 1024 KB
testcase_04 AC 41 ms 1024 KB
testcase_05 AC 13 ms 512 KB
testcase_06 AC 18 ms 640 KB
testcase_07 AC 42 ms 1024 KB
testcase_08 AC 28 ms 1024 KB
testcase_09 AC 31 ms 1024 KB
testcase_10 AC 46 ms 1024 KB
testcase_11 AC 40 ms 1024 KB
testcase_12 AC 1 ms 256 KB
testcase_13 AC 44 ms 1024 KB