# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1112383 | vjudge1 | Baloni (COCI15_baloni) | C++17 | 120 ms | 7248 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.
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n;
cin >> n;
vector<int> balon(n);
unordered_map<int, int> ok;
for (int i = 0; i < n; ++i) {
cin >> balon[i];
}
int atis = 0;
for (int agirlik : balon) {
if (ok[agirlik] > 0) {
ok[agirlik]--;
ok[agirlik - 1]++;
} else {
atis++;
ok[agirlik - 1]++;
}
}
cout << atis << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |