# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
386416 |
2021-04-06T14:05:11 Z |
phathnv |
Po (COCI21_po) |
C++11 |
|
13 ms |
1772 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 7;
int n, a[N];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for(int i = 1; i <= n; i++)
cin >> a[i];
a[0] = 0;
int res = 0;
for(int i = 1; i <= n; i++)
res += (a[i] > a[i - 1]);
cout << res;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
400 KB |
Output isn't correct |
3 |
Incorrect |
2 ms |
364 KB |
Output isn't correct |
4 |
Incorrect |
5 ms |
640 KB |
Output isn't correct |
5 |
Incorrect |
7 ms |
792 KB |
Output isn't correct |
6 |
Correct |
13 ms |
1772 KB |
Output is correct |
7 |
Incorrect |
13 ms |
1772 KB |
Output isn't correct |