# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
382138 | BlancaHM | Baloni (COCI15_baloni) | C++14 | 454 ms | 7404 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 <iostream>
#include <map>
using namespace std;
int main() {
int N;
cin >> N;
int H[N];
for (int i = 0; i < N; i++)
cin >> H[i];
map<int, int> arrows;
for (int i = 0; i < N; i++) {
if (arrows.find(H[i]) != arrows.end() && arrows[H[i]] > 0)
arrows[H[i]]--;
arrows[H[i]-1]++;
}
int ans = 0;
for (auto it = arrows.begin(); it != arrows.end(); it++)
ans += it->second;
cout << ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |