# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
931886 | hugsfromadicto | Baloni (COCI15_baloni) | C++14 | 184 ms | 8968 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mxN = 1e6 + 1;
int a[mxN], b[mxN];
void _()
{
int n;
cin >> n;
for(int i = 0;i < n; ++i)
cin >> a[i];
map<int,int>r;
int cnt = 0;
for(int i = 0; i < n; ++i)
{
if(r[a[i] + 1] == 0)
{
cnt++;
}
else
{
r[a[i] + 1]--;
}
r[a[i]]++;
}
cout << cnt;
}
main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tc = 1;
while(tc--)
{
_();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |