# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
232029 |
2020-05-15T18:10:43 Z |
Blerargh |
Baloni (COCI15_baloni) |
C++17 |
|
283 ms |
7800 KB |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6+5;
int main(){
int heights[MAXN];
memset(heights, 0, sizeof(heights));
int n; cin >> n;
int cnt=0;
for (int i=0; i<n; i++){
int x;
cin >> x;
if (heights[x]) heights[x]--;
else cnt++;
heights[x-1]++;
}
cout << cnt;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
4224 KB |
Output is correct |
2 |
Correct |
8 ms |
4224 KB |
Output is correct |
3 |
Correct |
8 ms |
4224 KB |
Output is correct |
4 |
Correct |
8 ms |
4224 KB |
Output is correct |
5 |
Correct |
275 ms |
7800 KB |
Output is correct |
6 |
Correct |
283 ms |
7800 KB |
Output is correct |
7 |
Correct |
243 ms |
7080 KB |
Output is correct |
8 |
Correct |
226 ms |
7032 KB |
Output is correct |
9 |
Correct |
259 ms |
7544 KB |
Output is correct |
10 |
Correct |
251 ms |
7416 KB |
Output is correct |