# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
827304 |
2023-08-16T10:48:19 Z |
OAleksa |
Baloni (COCI15_baloni) |
C++14 |
|
64 ms |
18528 KB |
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
#define int long long
const int maxn = 1e6 + 69;
vector<int> cnt(maxn);
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tt = 1;
//cin >> tt;
while(tt--) {
int n;
cin >> n;
vector<int> a(n);
for(int i = 0;i < n;i++)
cin >> a[i];
int ans = 0;
for(int i = 0;i < n;i++) {
if(!cnt[a[i]])
++ans;
else
--cnt[a[i]];
++cnt[a[i] - 1];
}
cout << ans;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
8160 KB |
Output is correct |
2 |
Correct |
3 ms |
8092 KB |
Output is correct |
3 |
Correct |
3 ms |
8172 KB |
Output is correct |
4 |
Correct |
4 ms |
8148 KB |
Output is correct |
5 |
Correct |
47 ms |
17904 KB |
Output is correct |
6 |
Correct |
50 ms |
18528 KB |
Output is correct |
7 |
Correct |
39 ms |
16668 KB |
Output is correct |
8 |
Correct |
37 ms |
16600 KB |
Output is correct |
9 |
Correct |
64 ms |
17296 KB |
Output is correct |
10 |
Correct |
42 ms |
17412 KB |
Output is correct |