Contest Duration: - (local time) (100 minutes) Back to Home

Submission #6682624

Source Code Expand

Copy
```#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;

using _loop_int = int;
#define REP(i,n) for(_loop_int i=0; i<(_loop_int)(n); i++)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a); i<(_loop_int)(b); i++)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1; i>=(_loop_int)(a); i--)

#define CHMIN(a,b) (a)=min((a),(b))
#define CHMAX(a,b) (a)=max((a),(b))
#define ALL(v) (v).begin(),(v).end()

#define DEBUG(x) cerr<<#x<<": "<<(x)<<endl
#define DEBUG_VEC(v) cerr<<#v<<": ";REP(__i,(v).size())cerr<<((v)[__i])<<", ";cerr<<endl

const ll MOD = 1000000007ll;

int n;
int h[125252];

int main(){
scanf("%d",&n);
REP(i,n)scanf("%d",h+i);
REP(i,n){
if(i==0 || h[i-1] < h[i])h[i]--;
}
REP(i,n-1)if(h[i]>h[i+1]){
puts("No");
return 0;
}
puts("Yes");
return 0;
}
```

Submission Info

Submission Time 2019-08-04 21:01:43+0900 C - Build Stairs rickytheta C++14 (GCC 5.4.1) 300 971 Byte AC 13 ms 640 KB

Compile Error

```./Main.cpp: In function ‘int main()’:
./Main.cpp:29:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:30:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
REP(i,n)scanf("%d",h+i);
^
```

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 8 ms 512 KB
testcase_02 AC 13 ms 640 KB
testcase_03 AC 12 ms 640 KB
testcase_04 AC 13 ms 640 KB
testcase_05 AC 5 ms 384 KB
testcase_06 AC 6 ms 384 KB
testcase_07 AC 13 ms 640 KB
testcase_08 AC 10 ms 640 KB
testcase_09 AC 10 ms 640 KB
testcase_10 AC 12 ms 640 KB
testcase_11 AC 12 ms 640 KB
testcase_12 AC 1 ms 256 KB
testcase_13 AC 13 ms 640 KB