# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94463 | AntonioDaki | Baloni (COCI15_baloni) | C++14 | 2073 ms | 10872 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;
long long h[1000002];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
long long n, h1, x = 0;
cin >> n;
for(long long i = 0; i < n; ++i) cin >> h[i];
for(long long i = 0; i < n; ++i){
h1 = h[i];
if(h1 != -1){
++x;
for(long long j = 0; j < n; ++j){
if(h1 == h[j]){
h[j] = -1;
--h1;
}
if(!h1) j = n;
}
}
if(*max_element(h, h + n) == -1){
cout << x;
return 0;
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |